Clustering for approximate similarity search high-dimensional spaces

IEEE Transactions on Knowledge and Data Engineering

Volumn 14, Issue 4, 2002, Pages 792-808

  Li, Chen ^a,b   Chang, Edward ^a,c   Garcia Molina, Hector ^b   Wiederhold, Gio ^a,b  

^a IEEE   (United States)

^b Stanford University   (United States)

^c University of California   (United States)

Author keywords

Approximate search; Clustering; High dimensional index; Similarity search

Indexed keywords

APPROXIMATE SEARCH;

APPROXIMATION THEORY; DATA STRUCTURES; INDEXING (OF INFORMATION); QUERY LANGUAGES;

SEARCH ENGINES;

EID: 0036649291     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2002.1019214     Document Type: Article

References (48)

1. Automatic subspace clustering of high dimensional data for data mining applications
2. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions
3. The R*-tree: An efficient and robust access method for points and rectangles
4. Density-based indexing for approximate nearest-neighbor queries
5. The pyramid-technique: Towards breaking the curse of dimensionality
6. The X-tree: An index structure for high-dimensional data
7. Scaling EM (expectation-maximization) clustering to large databases
8. Copy detection mechanisms for digital documents
9. PBIR: A system that subjective image query concepts
10. PBIR-perception-based image retrieval
11. Searching near-replicas of images via clustering
12. RIME-a replicated image detector for the WWW
13. GBI: A geberalized r-tree bulk-insertion
14. Pac nearest neighbor queries: Approximate and controlled search in high-dimensional and metric spaces
15. M-tree: An efficient access method for similarity search in metric spaces
16. An algorithm for approximate closest-point queries
17. A density-based algorithm for discovering clusters in large spatial databases with noise
18. Query by image and video content: The QBIC system
19. Safeguarding and charging for information on the internet
20. Visual information retrieval
21. R-trees: A dynamic index structure for spatial searching
22. Ranking in spatial databases
23. Similarity search in high dimensions via hashing
24. Approximate nearest neighbors: Towards removing the curse of dimensionality
25. The SR-tree: An index structure for high-dimensional nearest neighbor queries
26. Two algorithms for nearest-neighbor search in high dimensions
27. Efficient search for approximate nearest neighbor in high dimensional spaces
28. The TV-tree: An index structure for high-dimensional data
29. The magical number seven +- Two, some limits on our capacity for processing information
30. Efficient and effective clustering methods for spatial data mining
31. The K-D-B-tree: A search structure for large multidimensional dynamic indexes
32. Nearest neighbor queries
33. Adaptive color-image embedding for database navigation
34. Wavecluster: A multi-resolution clustering approach for very large spatial databases
35. Visualseek: A fully automated content-based image query system
36. Wavelet-based image indexing techniques with partial sketch retrieval capability
37. Content-based image indexing and searching using daubechies' wavelets
38. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces
39. Similarity indexing: Algorithms and performance
40. Similarity indexing with the SS-tree
41. Approximate similarity retrieval with M-trees
42. Birch: An efficient data clustering method for very large databases