Exact k-NN queries on clustered SVD datasets
References (18)
- et al.
Image Databases: Search and Retrieval of Digital Imagery
(2002) Multidimensional indexing structures for content-based retrieval
- et al.
CSVD: Clustering and singular value decomposition for approximate similarity search in high dimensional spaces
IEEE Trans. Knowl. Data Eng.
(2003) - K. Chakrabarti, S. Mehrotra, Local dimensionality reduction: A new approach to indexing high dimensional space, in:...
Searching Multimedia Databases by Content
(1996)- et al.
Multidimensional access methods
ACM Comput. Surv.
(1998) Principal Component Analysis
(2002)- K.V.R. Kanth, D. Agrawal, A.K. Singh, Dimensionality reduction for similarity searching in dynamic databases, in: Proc....
- et al.
A fast k-nearest-neighbor finding algorithm based on the ordered partition
IEEE Trans. Pattern Anal. Mach. Intell.
(1986)
There are more references available in the full text version of this article.
Cited by (7)
Singular value decomposition, clustering, and indexing for similarity search for large data sets in high-dimensional spaces
2015, Big Data: Algorithms, Analytics, and ApplicationsCluster-based similarity search in time series
2009, 2009 4th Balkan Conference in Informatics, BCI 2009Optimal subspace dimensionality for k-nearest-neighbor queries on clustered and dimensionality reduced datasets with SVD
2008, Multimedia Tools and ApplicationsPersistent clustered main memory index for accelerating k-NN queries on high dimensional datasets
2008, Multimedia Tools and ApplicationsThe stepwise dimensionality increasing (SDI) index for high-dimensional data
2006, Computer Journal
- 1
We acknowledge the support of NSF through Grant 0105485 in Computer System Architecture.
Copyright © 2005 Elsevier B.V. All rights reserved.