Sciweavers

507 search results - page 23 / 102
» Sizes of Ordered Decision Trees
Sort
View
KDD
2000
ACM
97views Data Mining» more  KDD 2000»
13 years 11 months ago
Towards an effective cooperation of the user and the computer for classification
Decision trees have been successfully used for the task of classification. However, state-of-the-art algorithms do not incorporate the user in the tree construction process. This ...
Mihael Ankerst, Martin Ester, Hans-Peter Kriegel
NLP
2000
13 years 11 months ago
Learning Rules for Large-Vocabulary Word Sense Disambiguation: A Comparison of Various Classifiers
In this article we compare the performance of various machine learning algorithms on the task of constructing word-sense disambiguation rules from data. The distinguishing characte...
Georgios Paliouras, Vangelis Karkaletsis, Ion Andr...
ICML
1999
IEEE
14 years 8 months ago
Making Better Use of Global Discretization
Before applying learning algorithms to datasets, practitioners often globally discretize any numeric attributes. If the algorithm cannot handle numeric attributes directly, prior ...
Eibe Frank, Ian H. Witten
FLAIRS
2006
13 years 9 months ago
Some Second Order Effects on Interval Based Probabilities
In real-life decision analysis, the probabilities and values of consequences are in general vague and imprecise. One way to model imprecise probabilities is to represent a probabi...
David Sundgren, Mats Danielson, Love Ekenberg
ICMLA
2010
13 years 5 months ago
Classification Models with Global Constraints for Ordinal Data
Ordinal classification is a form of multi-class classification where there is an inherent ordering between the classes, but not a meaningful numeric difference between them. Althou...
Jaime S. Cardoso, Ricardo Sousa