Scope classification is a new instance-based learning (IBL) technique with a rule-based characterisation. Within the scope approach, the classification of an object o is based on the examples that are closer to o than every example labelled with another class. In contrast to standard distance-based IBL classifiers, scope classification relies on partial preorderings ≤o between examples, indexed by objects. Interestingly, the notion of closeness to o that is used characterises the classes predicted by all the rules that cover o and are relevant and consistent for the training set. Accordingly, scope classification is an IBL technique with a rule-based characterisation. Since rules do not have to be explicitly generated, the scope approach applies to classification problems where the number of rules prevents them from being exhaustively computed.
Currently at Department of Computer Science, University of Bristol, Merchant Venturers Building, Woodland Road, Bristol BS8 1UB, United Kingdom
[1]
Ron Rymon.
SE-Trees Outperform Decision Trees in Noisy Domains
,
1996,
KDD.
[2]
Pedro M. Domingos.
Unifying Instance-Based and Rule-Based Induction
,
1996,
Machine Learning.
[3]
Ron Rymon.
An SE-tree based Characterization of the Induction Problem
,
1993,
ICML.
[4]
J. Ross Quinlan,et al.
C4.5: Programs for Machine Learning
,
1992
.
[5]
Ron Kohavi,et al.
Automatic Parameter Selection by Minimizing Estimated Error
,
1995,
ICML.
[6]
H. Altay Güvenir,et al.
Classification by Voting Feature Intervals
,
1997,
ECML.
[7]
Michèle Sebag,et al.
Delaying the Choice of Bias: A Disjunctive Version Space Approach
,
1996,
ICML.
[8]
Catherine Blake,et al.
UCI Repository of machine learning databases
,
1998
.