Sciweavers

1209 search results - page 101 / 242
» Semi-Supervised Learning with Trees
Sort
View
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
14 years 6 days ago
Large Datasets Lead to Overly Complex Models: An Explanation and a Solution
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
Tim Oates, David Jensen
TSP
2010
13 years 2 months ago
Gaussian multiresolution models: exploiting sparse Markov and covariance structure
We consider the problem of learning Gaussian multiresolution (MR) models in which data are only available at the finest scale and the coarser, hidden variables serve both to captu...
Myung Jin Choi, Venkat Chandrasekaran, Alan S. Wil...
INFOCOM
2007
IEEE
14 years 2 months ago
Mutual Anonymous Communications: A New Covert Channel Based on Splitting Tree MAC
—Known covert channel based on splitting algorithms in Medium Access Control (MAC) protocols requires the receiver’s knowledge of the sender’s identity. In this paper we pres...
Zhenghong Wang, Jing Deng, Ruby B. Lee
ECML
2005
Springer
14 years 1 months ago
Combining Bias and Variance Reduction Techniques for Regression Trees
Gradient Boosting and bagging applied to regressors can reduce the error due to bias and variance respectively. Alternatively, Stochastic Gradient Boosting (SGB) and Iterated Baggi...
Yuk Lai Suen, Prem Melville, Raymond J. Mooney
NIPS
2003
13 years 9 months ago
Applying Metric-Trees to Belief-Point POMDPs
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of POMDP planning. These approaches operate on sets of...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun