Approximate nearest neighbor search using a single space-filling curve and multiple representations of the data points

Proceedings - International Conference on Pattern Recognition

Volumn 2, Issue , 2006, Pages 502-505

  Mainar Ruiz, Gloria ^a   Perez Cortes, Juan Carlos ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; MAPPING; MATHEMATICAL MODELS; SET THEORY;

DATA POINTS; SINGLE SPACE-FILLING CURVE (SPFC); SYNTHETIC PROTOTYPES;

PATTERN RECOGNITION;

EID: 34047240063     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPR.2006.275     Document Type: Conference Paper

References (15)

1. C. Y. Chen, HL. Neighbor-finding based on space-filling curves. Information systems, 30(3):205-226, 2005.
2. P. A. Devijver and J. Kittler. On the edited nearest neighbour rule. In Proceedings of the 5th International Conference on Pattern Recognition, pages 72-80. IEEE Computer Society Press, Los Alamitos, CA, 1980.
3. M. Garris. Design and collection of a handwriting sample image database. Social Science Computing Journal, 10:196-214, 1992.
4. S. Geva and J. Sitte. Adaptive nearest neighbor pattern classification. IEEE T. Neural Networks, 2(2):318-322, 1991.
5. P. Hart. The condensed nearest neighbor rule. IEEE Trans. on Information Theory, 125:515-516, 1968.
6. D. Hilbert. Ueber die steitge abbildung einer linie auf ein flaechenstueck. Math. Ann., 38:459-460, 1891.
7. T. Kohonen. Self Organization and Associative Memory. Springer-Verlag., 1988.
8. S. Liao, M. Lopez, and S. Leutenegger. High dimensional similarity search with space filling curves. In 17TH International Conference on Data Engineering, pages 615-622. APR, 2001.
9. N. Megiddo and U. Shaft. Efficient nearest neighbor indexing based on a collection of space filling curves. Technical report, IBM Almaden Research Center, 1997.
10. G. Peano. Sur une courbe qui remplit toute une aire plane. Math. Ann., 36:157-160, 1890.
11. J. Perez and E. Vidal. An approximate nearest neighbours search algorithm based on the extended general spacefilling curves heuristic. In Workshop on Statistical Pattern Recognition SPR-98, Sydney, Australia., 1998.
12. J. Perez and E. Vidal. Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges, volume 59 of DIMACS series in discrete mathematics and theoretical computer science, chapter Approximate nearest neighbor search using the extended general space-filling curves heuristic, pages 125-177. Providence, RI : American Mathematical Society, 2002.
13. J. Shepherd, X. Zhu, and N. Megiddo. A fast indexing method for multidimensional nearest neighbor search. In Proc. of the IS&T/SPIE Conf. on Storage and Retrieval of image and video databases VII, pages 350-355, 1999.
14. E. Skubalska and A. Krzyzak. Fast k-nn classification rule using metric on space-filling curves. In Proceedings of ICPR-96, pages 121-125, 1996.
15. D. Wilson. Asymptotic properties of nearest neighbor rules using edited data. IEEE Trans. on Systems, Man and Cybernetics, 2:408-420, 1972.