Sciweavers

225 search results - page 5 / 45
» On Learning Decision Trees with Large Output Domains
Sort
View
ICML
2010
IEEE
13 years 8 months ago
Structured Output Learning with Indirect Supervision
We present a novel approach for structure prediction that addresses the difficulty of obtaining labeled structures for training. We observe that structured output problems often h...
Ming-Wei Chang, Vivek Srikumar, Dan Goldwasser, Da...
AAAI
2006
13 years 9 months ago
A Fast Decision Tree Learning Algorithm
There is growing interest in scaling up the widely-used decision-tree learning algorithms to very large data sets. Although numerous diverse techniques have been proposed, a fast ...
Jiang Su, Harry Zhang
KDD
2000
ACM
121views Data Mining» more  KDD 2000»
13 years 11 months ago
Mining high-speed data streams
Many organizations today have more than very large databases; they have databases that grow without limit at a rate of several million records per day. Mining these continuous dat...
Pedro Domingos, Geoff Hulten
ICDM
2008
IEEE
120views Data Mining» more  ICDM 2008»
14 years 2 months ago
Predicting Future Decision Trees from Evolving Data
Recognizing and analyzing change is an important human virtue because it enables us to anticipate future scenarios and thus allows us to act pro-actively. One approach to understa...
Mirko Böttcher, Martin Spott, Rudolf Kruse
ECAI
2008
Springer
13 years 9 months ago
MTForest: Ensemble Decision Trees based on Multi-Task Learning
Many ensemble methods, such as Bagging, Boosting, Random Forest, etc, have been proposed and widely used in real world applications. Some of them are better than others on noisefre...
Qing Wang, Liang Zhang, Mingmin Chi, Jiankui Guo