Sciweavers

2884 search results - page 223 / 577
» Evaluating learning algorithms and classifiers
Sort
View
121
Voted
AAAI
2006
15 years 5 months ago
Boosting Expert Ensembles for Rapid Concept Recall
Many learning tasks in adversarial domains tend to be highly dependent on the opponent. Predefined strategies optimized for play against a specific opponent are not likely to succ...
Achim Rettinger, Martin Zinkevich, Michael H. Bowl...
114
Voted
ICML
2008
IEEE
16 years 4 months ago
Boosting with incomplete information
In real-world machine learning problems, it is very common that part of the input feature vector is incomplete: either not available, missing, or corrupted. In this paper, we pres...
Feng Jiao, Gholamreza Haffari, Greg Mori, Shaojun ...
146
Voted
KDD
1999
ACM
185views Data Mining» more  KDD 1999»
15 years 8 months ago
Visual Classification: An Interactive Approach to Decision Tree Construction
Satisfying the basic requirements of accuracy and understandability of a classifier, decision tree classifiers have become very popular. Instead of constructing the decision tree ...
Mihael Ankerst, Christian Elsen, Martin Ester, Han...
151
Voted
PAMI
2007
166views more  PAMI 2007»
15 years 3 months ago
A Comparison of Decision Tree Ensemble Creation Techniques
Abstract—We experimentally evaluate bagging and seven other randomizationbased approaches to creating an ensemble of decision tree classifiers. Statistical tests were performed o...
Robert E. Banfield, Lawrence O. Hall, Kevin W. Bow...
136
Voted
NAACL
2010
15 years 1 months ago
Constraint-Driven Rank-Based Learning for Information Extraction
Most learning algorithms for undirected graphical models require complete inference over at least one instance before parameter updates can be made. SampleRank is a rankbased lear...
Sameer Singh, Limin Yao, Sebastian Riedel, Andrew ...