Bayesian instance selection for the nearest neighbor rule

Machine Learning

Volumn 81, Issue 3, 2010, Pages 229-256

  Ferrandiz, Sylvain ^a   Boullé, Marc ^a  

^a ORANGE LABS   (France)

Author keywords

Instance selection; Maximum a posteriori; Nearest neighbor; Voronoi tesselation

Indexed keywords

BAYESIAN; CLASSIFICATION SCHEME; COMMONLY USED; COMPRESSION RATES; COMPUTATIONAL TIME; DISTANCE METRICS; INSTANCE SELECTION; MAXIMUM A POSTERIORI; MAXIMUM A POSTERIORI CRITERIA; MULTI CRITERIA ANALYSIS; NEAREST NEIGHBOR RULE; NEAREST NEIGHBORS; OPTIMIZATION ALGORITHMS; PREDICTIVE ACCURACY; REAL DATA SETS; STATE-OF-THE-ART ALGORITHMS; SYNTHETIC DATASETS; VORONOI TESSELATION;

ALGORITHMS; DATA PROCESSING; PATTERN RECOGNITION; RELIABILITY ANALYSIS;

POPULATION STATISTICS;

EID: 78049529494     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-010-5170-2     Document Type: Article

References (39)

1. D. W. Aha 1992 Tolerating noisy, irrelevant and novel attributes in instance-based learning algorithms International Journal of Man-Machine Studies 36 2 267 287 10.1016/0020-7373(92)90018-G
2. D. Aha D. Kibler M. Albert 1991 Instance-based learning algorithms Machine Learning 6 37 66
3. Asuncion, A., & Newman, D. (2007). UCI Machine Learning Repository. Irvine, CA: University of California, School of Information and Computer Science. http://www.ics.uci.edu/~mlearn/MLRepository.html.
4. Berndt, D., & Clifford, J. (1996). Finding patterns in time series: a dynamic programming approach (Tech. rep.). Advances Knowledge Discovery Data Mining.
5. Bhattacharya, B. K., Mukherjee, K., & Toussaint, G. T. (2005). Geometric decision rules for instance-based learning problems. In S. K. Pal, S. Bandyopadhyay, & S. Biswas (Eds.), Lecture notes in computer science : Vol. 3776. PReMI (pp. 60-69). Berlin: Springer.
6. H. Brighton C. Mellish 2002 Advances in instance selection for instance-based learning algorithms Data Mining and Knowledge Discovery 6 2 153 172 1027.68673 10.1023/A:1014043630878 1917935 (Pubitemid 37113870)
7. Bunke, H. (2000). Recent developments in graph matching. In ICPR (pp. 2117-2124).
8. Cameron-Jones, R. (1995). Instance selection by encoding length heuristic with random mutation hill climbing. In Proceedings of the eighth Australian joint conference on artificial intelligence (pp. 99-106).
9. C. Chang 1991 Finding prototypes for nearest neighbor classifiers IEEE Transactions on Computers 23 11 1179 1184 10.1109/T-C.1974.223827
10. T. Cover P. Hart 1967 Nearest neighbor pattern classification Institute of Electrical and Electronics Engineers Transactions on Information Theory 13 21 27 0154.44505
11. Devroye, L., Györfi, L., & Lugosi, G. (1996). A probabilistic theory of pattern recognition. Berlin: Springer.
12. Duda, R., Hart, P., & Stork, D. (2001). Pattern classification. New York: Wiley.
13. S. Ferrandiz M. Boullé 2006 Supervised evaluation of Voronoi partitions Intelligent Data Analysis 10 3 269 284
14. Fix, E., & Hodges, J. (1951). Discriminatory analysis. Nonparametric discrimination: consistency properties (Technical Report 4). Project Number 21-49-004, USAF School of Aviation Medicine, Randolph Field, TX.
15. G. Gates 1972 The reduced nearest neighbor rule IEEE Transactions on Information Theory 18 3 431 433 10.1109/TIT.1972.1054809
16. Grünwald, P., Myung, I., & Pitt, M. (2005). Advances in minimum description length: theory and applications. Cambridge: MIT Press.
17. I. Guyon A. Elisseeff 2003 An introduction to variable and feature selection Journal of Machine Learning Research 3 1157 1182 1102.68556 10.1162/153244303322753616
18. P. Hansen N. Mladenovic 2001 Variable neighborhood search: principles and applications European Journal of Operational Research 130 449 467 0981.90063 10.1016/S0377-2217(00)00100-4 1816664 (Pubitemid 32875304)
19. P. Hart 1968 The condensed nearest neighbor rule IEEE Transactions on Information Theory 14 515 516 10.1109/TIT.1968.1054155
20. J. Jaromczyk G. Toussaint 1992 Relative neighborhood graphs and their relatives Proceedings of the IEEE 80 9 1502 1517 10.1109/5.163414 (Pubitemid 23568838)
21. Kohonen, T. (2001). Self-organizing maps (3rd ed.). Berlin: Springer.
22. V. Levenshtein 1966 Binary codes capable of correcting deletions, insertions, and reversals Soviet Physics Doklady 10 8 707 710 189928
23. Liu, H., & Motoda, H. (2001). Instance selection and construction for data mining. Dordrecht: Kluwer.
24. MacQueen, J. (1967). Some methods for classification and analysis of multivariate observations. In L. Cam, & Neyman (Eds.), Fifth Berkeley symposium on mathematical statistics and probability (pp. 281-297).
25. E. Parzen 1962 On estimation of a probability density function and mode Annals of Mathematical Statistics 33 3 1065 1076 0116.11302 10.1214/aoms/ 1177704472 143282
26. Robert, C. (2001). The Bayesian choice: from decision-theoretic motivations to computational implementation. New York: Springer.
27. S. Salzberg 1991 A nearest hyperrectangle learning method Machine Learning 6 277 309
28. J. S. Sanchez F. Pla F. J. Ferri 1997 Prototype selection for the nearest neighbour rule through proximity graphs Pattern Recognition Letters 18 6 507 513 10.1016/S0167-8655(97)00035-4
29. Scholkopf, B., & Smola, A. (2001). Learning with kernels: support vector machines, regularization, optimization, and beyond. Cambridge: MIT Press.
30. M. Sebban R. Nock S. Lallich 2002 Stopping criterion for boosting-based data reduction techniques: from binary to multiclass problem Journal of Machine Learning Research 3 863 885 10.1162/jmlr.2003.3.4-5.863 1983949
31. C. Stanfill D. Waltz 1986 Toward memory-based reasoning Communications of the ACM 29 1213 1228 10.1145/7902.7906 (Pubitemid 17509858)
32. Toussaint, G. T., Bhattacharya, B., & Poulsen, R. (1985). The application of Voronoi diagrams to nonparametric decision rules. In Computer science and statistics: the interface (pp. 97-108).
33. Toussaint, G. T., & Poulsen, R. (1975). Some new algorithms and software implementation methods for pattern recognition research. In Proceedings of the international computer software applications conference (pp. 55-63).
34. Vapnik, V. (1996). The nature of statistical learning theory. New York: Springer.
35. D. Wettschereck T. Dietterich 1995 An experimental comparison of the nearest neighbor and nearest hyperrectangle algorithms Machine Learning 19 1 5 27
36. D. Wilson 1972 Asymptotic properties of nearest neighbor rules using edited data IEEE Transactions on Systems, Man and Cybernetics 2 408 421 0276.62060 10.1109/TSMC.1972.4309137
37. D. Wilson T. Martinez 1997 Improved heterogeneous distance functions Journal of Artificial Intelligence Research 6 1 1 34 0894.68118 1448536
38. Wilson, D., & Martinez, T. (1997b). Instance pruning techniques. In D. Fisher (Ed.), Proceedings of the 14th international conference on machine learning (pp. 403-411). San Francisco: Morgan Kaufmann.
39. D. Wilson T. Martinez 2000 Reduction techniques for instance-based learning algorithms Machine Learning 38 3 257 286 0954.68126 10.1023/A:1007626913721 (Pubitemid 30572450)