Sciweavers

1283 search results - page 67 / 257
» Learning Voting Trees
Sort
View
ICML
2000
IEEE
14 years 8 months ago
Exploiting the Cost (In)sensitivity of Decision Tree Splitting Criteria
This paper investigates how the splitting criteria and pruning methods of decision tree learning algorithms are influenced by misclassification costs or changes to the class distr...
Chris Drummond, Robert C. Holte
ML
2010
ACM
159views Machine Learning» more  ML 2010»
13 years 6 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter
ICML
2006
IEEE
14 years 8 months ago
Statistical debugging: simultaneous identification of multiple bugs
We describe a statistical approach to software debugging in the presence of multiple bugs. Due to sparse sampling issues and complex interaction between program predicates, many g...
Alice X. Zheng, Michael I. Jordan, Ben Liblit, May...
CITA
2005
IEEE
14 years 1 months ago
Cache Hierarchy Inspired Compression: a Novel Architecture for Data Streams
- We present an architecture for data streams based on structures typically found in web cache hierarchies. The main idea is to build a meta level analyser from a number of levels ...
Geoffrey Holmes, Bernhard Pfahringer, Richard Kirk...
CIKM
2005
Springer
13 years 9 months ago
Using RankBoost to compare retrieval systems
This paper presents a new pooling method for constructing the assessment sets used in the evaluation of retrieval systems. Our proposal is based on RankBoost, a machine learning v...
Huyen-Trang Vu, Patrick Gallinari