Sciweavers

1107 search results - page 35 / 222
» Multi-instance tree learning
Sort
View
ICML
2007
IEEE
16 years 19 hour ago
Sample compression bounds for decision trees
We propose a formulation of the Decision Tree learning algorithm in the Compression settings and derive tight generalization error bounds. In particular, we propose Sample Compres...
Mohak Shah
ICDM
2006
IEEE
164views Data Mining» more  ICDM 2006»
15 years 5 months ago
Unsupervised Learning of Tree Alignment Models for Information Extraction
We propose an algorithm for extracting fields from HTML search results. The output of the algorithm is a database table– a data structure that better lends itself to high-level...
Philip Zigoris, Damian Eads, Yi Zhang
PAKDD
2010
ACM
212views Data Mining» more  PAKDD 2010»
15 years 4 months ago
Fast Perceptron Decision Tree Learning from Evolving Data Streams
Abstract. Mining of data streams must balance three evaluation dimensions: accuracy, time and memory. Excellent accuracy on data streams has been obtained with Naive Bayes Hoeffdi...
Albert Bifet, Geoffrey Holmes, Bernhard Pfahringer...
RIVF
2008
15 years 19 days ago
Unsupervised learning for image classification based on distribution of hierarchical feature tree
The classification image into one of several categories is a problem arisen naturally under a wide range of circumstances. In this paper, we present a novel unsupervised model for ...
Thach-Thao Duong, Joo-Hwee Lim, Hai-Quan Vu, Jean-...
CVPR
2008
IEEE
16 years 1 months ago
Learning stick-figure models using nonparametric Bayesian priors over trees
We present a fully probabilistic stick-figure model that uses a nonparametric Bayesian distribution over trees for its structure prior. Sticks are represented by nodes in a tree i...
Edward Meeds, David A. Ross, Richard S. Zemel, Sam...