Evolution of reference sets in nearest neighbor classification

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1585, Issue , 1999, Pages 82-89

  Ishibuchi, Hisao ^a   Nakashima, Tomoharu ^a  

^a Osaka Prefecture University   (Japan)

Author keywords

Combinatorial optimization; Genetic algorithms; Knowledge discovery; Multi objective optimization; Nearest neighbor classification; Pattern classification

Indexed keywords

COMBINATORIAL OPTIMIZATION; DATA MINING; MULTIOBJECTIVE OPTIMIZATION; PATTERN RECOGNITION;

BINARY STRING; CLASSIFICATION PERFORMANCE; NEAREST NEIGHBOR CLASSIFICATION; REFERENCE PATTERNS; REFERENCE SET; TRAINING PATTERNS;

GENETIC ALGORITHMS;

EID: 84956859473     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48873-1_12     Document Type: Conference Paper

References (13)

1. Cover, T. M., and Hart, P. E.: “Nearest neighbor pattern classification”, IEEE Trans. on Information Theory. 13 (1967) 21-27.
2. Hart, P.: “The condensed nearest neighbor rule”, IEEE Trans. on Information Theory. 14 (1968) 515-516.
3. Wilson, D. L.: “Asymptotic properties of nearest neighbor rules using edited data”, IEEE Trans. on Systems, Man, and Cybernetics. 2 (1972) 408-420.
4. Dasarathy, B. V.: “Minimal consistent set (MCS) identification for optimal nearest neighbor decision systems design”, IEEE Trans. on Systems, Man, and Cybernetics. 24 (1994) 511-517.
5. Chaudhuri, D., et al.: “Finding a subset of representative points in a data set”, IEEE Trans. on Systems, Man, and Cybernetics. 24 (1994) 1416-1424.
6. Kuncheva, L. I.: “Editing for the k-nearest neighbors rule by a genetic algorithm”, Pattern Recognition Letters. 16 (1995) 809-814.
7. Kuncheva, L. I.: “Fitness functions in editing k-NN reference set by genetic algorithms”, Pattern Recognition. 30 (1997) 1041-1049.
8. Siedlecki, W., and Sklansky, J.: “A note on genetic algorithms for large-scale feature selection”, Pattern Recognition Letters. 10 (1989) 335-347.
9. Kelly, J. D. Jr., and Davis, L.: “Hybridizing the genetic algorithm and the k nearest neighbors classification algorithm”, Proceedings of 4th International Conference on Genetic Algorithm. University California. San Diego (July 13-16, 1991) Morgan Kaufmann Publisher. San Mateo (1991) 377-383.
10. Punch W. F., et al.: “Further research on feature selection and classification using genetic algorithms”, Proceedings of 5th International Conference on Genetic Algorithm. University of Illinois at Urbana-Champaign (July 17-21. 1993) Morgan Kaufmann Publisher. San Mateo (1993) 557-564.
11. Knight, L., and Sen, S.: PLEASE: “A prototype learning system using genetic algorithm”, In: Proceedings of 6th International Conference on Genetic Algorithm. University of Pittsburgh (July 15-19. 1995). Morgan Kaufmann Publisher. San Francisco (1995) 429-435.
12. Ishibuchi, H., Murata, T., and Turksen, I.B.: “Single-objective and two-objective genetic algorithms for selecting linguistic rules for pattern classification problems”, Fuzzy Sets and Systems. 89 (1997) 135-149.
13. Nakashima, T., and Ishibuchi, H.: “GA-based approaches for finding the minimum reference set for nearest neighbor classification”, Proceedings of 5th IEEE International Conference on Evolutionary Computation. Anchorage (March 4-9. 1998). 709-714.