Classification by Feature Partitioning
Machine LearningPublished 1 April 1996Open access
H. Altay Güvenir, İzzet Şirin
Citations26
SJR quartileQ1
SJR score1.15
SNIP2.14
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A new form of exemplar-based learning, based on a representation scheme called feature partitioning, and a particular implementation of this technique called CFP (for Classification by Feature Partitioning), are presented.
Abstract
This paper presents a new form of exemplar-based learning, based on a representation scheme called feature partitioning, and a particular implementation of this technique called CFP (for Classification by Feature Partitioning). Learning in CFP is accomplished by storing the objects separately in each feature dimension as disjoint sets of values called segments. A segment is expanded through generalization or specialized by dividing it into sub-segments. Classification is based on a weighted voting among the individual predictions of the features, which are simply the class values of the segments corresponding to the values of a test instance for each feature. An empirical evaluation of CFP and its comparison with two other classification techniques that consider each feature separately are given.
Keywords
Computer Science
Choice Reviews OnlineGenetic algorithms in search, optimization, and machine learning
49,278 Citations1989
This book brings together the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields.
C4.5: Programs for Machine Learning
23,665 Citations1992J. R. Quinlan
A complete guide to the C4.5 system as implemented in C for the UNIX environment, which starts from simple core learning methods and shows how they can be elaborated and extended to deal with typical problems such as missing data and over hitting.
Genetic Algorithms in Search, Optimization and Machine Learning
17,773 Citations1988David E. Goldberg, David Robson
Communications of the ACMA theory of the learnable
3,268 Citations1984Leslie G. Valiant
This paper regards learning as the phenomenon of knowledge acquisition in the absence of explicit programming, and gives a precise methodology for studying this phenomenon from a computational viewpoint.
Psychological ReviewContext theory of classification learning.
2,976 Citations1978Douglas L. Medin, Marguerite M. Schaffer
A context theory of classificatio n is described in which judgments are assumed to derive exclusively from stored exemplar information, and the main idea is that a probe item acts as a retrieval cue to access information associated with stimuli similar to the probe.
Machine LearningVery Simple Classification Rules Perform Well on Most Commonly Used Datasets
1,798 Citations1993Robert C. Holte
On most datasets studied, the best of very simple rules that classify examples on the basis of a single attribute is as accurate as the rules induced by the majority of machine learning systems.
Communications of the ACMToward memory-based reasoning
1,232 Citations1986Craig Stanfill, David L. Waltz
The intensive use of memory to recall specific episodes from the past—rather than rules—should be the foundation of machine reasoning.
An empirical comparison of pattern recognition, neural nets, and machine learning classification methods
470 Citations1989Sholom M. Weiss, Ioannis Kapouleas
For these problems, which have relatively few hypotheses and features, the machine learning procedures for rule induction or tree induction clearly performed best.
Lecture notes in computer scienceOn changing continuous attributes into ordered discrete attributes
432 Citations1991Jason Catlett
This paper describes how continuous attributes can be converted economically into ordered discrete attributes before being given to the learning system, and suggests this change of representation does not often result in a significant loss of accuracy, but offers large reductions in learning time.
International Journal of Man-Machine StudiesTolerating noisy, irrelevant and novel attributes in instance-based learning algorithms
406 Citations1992David W. Aha
This paper presents a comprehensive sequence of three incremental, edited nearest neighbor algorithms that tolerate attribute noise, determine relative attribute relevances, and accept instances described by novel attributes.
Elsevier eBooksSelecting Typical Instances in Instance-Based Learning
242 Citations1992Jianping Zhang
This paper presents an instance-based learning approach in which typical instances are selected to store as concept descriptions, and empirically shows that some concepts in standard datasets do have graded structures.
Artificial IntelligenceA new basis for state-space learning systems and a successful implementation
99 Citations1983Larry Rendell
A new basis for state-space learning systems is described which centers on a performance measure localized in feature space, and despite the absence of any objective function the parameter vector is locally optimal.
Machine LearningInformation-based evaluation criterion for classifier's performance
98 Citations1991Igor Kononenko, Ivan Bratko
A method for evaluating the information score of a classifier's answers is proposed that excludes the influence of prior probabilities, deals with various types of imperfect or probabilistic answers and can be used also for comparing the performance in different domains.
Lecture notes in computer scienceA hybrid nearest-neighbor and nearest-hyperrectangle algorithm
60 Citations1994Dietrich Wettschereck
Lecture notes in computer scienceDistance metrics for instance-based learning
32 Citations1991Steven L. Salzberg
Examination of three different distance metrics is examined and experimental comparisons using data from three domains: malignant cancer classification, heart disease diagnosis, and diabetes prediction indicate that the Manhattan distance metric works works quite well, although not better than the Euclidean metric that has become a standard for machine learning experiments.
Lecture notes in computer scienceEvaluation of learning systems : An artificial data-based approach
11 Citations1991Hakim Lounis, Gaetan Bisson
The definition of some sensitivity and evaluation criteria which can be used to perform an evaluation of learning systems are presented and the specification of a parametrable generator of artificial learning sets is introduced.
Lecture notes in computer scienceComplexity of the CFP, a method for Classification based on Feature Partitioning
2 Citations1993H. Altay Güvenir, İzzet Şirin
This paper presents a new methodology for learning from examples, called Classification by Feature Partitioning (CFP), by storing the objects separately in each feature dimension as disjoint partitions of values.