Dimensionality reduction for similarity search with the Euclidean distance in high-dimensional applications

Multimedia Tools and Applications

Volumn 42, Issue 2, 2009, Pages 251-271

  Jeong, Seungdo ^a   Kim, Sang Wook ^a   Choi, Byung Uk ^a  

^a Hanyang University   (South Korea)

Author keywords

Dimensionality reduction; High dimensional indexing; Multimedia information retrieval; Similarity search

Indexed keywords

FACE RECOGNITION; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL; INFORMATION SERVICES;

BASIC SOLUTIONS; DIMENSIONALITY REDUCTION; DIMENSIONALITY REDUCTION METHODS; DISTANCE FUNCTIONS; EUCLIDEAN DISTANCES; FALSE DISMISSALS; FEATURE VECTORS; HIGH-DIMENSIONAL; HIGH-DIMENSIONAL INDEXING; HIGH-DIMENSIONAL SPACES; INDEXING METHODS; LOW-DIMENSIONAL SPACES; MULTIMEDIA DATUM; MULTIMEDIA INFORMATION RETRIEVAL; NOVEL METHODS; REAL-LIFE DATA SETS; REFERENCE VECTORS; SIMILARITY SEARCH; SUB-VECTORS;

VECTORS;

EID: 62249215035     PISSN: 13807501     EISSN: 15737721     Source Type: Journal    
DOI: 10.1007/s11042-008-0243-y     Document Type: Article

References (34)

1. Aggarwal CC (2001) On the effects of dimensionality reduction on high dimensional similarity search. In: Proc. int'l. symp. on principles of database systems, ACM SIGACT-SIGMOD-SIGART, Santa Barbara, 21-23 May 2001, pp 256-266
2. Agrawal R, Faloutsos C, Swami A (1993) Efficient similarity search in sequence databases. In: Proc. int'l. conf. on foundations of data organization and algorithms, FODO, Chicago, 13-15 October 1993, pp 69-84
3. Beckmann N, Kriegel HP, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Proc. intl. conf. on management of data, ACM SIGMOD, Atlantic City, 23-25 May 1990, pp 322-331
4. Berchtold S, Böhm C, Braunmüller B, Keim D, Kriegel H-P (1997) Fast parallel similarity search in multimedia databases. In: Proc. int'l. conf. on management of data, ACM SIGMOD, Tucson, 13-15 May 1997, pp 1-12
5. Beyer KS, Goldstein J, Ramakrishnan R, Shaft U (1999) When is nearest neighbor meaningful? In: Proc. int'l. conf. on database theory, ICDT, Jerusalem, 10-12 January 1999, pp 217-235
6. C Böhm S Berchtold D Keim 2001 Searching in high-dimensional spaces-index structures for improving the performance of multimedia databases ACM Comput Surv 33 3 322 373
7. Ciaccia P, Patella M, Zezula P (1997) M-tree: an efficient access method for similarity search in metric spaces. In: Proc int'l. conf. on very large data bases, VLDB, Athens, 25-29 August 1997, pp 426-435
8. Egecioglu Ö (2001) Parametric approximation algorithms for high-dimensional euclidean similarity. In: Proc. european conf. on principles of data mining and knowledge discovery, PKDD, Freiburg, 3-5 September 2001, pp 79-90
9. Ö Egecioglu H Ferhatosmanoglu U Ogras 2004 Dimensionality reduction and similarity computation by inner product approximations IEEE Trans Knowl Data Eng 16 6 714 726
10. Eidenberger H (2004) A new method for visual descriptor evaluation. In: Proc. SPIE storage and retrieval methods and applications for multimedia, San Jose, January 2004, pp 145-157
11. C Faloutsos R Barber M Flickner W Niblack D Petkovic W Equitz 1994 Efficient and effective querying by image content J Intell Inf Syst 3 3/4 231 262
12. Jeong S, Kim S-W, Kim K, Choi, B-U (2006) An effective method for approximating the euclidean distance in high-dimensional space. In: Proc. int'l. conf. on databases and expert systems applications, Krakow, 4-8 September 2006, pp 863-872
13. Kanth KVR, Agrawal D, Singh A (1998) Dimensionality reduction for similarity searching in dynamic databases. In: Proc. int'l. conf. on management of data, ACM SIGMOD, Seattle, 2-4 June 1998, pp 166-176
14. Katayama N, Satoh S (1997) The SR-Tree: an index structure for high-dimensional nearest neighbor queries. In: Proc. int'l. conf. on management of data, ACM SIGMOD, Tucson, 13-15 May 1997, pp 369-380
15. Krishnamachari S, Abdel-Mottaleb M (1999) Hierarchical clustering algorithm for fast image retrieval. In: Proc. SPIE int'l. conf. on storage and retrieval for image and video databases, San Jose, 26-29 January 1999, pp 427-435
16. Lee S-M, Abbott AL, Araman PA (2007) Dimensionality reduction and clustering on statistical manifolds. In: Proc. IEEE conf. on computer vision and pattern recognition, Minneapolis, 18-23 June 2007, pp 1-7
17. K Lin H Jagadish C Faloutsos 1994 The TV-Tree: an index structure for high dimensional data VLDB J 3 4 517 542
18. Lin T, Zha H, Lee SU (2006) Riemannian manifold learning for nonlinear dimensionality reduction. In: Proc. European conf. on computer vision, Graz, 7-13 May 2006, pp 44-55
19. Mertins A (2000) Signal analysis. Wiley, New York
20. Moon TK, Stirling WC (2000) Mathematical methods and algorithms for signal processing. Prentice-Hall, New York
21. Niblack W, Barber R, Equitz W, Flickner M, Glasman E, Petkovic D, Yanker P (1993) The QBIC project: querying images by content using color, texture, and shape. In: Proc. SPIE int'l. conf. storage and retrieval for image and video databases, San Jose, 31 January-5 February 1993, pp 173-187
22. Ogras U, Ferhatosmanoglu H (2003) Dimensionality reduction using magnitude and shape approximations. In: Proc. int'l. conf. on information and knowledge management, ACM CIKM, New Orleans, 3-8 November 2003, pp 99-107
23. Pagel B-U, Six H-W, Winter M (1995) Window query-optimal clustering of spatial objects. In: Proc. int'l. conf. on principals of database systems, pp 86-94
24. Press WH, Teukolsky SA, Vetterling WT, Flannery BP (2002) Numerical recipes in C++. Cambridge University Press, Cambridge
25. ST Roweis LK Saul 2000 Nonlinear dimensionality reduction by locally linear embedding Science 290 2323 2326
26. Seidl T, Kriegel H-P (1997) Efficient user-adaptable similarity search in large multimedia databases. In: Proc. int'l. conf. on very large data bases, VLDB, pp 506-515
27. Seidl T, Kriegel H-P (1998) Optimal multi-step k-nearest neighbor search. In: Proc. int'l. conf. on management of data. ACM SIGMOD, pp 154-165
28. JB Tenenbaum V De Silva JC Langford 2000 A global geometric framework for nonlinear dimensionality reduction Science 290 2319 2323
29. A Thomasian L Zhang 2008 Persistent clustered main memory index for accelerating k-NN queries on high dimensional datasets Multimed Tools Appl 38 2 253 270
30. A Thomasian Y Li L Zhang 2008 Optimal subspace dimensionality for k-Nearest-neighbor queries on clusterd and dimensionality reduced datasets with SVD Multimed Tools Appl 40 2 241 259
31. Weber R, Schek HJ, Blott S (1998) A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proc. int'l. conf. on very large data bases, VLDB, pp 194-205
32. White DA, Jain R (1996) Similarity indexing with the SS-tree. In: Proc. IEEE int'l. conf. on data engineering, pp 516-523
33. Xiao L, Sun J, Boyd SP (2006) A duality view of spectral methods for dimensionality reduction. In: ICML2006, pp 1041-1048
34. University of California (1999) Corel image features. http://kdd.ics.uci.edu/databases/CorelFeatures/CorelFeatures.html