Fast k-NN classification rule using metric on space-filling curves

A fast nearest neighbor algorithm for pattern classification is proposed and tested on real data. The patterns (points in d-dimensional Euclidean space) are sorted along a space-filling curve. This way the multi-dimensional problem is compressed to the simplest case of the nearest neighbor search in one dimension. Instead of Euclidean distance a metric on space-filling curve is used. The method may be inferior or superior to the k-NN rule in multidimensional Euclidean space.

[1]  Alan J. Broder.  Strategies for efficient incremental nearest neighbor search , 1990, Pattern Recognit..

[2]  John J. Bartholdi,et al.  Spacefilling curves and the planar travelling salesman problem , 1989, JACM.

[3]  EWA SKUBALSKA-RAFAJ.  THE CLOSED CURVE FILLING MULTIDIMENSIONAL CUBE , 1994 .

[4]  Laveen N. Kanal,et al.  Classification of binary random patterns , 1965, IEEE Trans. Inf. Theory.

[5]  Ewa Skubalska-Rafaj,et al.  Data Sorting along a Space-filling Curve for Fast Pattern Recognition , 1995 .

[6]  F. K. Bechtel,et al.  Mapping Multidimensional Space to One Dimension for Computer Output Display , 1968, IEEE Transactions on Computers.

[7]  Luc Devroye,et al.  Lecture Notes on Bucket Algorithms , 1986, Progress in Computer Science.

[8]  R. J. Stevens,et al.  Manipulation and Presentation of Multidimensional Image Data Using the Peano Scan , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Jerome H. Friedman,et al.  Flexible Metric Nearest Neighbor Classification , 1994 .

[10]  Douglas R. Anderson,et al.  Mapping Multidimensional Space to One Dimension for Computer Output Display , 1968, IEEE Transactions on Computers.

[11]  András Faragó,et al.  Fast Nearest-Neighbor Search in Dissimilarity Spaces , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  Keinosuke Fukunaga,et al.  Introduction to statistical pattern recognition (2nd ed.) , 1990 .

[13]  S. Milne.  Peano curves and smoothness of functions , 1980 .

[14]  Eric R. Ziegel,et al.  Data: A Collection of Problems From Many Fields for the Student and Research Worker , 1987 .

[15]  William J. Gilbert,et al.  A cube-filling Hilbert Curve , 1984 .

[16]  E. H. Moore.  On certain crinkly curves , 1900 .

[17]  Arthur R. Butz,et al.  Alternative Algorithm for Hilbert's Space-Filling Curve , 1971, IEEE Transactions on Computers.

[18]  Ezzatollah Salari,et al.  Peano scanning partial distance search for vector quantization , 1995, IEEE Signal Processing Letters.

[19]  Peter E. Hart,et al.  Nearest neighbor pattern classification , 1967, IEEE Trans. Inf. Theory.