Sciweavers

1107 search results - page 62 / 222
» Multi-instance tree learning
Sort
View
ECSQARU
2009
Springer
15 years 5 months ago
Probability Density Estimation by Perturbing and Combining Tree Structured Markov Networks
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
Sourour Ammar, Philippe Leray, Boris Defourny, Lou...
ICDM
2008
IEEE
120views Data Mining» more  ICDM 2008»
15 years 5 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
ECML
2005
Springer
15 years 4 months ago
Simple Test Strategies for Cost-Sensitive Decision Trees
We study cost-sensitive learning of decision trees that incorporate both test costs and misclassification costs. In particular, we first propose a lazy decision tree learning that ...
Shengli Sheng, Charles X. Ling, Qiang Yang
ICML
2004
IEEE
16 years 3 days ago
Decision trees with minimal costs
We propose a simple, novel and yet effective method for building and testing decision trees that minimizes the sum of the misclassification and test costs. More specifically, we f...
Charles X. Ling, Qiang Yang, Jianning Wang, Shicha...
ICASSP
2008
IEEE
15 years 5 months ago
Effective error prediction using decision tree for ASR grammar network in call system
CALL (Computer Assisted Language Learning) systems using ASR (Automatic Speech Recognition) for second language learning have received increasing interest recently. However, it st...
Hongcui Wang, Tatsuya Kawahara