A reduction technique for nearest-neighbor classification: Small groups of examples

Intelligent Data Analysis

Volumn 5, Issue 6, 2001, Pages 463-476

  Kubat, Miroslav ^a   Cooperson Jr , Martin ^b  

^a University of Miami College of Engineering   (United States)

^b University of Louisiana at Lafayette   (United States)

Author keywords

example selection; nearest neighbor classifiers; voting

Indexed keywords

CLASSIFICATION ACCURACY; EXAMPLE SELECTION; NEAREST NEIGHBOR CLASSIFICATION; NEAREST NEIGHBOR CLASSIFIER; REDUCTION TECHNIQUES; SUB CLASSIFIERS; TRAINING SETS; VOTING;

CLASSIFICATION (OF INFORMATION);

EID: 46149086948     PISSN: 1088467X     EISSN: 15714128     Source Type: Journal    
DOI: 10.3233/ida-2001-5603     Document Type: Article

References (39)

1. D.W. Aha, Tolerating Noisy, Irrelevant, and Novel Attributes in Instance-Based Learning Algorithms, International Journal of Man-Machine Studies 36 (1992), 267-287.
2. D.W. Aha, ed., Lazy learning, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1997.
3. D.W. Aha, D. Kibler and M.K. Albert, Instance-based learning algorithms, Machine Learning 6 (1991), 37-66.
4. E. Alpaydin, Voting over multiple condensed nearest neighbors, in: Lazy learning, D. Aha, ed., Kluwer Academic Publishers, pp. 115-132.
5. A. Berson and S.J. Smith, Data warehousing, data mining, and OLAP, McGraw-Hill, 1997.
6. C.L. Blake and C.J. Merz, Repository of machine learning databases, University of California at Irvine, Department of Information and Computer Science, www.ics.uci.edu/̃mlearn/MLRepository.html, 1998.
7. L. Breiman, Bagging predictors, Machine Learning 24 (1996), 123-140.
8. G. Bradshaw, Learning about Speech Sounds: The NEXUS project, Proceedings of the 4th International Workshop on MAchine Learning, Morgan Kaufmann, Irvine, CA, 1987, pp. 1-11.
9. C.E. Brodley, Addressing the Selective Superiority Problem: Automatic Algorithm/Model Class Selection, Proceedings of the Tenth International Machine Learning Conference, Amherst, 1993, pp. 17-24.
10. R.M. Cameron-Jones, Instance selection by encoding length heuristic with random mutation hill climbing, in Proceedings of the Eighth Australian Joint Conference on AI, 1995, pp. 99-106.
11. C.-L. Chang, Finding Prototypes for Nearest Neighbor Classifiers, IEEE Transactions on Computers 23 (1974), 1179-1184.
12. C. Cortes and V. Vapnik, Support vector networks, Machine learning 20 (1995), 273-279.
13. T.M. Cover and P.E. Hart, Nearest neighbor pattern classification, IEEE Transactions on Information Theory IT-13 (1967), 21-27.
14. B.V. Dasarathy, Nearest neighbor (NN) norms: NN pattern classification techniques, IEEE Computer, Society Press, Los Alamitos, CA, 1991.
15. H. Drucker, C. Cortes, L.D. Jackel, Y. LeCun and V. Vapnik, Boosting and Other Ensemble Methods, Neural Computation 6 (1994), 1289-1301.
16. E. Fix and J.L. Hodges, Discriminatory analysis, non-parametric discrimination. USAF School of Aviation Medicine, Randolph Field, TX, Project 21-49-004, Report 4, Contract AF41(128)-3, 1951.
17. Y. Freund, Boosting a weak learning algorithm by majority, Information and Computation 121(2) (1995), 256-285.
18. Y. Freund and R.E. Schapire, Experiments with a new boosting algorithm, Proceedings of the Thirteenth International Conference on Machine Learning, ICML'96, Morgan-Kaufmann, 1996, pp. 148-156.
19. J.H. Friedman, J.L. Bentley and R.A. Finkel, An algorithm for finding best matches in logarithmic expected time, Transactions on Mathematical Software 3(3) (1977).
20. G.W. Gates, The reduced nearest-neighbor rule, IEEE Transactions on Information Theory IT-18 (1972), 431-433.
21. P.E. Hart, The condensed nearest-neighbor rule, IEEE Transactions on Information Theory IT-14 (1968), 515-516.
22. D. Kibler and D.W. Aha, Learning representative exemplars of concepts: an initial case study, Proceedings of the Fourth International Workshop on Machine Learning, Morgan Kaufmann, 1987, pp. 24-30.
23. T. Kohonen, The self-organizing map, Proceedings of the IEEE 78 (1990), 1464-1480.
24. M. Kubat and M. Cooperson, Initializing RBF-networks with small subsets of training examples, Proceedings of the 16th National Conference on Artificial Conference, AAAI-99 Orlando, FL, July 26-28, 1999, pp. 188-193.
25. M. Kubat and M. Cooperson, Voting nearest-neighbor subclassifiers, Proceedings of the 17th International Conference on Machine Learning Palo Alto, CA, 2000, pp. 503-510.
26. M. Kubat, G. Pfurtscheller and D. Flotzinger, AI-based approach to automatic sleep classification, Biological Cybernetics 79 (1994), 443-448.
27. D.G. Lowe, Similarity matrix learning for a variable-kernel classifier, Neural Computation 7 (1995), 72-85.
28. C.J. Merz, Using correspondence analysis to combine classifiers, Machine Learning 36 (1999), 33-58.
29. G.L. Ritter, H.B.Woodruff, S.R. Lowdry and T.L. Isenhour, An algorithm for a selective nearest-neighbor decision rule, IEEE Transactions on Information Theory IT-21 (1975), 665-669.
30. R.E. Schapire, The strength of weak learnability, Machine Learning 5 (1990), 197-227.
31. R.F. Sproull, Refinements to nearest-neighbor searching in k-dimensional trees, Algorithmica 6 (1991), 579-589.
32. I. Tomek, Two modifications of CNN, IEEE Transactions on Systems, Man and Communications SMC-6 (1976), 769-772.
33. V.G. Vovk, Aggregating strategies, in Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990, pp. 371-383.
34. S. Wess, K.-D. Althoff and M.M. Richter, Using k-d trees to improve the retrieval step in case-based reasoning, Topics in Case-Based Reasoning, First European Workshop (EWCBR-93), Springer Verlag, 1993, pp. 67-81.
35. D.L. Wilson, Asymptotic properties of nearest neighbor rules using edited data, IEEE Transactions on Systems, Man, and Cybernetics 2 (1972), 408-421.
36. D.R.Wilson and T.R. Martinez, Instance pruning techniques. Proceedings of the Fourteenth International Conference on Machine Learning, 1997, Morgan Kaufmann.
37. D.R. Wilson and T.R. Martinez, Improved center point selection for radial basis function networks, Proceedings of the International Conference on Artificial Neural Networks and Genetic Algorithms (ICNNGA'97), 1997, pp. 514-517.
38. D.R. Wilson and T.R. Martinez, Reduction techniques for instance-based learning algorithms, Machine Learning 38 (2000), 257-286.
39. J. Zhang, Selecting typical instances in instance-based learning, Proceedings of the Ninth International Conference on Machine Learning, Morgan Kaufmann, 1992.