Abstract

In most learning systems examples are represented as fixed-length "feature vectors", the components of which are either real numbers or nominal values. We propose an extension of the featurevector representation that allows the value of a feature to be a set of strings; for instance, to represent a small white and black dog with the nominal features size and species and the setvalued feature color, one might use a feature vector with size=small, species=canis-familiaris and color=fwhite,blackg. Since we make no assumptions about the number of possible set elements, this extension of the traditional feature-vector representation is closely connected to Blum's "infinite attribute" representation. We argue that many decision tree and rule learning algorithms can be easily extended to setvalued features. We also show by example that many real-world learning problems can be efficiently and naturally represented with set-valued features; in particular, text categorization problems and probl...

Citations

4071	C4.5: Programs for machine learning - Quinlan - 1993
3143	Classification and Regression Trees - Breiman, Friedman, et al. - 1983
2888	Induction of Decision Trees - Quinlan - 1986
800	Fast effective rule induction - Cohen - 1995
605	Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm - Littlestone - 1988
560	Inverse entailment and progol - Muggleton - 1995
507	An Introduction to Computational Learning Theory - Kearns, Vazirani - 1994
239	Comparison of Two Learning Algorithms for Text Categorization - Lewis, Ringuette - 1994
213	Context-sensitive learning methods for text categorization - Cohen, Singer - 1999
194	Heterogeneous uncertainty sampling for supervised learning - Lewis, Catlett - 1994
141	Representation and Learning in Information Retrieval - Lewis - 1992
92	Generalized subsumption and its application to induction and redundancy - Buntine - 1988
75	Learning the CLASSIC Description Logic: Theoretical and Experimental Results - Cohen, Hirsh - 1994
71	Learning boolean functions in an infinite attribute space - Blum - 1992
57	Hydra: A Noise-Tolerant Relational Concept Learning Algorithm - Ali, Pazzani - 1993
56	Megainduction: A test flight - Catlett - 1991
53	Text Categorization and Relational Learning - Cohen - 1995
52	Text categorization of low quality images - Ittner, Lewis, et al. - 1995
44	Training Text Classifiers by Uncertainty Sampling - Lewis, Gale - 1994
40	Detecting and correcting errors in rule-based expert systems: an integration of empirical and explanation-based learning. Knowledge acquisition 3(2):157--173 - Pazzani, Brunk - 1991
20	Rapid Prototyping of ILP Systems Using Explicit Bias - Cohen - 1993
9	A Bootstrapping Approach to Conceptual Clustering - Morik, Kietz - 1989