Fast k most similar neighbor classifier for mixed data (tree k-MSN)

Pattern Recognition

Volumn 43, Issue 3, 2010, Pages 873-886

  Hernández Rodríguez, Selene ^a   Martínez Trinidad, J Fco ^a   Carrasco Ochoa, J Ariel ^a  

^a INSTITUTO NACIONAL DE ASTROFÍSICA   (Mexico)

Author keywords

Fast k nearest neighbor search; Mixed data; Nearest neighbor rule; Non metric comparison functions

Indexed keywords

CATEGORICAL ATTRIBUTES; K NEAREST NEIGHBOR SEARCH; K-NEAREST NEIGHBORS; K-NN CLASSIFIER; METRIC PROPERTIES; MIXED DATA; NEAREST NEIGHBOR RULE; NEAREST NEIGHBORS; NON-PARAMETRIC TECHNIQUES; PREPROCESSING PHASE; SIMILARITY FUNCTIONS; SOFT SCIENCE; SPEED-UPS; SYNTHETIC AND REAL DATA; TRAINING SETS; TREE STRUCTURES; TRIANGLE INEQUALITY;

CLASSIFIERS; FUNCTIONS; IMAGE RETRIEVAL; LEARNING SYSTEMS; MOTION COMPENSATION; PATTERN RECOGNITION; TEXT PROCESSING;

CLASSIFICATION (OF INFORMATION);

EID: 70450251947     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2009.08.014     Document Type: Article

References (45)

1. Cover T.M., and Hart P.E. Nearest neighbor pattern classification. Transactions on Information Theory 13 (1967) 21-27
2. Nene S.A., and Nayar S.K. A simple algorithm for nearest neighbour search in high dimensions. IEEE Transactions in Pattern Analysis and Machine Intelligence 19 9 (1997) 989-1003
3. Ramasubramanian V., and Paliwal K. Fast nearest-neighbor search based on approximation-elimination search. Pattern Recognition 33 (2000) 1497-1510
4. Yong-Sheng C., Yi-Ping H., and Chiou-Shann F. Fast and versatile algorithm for nearest neighbor search based on lower bound tree. Pattern Recognition Letters 40 2 (2007) 360-375
5. Micó L., Oncina J., and Vidal E. A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing-time and memory requirements. Pattern Recognition Letters 15 (1994) 9-17
6. M. Denny, M.J. Franklin, Operators for expensive functions in continuous queries, in: Proceedings of the 22nd International Conference on Data Engineering, ICDE'06, vol. 03 (issue 07) 2006, p. 147.
7. M. Adler, B. Heeringa, Search Space Reductions for Nearest-Neighbor Queries, in: Lecture Notes in Computer Science, 2008, pp. 554-567.
8. R. Panigrahi, An Improved Algorithm Finding Nearest Neighbor Using Kd-trees, in: Lecture Notes in Computer Science, vol. 4957, 2008, pp. 387-398.
9. E. Pekalska, R. Duin, The Dissimilarity Representation for Pattern Recognition, in: Foundations and Applications, World Scientific, Singapore, December 2005.
10. Chang H., Yeung D., and Cheung W. Relaxational metric adaptation and its application to semi-supervised clustering and content-based image retrieval. Pattern Recognition 39 (2006) 1905-1917
11. Kushnir D., Galun M., and Brandt A. Fast multiscale clustering and manifold identification. Pattern Recognition 39 (2006) 1876-1891
12. Laub J., Roth V., Buhmann J., and Muller K. On the information and representation of non-Euclidean pairwise data. Pattern Recognition 39 (2006) 1815-1826
13. Lozano M., Martínez Sotoca J., Sánchez J., Pla F., Pekalska E., and Duin R. Experimental study on prototype optimisation algorithms for prototype-based classification in vector spaces. Pattern Recognition 39 (2006) 1827-1838
14. C. Chien-Hsing, K. Bo-Han, C. Fu, The generalized condensed nearest neighbor rule as a data reduction method, in: Proceedings of the 18th International Conference on Pattern Recognition, vol. 02, 2006, pp. 556-559.
15. Friedman J.H., Baskett F., and Shustek L. An algorithm for finding nearest neighbors. IEEE Transactions on Computers (1975) 1000-1006
16. A. Guttman, R-trees: a dynamic index structure for spatial searching, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, Boston, MA, pp. 47-57.
17. D.A. White, R. Jain, Similarity indexing with the SS-tree, in: Proceedings of the International Conference on Data Engineering, New Orleans, LA, 1996, pp. 516-523.
18. N. Katayama, S. Satoh, The SR-tree: an index structure for high dimensional nearest neighbor queries, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, Tucson, AZ, USA, 1997, pp. 369-380.
19. S. Berchtold, C. Böhm, H. Kriegel, The pyramid-technique: towards breaking the curse of dimensionality, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, Seattle, WA, 1988, pp. 142-153.
20. Berchtold S., Keim D.A., Kriegel H., and Seidl T. Indexing the solution space: a new technique for nearest neighbor search in high dimensional space. IEEE Transactions on Knowledge Data Engineering 12 1 (2000) 45-57
21. Fukunaga K., and Narendra P. A branch and bound algorithm for computing k-nearest neighbors. IEEE Transactions on Computers 24 (1975) 743-750
22. S. Brin, Near neighbor search in large metric spaces, in: Proceedings of the International Conference on very Large Data Bases, Zurich, Switzerland, 1995, pp. 574-584.
23. McNames J. A fast nearest neighbor algorithm based on a principal axis search tree. IEEE Transactions on Pattern Analysis and Machine Intelligence 23 9 (2001) 964-976
24. Soleymani M.R., and Morgera S.D. An efficient nearest neighbor search method. IEEE Transactions on Communications COM 35 6 (1987) 677-679
25. Djouadi A., and Bouktache E. A fast algorithm for the nearest-neighbor classifier. IEEE Transactions in Pattern Analysis and Machine Intelligence 19 3 (1997) 277-282
26. Arya S., Mount D., Netanyahu N., Silverman R., and Wu A. An optimal algorithm for approximate nearest neighbor searching in high dimensions. Journal of the ACM 45 6 (1998) 891-923
27. F. Moreno-Seco, L. Mico, J. Oncina, Approximate nearest neighbor search with the Fukunaga and Narendra algorithm and its application to chromosome classification, CIARP, in: Lecture Notes in Computer Science, vol. 2905, 2003, pp. 322-328.
28. K. Figueroa, E. Chávez, G. Navarro, R. Paredes, On the last cost for proximity searching in metric spaces, in: WEA 2006, Lecture Notes in Computer Science, vol. 4007, 2006, pp. 279-290.
29. Faragó A., Linder T., and Lugosi G. Fast nearest-neighbor search in dissimilarity spaces. IEEE Transactions in Pattern Analysis and Machine Intelligence 15 9 (1993) 957-962
30. Hsieh C., and Liu Y. Fast search algorithms for vector quantization of images using multiple triangle inequalities and wavelet transform. IEEE Transactions on Image Processing 9 3 (2000) 321-328
31. Kalantari I., and McDonald G. A data structure and an algorithm for the nearest point problem. IEEE Transactions on Software Engineering 9 (1983) 631-634
32. Omachi S., and Aso H. A fast algorithm for a k-nn classifier based on branch and bound method and computational quantity estimation. Systems and Computers in Japan 31 6 (2000) 1-9
33. Gómez-Ballester E., Mico L., and Oncina J. Some approaches to improve tree-based nearest neighbor search algorithms. Pattern Recognition Letters 39 (2006) 171-179
34. J. Oncina, F. Thollard, E. Gómez-Ballester, L., Micó, F. Moreno-Seco, A tabular pruning rule in tree-based fast nearest neighbor search algorithms, IbPRIA, in: Lecture Notes in Computer Science, vol. 4478, 2007, pp. 306-313.
35. J.R. García-Serrano, J.F. Martínez-Trinidad, Extension to C-means algorithm for the use of similarity functions, in: Lectures Notes in Artificial Intelligence, vol. 1704, 1999, pp. 354-359.
36. Martínez-Trinidad J.F., García-Serrano J.R., and Ayaquica-Martínez I.O. C-means algorithm with similarity functions. Computación y Sistemas 5 4 (2002) 241-246
37. Mico L., Oncina J., and Carrasco R. A fast branch and bound nearest neighbor classifier in metric spaces. Pattern Recognition Letters 17 (1996) 731-739
38. D'haes W., Dyck D., and Rodel X. PCA-based branch and bound search algorithms for computing K nearest neighbors. Pattern Recognition Letters 24 (2002) 1437-1451
39. Wilson D., and Martínez T. Reduction techniques for instance based learning algorithms. Machine Learning 38 (2000) 257-286
40. Wilson D., and Martínez T. Improve heterogeneous distance functions. Journal of Artificial Intelligence Research 6 (1997) 1-34
41. C. Blake, C. Merz, UCI repository of machine learning databases, 1998. 〈http://www.uci.edu/mlearn/databases/〉, Department of Information and Computer Science, University of California, Irvine, CA.
42. Dietterich T. Statistical tests for comparing supervised classification learning algorithms. Neural Computation 10 7 (1998) 1895-1923
43. Vidal E. An algorithm for finding nearest neighbours in (approximately) constant average time complexity. Pattern Recognition Letters 4 (1986) 145-157
44. K. Tokoro, K. Yamaguchi, S. Masuda, Improvements of TLAESA nearest neighbor search and extension to approximation search, in: ACSC'06: Proceedings of the 29th Australian Computer Science Conference, 2006, pp. 77-83.
45. Zhang B., and Srihari S. Fast k nearest neighbour classification using cluster-based tree. IEEE Transactions on Pattern Analysis and Machine Intelligence 26 4 (2004) 525-528