Sciweavers

8 search results - page 2 / 2
» Stable Decision Trees: Using Local Anarchy for Efficient Inc...
Sort
View
ICDM
2010
IEEE
127views Data Mining» more  ICDM 2010»
13 years 4 months ago
Learning Markov Network Structure with Decision Trees
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
Daniel Lowd, Jesse Davis
GREC
2003
Springer
14 years 3 days ago
User Adaptation for Online Sketchy Shape Recognition
This paper presents a method of online sketchy shape recognition that can adapt to different user sketching styles. The adaptation principle is based on incremental active learning...
Zhengxing Sun, Liu Wenyin, Binbin Peng, Bin Zhang,...
ICML
2000
IEEE
14 years 7 months ago
A Dynamic Adaptation of AD-trees for Efficient Machine Learning on Large Data Sets
This paper has no novel learning or statistics: it is concerned with making a wide class of preexisting statistics and learning algorithms computationally tractable when faced wit...
Paul Komarek, Andrew W. Moore