On the effects of dimensionality reduction on high dimensional similarity search

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2001, Pages 256-266

  Aggarwal, C C ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; CONTENT BASED RETRIEVAL; DATA DESCRIPTION; DATA REDUCTION; DATA STRUCTURES; ONLINE SEARCHING; SEMANTICS; TEXT PROCESSING;

DIMENSIONALITY REDUCTION;

DATABASE SYSTEMS;

EID: 0034830966     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/375551.383213     Document Type: Conference Paper

References (21)

1. On the surprising behavior of distance metrics in high dimensional space
2. Finding generalized projected clusters in high dimensional spaces
3. The IGrid index: Reversing the dimensionality curse for similarity indexing in high dimensional space
4. The X-tree: An index structure for high dimensional data
5. When is nearest neighbors meaningful?
6. Local dimensionality reduction: A new approach to indexing high dimensional spaces
7. Indexing by latent semantic analysis
8. A similarity based probability model for latent semantic indexing
9. FastMap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets
10. R-trees: A dynamic index structure for spatial searching
11. What is the nearest neighbor in high dimensional spaces?
12. Applications of linear algebra in information retrieval and hypertext analysis
13. The TV-tree: An index structure for high dimensional data
14. Deflating the dimensionality curse using multiple fractal dimensions
15. Latent semantic indexing: A probabilistic analysis
16. Dimensionality reduction for similarity search in dynamic databases
17. Nearest neighbor queries
18. The R+tree: A dynamic index for multidimensional objects
19. A quantitative analysis and performance study for similarity search methods in high dimensional spaces