Composite distance transformation for indexing and k-nearest-neighbor searching in high-dimensional spaces

Journal of Computer Science and Technology

Volumn 22, Issue 2, 2007, Pages 208-217

  Zhuang, Yi ^a   Zhuang, Yue Ting ^a   Wu, Fei ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

Centroid distance; K nearest neighbor search; Start distance

Indexed keywords

CENTROID DISTANCE; COMPOSITE DISTANCE TRANSFORMATION METHOD; K-NEAREST NEIGHBOR SEARCH; START DISTANCE;

CLUSTERING ALGORITHMS; DATA REDUCTION; INDEXING (OF INFORMATION); PROBLEM SOLVING;

SEARCH ENGINES;

EID: 34247210264     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11390-007-9027-5     Document Type: Article

References (10)

1. Christian Böhm, Stefan Berchtold, Daniel Keim. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Computing Surveys, 2001, 33(3): 322-373.
2. Guttman A. R-tree: A dynamic index structure for spatial searching. In Proc. the ACM SIGMOD Int. Conf. Management Data, Boston, USA, 1984, pp.47-54.
3. Beckmann N, Kriegel H-P, Schneider R, Seeger B. The R*-tree: An efficient and robust access method for points and rectangles. In Proc. ACM SIGMOD Int. Conf. Management Data, Atlantic, USA, 1990, pp.322-331.
4. Berchtold S, Keim D A, Kriegel H P. The X-tree: An index structure for high-dimensional data. In Proc. 22nd Int. Conf. Very Large Data Bases, India, 1996, pp.28-37.
5. Katamaya N, Satoh S. The SR-tree: An index structure for high-dimensional nearest neighbor queries. In Proc. ACM SIGMOD Int. Conf. Management of Data, Arizona, USA, 1997, pp.32-42.
6. Weber R, Schek H, Blott S. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proc. 24th Int. Conf. Very Large Data Bases, New York, USA, 1998, pp.194-205.
7. Berchtold S, Bohm C, Kriegel HP et al. Independent quantization: An index compression technique for high-dimensional data spaces. In Proc. 16th Int. Conf. Data Engineering, San Diego, USA, 2000, pp.577-588.
8. Fonseca M J, Jorge J A. Indexing high-dimensional data for content-based retrieval in large databases. In Proc. the 8th Int. Conf. Database Systems for Advanced Applications, Kyoto, Japan, 2003, pp.267-274.
9. +-tree based indexing method for nearest neighbor search. ACM Trans. Data Base Systems, 2005, 30(2): 364-397.
10. The UCI KDD Archive, http://www.kdd.ics.uci.edu, 2002.