What is the nearest neighbor in high dimensional spaces?

Proceedings of the 26th International Conference on Very Large Data Bases, VLDB'00

Volumn , Issue , 2000, Pages 506-515

  Hinneburg, Alexander ^a   Aggarwal, Charu C ^b   Keim, Daniel A ^a  

^a MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE APPLICATIONS; EFFECTIVE ALGORITHMS; HIGH DIMENSIONAL DATA; HIGH DIMENSIONAL SPACES; NEAREST NEIGHBOR SEARCH; NEAREST NEIGHBORS; PERFORMANCE ISSUES; SYNTHETIC DATASETS;

QUERY PROCESSING;

DATA MINING;

EID: 1542292055     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Aggarwal C.C.et al.: Fast Algorithms for Projected Clustering,Proc.of the ACM SIGMOD Con!., 1999.pp 407-418.
2. Aggarwal C.C.Yu P.S.: Finding Generalized Projected Clusters in High Dimensional Spaces, Proceedings of the ACM SIGMOD Conference, 2000, pp.70-81.
3. Altschul S.F., Gish W., Miller NV., Myers E.W., Lipman D.J.: A Basic Local Alignment Search Tool, Journal of Molecular Biology, VOl.215.No.3.1990, pp.403-41O
4. (4] Berchtold S., Keim D.A., Kriegel 11.-P.: The X Tree: An Index Structure for High-Dimensional Data, Proc.Jut.Conf.on Very Large Databases (VLDB'96), Bombay, India, 1996, pp.28-39.
5. Beyer K., Goldstein.1., Ramakrishnan R., Shaft U.: Viien is Nearest Neighbors Meaningful?, Proc.of the tnt.Conf.Database Theorie, 1999, pp.217- 235.
6. Bozichi F., Giannotti F., Mainetto G., Pedreschi D.: Using Data Mining Techniques in Fiscal Fraud Detection, First Jut.Conf.on Data Warehousing and Knowledge Discovery, 1999, PP.369-376.
7. X.Daura, B.Jaun, D.Seehach, W.F.van Gunsteren, A.E.Mark.: Reversible l)(Ptide folding in solution by molecular dynamics simulation, Journal of Molecular Biology, 280, 1998, Pp.925-932.
8. Faloutsos C., Barber R., Flickner M., Hafner J., et al.: Efficient and Effective Querying by Image Content, Journal of Intelligent Information Systems, 1994.Vol.3, pp.231-262.
9. Gaede V., Gunther O. Multidimensional Access Methods, ACM 'ornputing Surveys, Vol.30, No.2, 1998, Pl 170-231.
10. Guttinan, A.: R-Trees: A Dynamic Index Structure for Spatial Searching, Proc.of the ACM SIGMOD Conf., 1984, pp.47-57.
11. He H., Graco W., Yao X.: Application of Genetic Algorithm and k-Nearest Neighbour Method in Medical Fraud Detection, Asia-Pacific Gonf.on Simulated Evolution and Learning, SEAL'98, 1998, pp.74-81.
12. Korn F., Sidiropoulos N., Faloutsos C., Siegel E., Protopapas Z.: Fast Nearest Neighbor Search in Medical Image Databases, Proc.22nd tnt.Conf on Very Large Data Bases, Miimbai, India, 1996, pp.215-226.
13. Kukich K.: Techniques for Automatically Correcting Words in Text, ACM Computing Surveys, Vol.24, No.4, 1992, pp.377-44O
14. Mehrotra R., Gary J.: Feature-Index-Based Siniilar Shape Retrieval, Proc.of the 3rd Working Conf.on Visual Database Systems, March 1995, PP.46-65.
15. Openshaw S.: Census User Handbook.Pearson Professsional Ltd., Cambridge, 1995.
16. Saltoni G.: Automatic Text Processing: The Transformation, Analysis, and Retrieval of Inforination by C'omputer, Addison - Wesley.
17. Seidl I., Kriegel 11.-P.; Efficient User-Adaptable Similarity Search in Large Multimedia Databases, Proc.of the 23rd mt.Conf.on Very Large Databases, Athens, Greece, 1997, pp.506-515.
18. Ankerst M., Kriegel H-P., Seidi T.: A Multi-Step Approach for Shape Similarity Search in Image Databases, IEEE Trans.on Knowledge and Data Engineerinq (TKDE'98), Vol.10, No.6, 1998, pp.996-1004.
19. Shaft U., Goldstein J., Beyer K.: Nearest Neighbor Query Performance for Unstable Distributions,Technical Report TR 1888, Department of Computer Science, University of Wisconsin at Madison.
20. Shawney H., Hafner J.: Efficient Color Histogram Indexing, Proc.Jut.Conf.on Image Processing, 1994, pp.66-7O
21. Silverman B.W.:Density Estimation, Chapman Hall 1986.
22. Weber R., Schek H.-J., Blott S.: A Quantitative Analysis and Performance Study for Similarity- Search Methods in High-Dimensional Spaces, Proc.of !i4rd mt.Conf.on Very Large Data Bases (VLDB'98), New York, 1998, pp.194-205