Sciweavers

225 search results - page 11 / 45
» On Learning Decision Trees with Large Output Domains
Sort
View
CAV
1999
Springer
104views Hardware» more  CAV 1999»
14 years 8 hour ago
On the Representation of Probabilities over Structured Domains
Abstract. In this paper we extend one of the main tools used in veri cation of discrete systems, namely Binary Decision Diagrams (BDD), to treat probabilistic transition systems. W...
Marius Bozga, Oded Maler
IJCAI
2003
13 years 9 months ago
Inductive Learning in Less Than One Sequential Data Scan
Most recent research of scalable inductive learning on very large dataset, decision tree construction in particular, focuses on eliminating memory constraints and reducing the num...
Wei Fan, Haixun Wang, Philip S. Yu, Shaw-hwa Lo
ICIP
2009
IEEE
13 years 5 months ago
An incremental extremely random forest classifier for online learning and tracking
Decision trees have been widely used for online learning classification. Many approaches usually need large data stream to finish decision trees induction, as show notable limitat...
Aiping Wang, Guowei Wan, Zhiquan Cheng, Sikun Li
ML
2010
ACM
135views Machine Learning» more  ML 2010»
13 years 2 months ago
Multi-domain learning by confidence-weighted parameter combination
State-of-the-art statistical NLP systems for a variety of tasks learn from labeled training data that is often domain specific. However, there may be multiple domains or sources o...
Mark Dredze, Alex Kulesza, Koby Crammer
WWW
2008
ACM
14 years 8 months ago
Enhanced hierarchical classification via isotonic smoothing
Hierarchical topic taxonomies have proliferated on the World Wide Web [5, 18], and exploiting the output space decompositions they induce in automated classification systems is an...
Kunal Punera, Joydeep Ghosh