An efficient prototype merging strategy for the condensed 1-NN rule through class-conditional hierarchical clustering

Pattern Recognition

Volumn 35, Issue 12, 2002, Pages 2771-2782

  Mollineda, R A ^a   Ferri, F J ^b   Vidal, E ^a  

^a INSTITUTO TECNOLÓGICO DE INFORMÁTICA   (Spain)

^b UNIVERSITY OF VALENCIA   (Spain)

Author keywords

Class conditional hierarchical clustering; Cluster based condensing; Nearest neighbor; Prototype merging

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); MERGING; SOFTWARE PROTOTYPING;

CLASS-CONDITIONAL HIERARCHICAL CLUSTERING; GEOMETRIC CLUSTER PROPERTIES;

PATTERN RECOGNITION;

CLUSTER ANALYSIS; PATTERN RECOGNITION;

EID: 0036887535     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(01)00208-4     Document Type: Article

References (21)

1. Nearest prototype classification: Clustering, genetic algorithms, or random search?
2. The condensed nearest neighbor rule
3. Minimal consistent set (MCS) identification for optimal nearest neighbour decision systems design
4. Another move towards the minimum consistent subset: A tabu search approach to the condensed nearest neighbor rule
5. Prototype and feature selection by sampling and random mutation hill climbing algorithms
6. Reduction techniques for instance-based learning algorithms
7. Adaptive nearest neighbor pattern classifier
8. A cluster-based merging strategy for nearest prototype classifiers
9. Finding prototypes for nearest neighbor classifiers
10. Multiple-prototype classifier design
11. A survey of recent advances in hierarchical clustering algorithms
12. The IRISes of the gaspe peninsula
13. Asymptotic properties of nearest neighbour rules using edited data
14. New formulation and improvements of the nearest-neighbour approximating and climinating search algorithm (AESA)
15. A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements
16. Fast nearest-neighbour search algorithms based on approximation-elimination search