Distance approximation techniques to reduce the dimensionality for multimedia databases

Knowledge and Information Systems

Volumn 28, Issue 1, 2011, Pages 227-248

  Kim, Yongkwon ^a   Chung, Chin Wan ^a   Lee, Seok Lyong ^b   Kim, Deok Hwan ^c  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b Hankuk University of Foreign Studies   (South Korea)

^c Inha University   (South Korea)

Author keywords

Dimension partition; Dimensionality reduction; Inner product; Multimedia databases; Selectivity

Indexed keywords

CATALYST SELECTIVITY; DATABASE SYSTEMS;

APPROXIMATION TECHNIQUES; CAUCHY-SCHWARZ INEQUALITY; COMPUTATIONAL COSTS; CURSE OF DIMENSIONALITY; DIMENSION PARTITIONING; DIMENSIONALITY REDUCTION TECHNIQUES; INNER PRODUCT; MULTIMEDIA DATABASE;

DIMENSIONALITY REDUCTION;

EID: 79959506800     PISSN: 02191377     EISSN: 02193116     Source Type: Journal    
DOI: 10.1007/s10115-010-0322-z     Document Type: Article

References (32)

1. Agrawal R, Faloutsos C, Swami AN (1993) Efficient similarity search in sequence databases. In: Proceedings of the International Conference of Foundations of Data Organization and Algorithms, pp 69-84.
2. Beckmann N, Kriegel HP, Schneider R, Seeger B (1990) The r*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp 322-331.
3. Berchtold S, Keim DA, Kriegel HP (1996) The x-tree: An index structure for high-dimensional data. In: Proceedings of International Conference on Very Large Data Bases, pp 28-39.
4. Cha GH, Chung CW (2002) The gc-tree: a high-dimensional index structure for similarity search in image databases. IEEE Trans Multimed 4(2): 235-247.
5. Cha GH, Zhu X, Petkovic P, Chung CW (2002) An efficient indexing method for nearest neighbor searches in high-dimensional image databases. IEEE Trans Multimed 4(1): 76-87.
6. Donoho DL (2000) High-dimensional data analysis: the curses and blessings of dimensionality. In: AMS Conference Mathematical Challenges of the 21st Century.
7. Egecioglu O, Ferhatosmanoglu H (2004) Dimensionality reduction and similarity computation by inner product approximations. IEEE Trans Knowl Data Eng 16(6): 714-726.
8. Faloutsos C (1996) Searching multimedia databases by content. Kluwer Academic Publishers, Dordrecht.
9. Fei-Fei L, Fergus R, Perona P (2004) Learning generative visual models from few training examples: an incremental bayesian approach tested on 101 object categories. In CVPR 2004, Workshop on Generative-Model Based Vision.
10. Filho RFS, Traina AJM, Jr., CT, Faloutsos C (2001) Similarity search without tears: the OMNI family of all-purpose access methods. In: Proceedings of the seventeenth International Conference on Data Engineering, pp 623-630.
11. Geusebroek JM, Burghouts GJ, Smeulders AWM (2005) The Amsterdam library of object images. Int J Comput Vis 61(1): 103-112.
12. Griffin G, Holub A, Perona P (2007) Caltech-256 object category dataset, TR-7694, California Institute of Technology.
13. Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proceedings of the ACM SIGMOD international conference on Management of Data, pp 47-57.
14. Huang Z, Sun S, Wang W (2009) Efficient mining of skyline objects in subspaces over data streams, Knowledge and Information Systems, Online published.
15. Kanth KVR, Agrawal D, Abbadi AE, Singh A (1999) Dimensionality reduction for similarity searching in dynamic databases. Comput Vis Image Underst 75(1-2): 59-72.
16. Katayama N, Satoh S (1997) The sr-tree: an index structure for high-dimensional nearest neighbor queries. In: Proceedings ACM SIGMOD International Conference on Management of Data, pp 369-380.
17. Katayama N, Satoh S (2000) Application of multidimensional indexing methods to massive processing of multimedia information. Syst Comput Jpn 31(13): 31-41.
18. Keogh EJ, Chakrabarti K, Mehrotra S, Pazzani MJ (2001) Locally adaptive dimensionality reduction for indexing large time series databases. In: Proceedings of the ACM SIGMOD international conference on Management of data, pp 369-380.
19. Keogh EJ, Chakrabarti K, Pazzani MJ, Mehrotra S (2001) Dimensionality reduction for fast similarity search in large time series databases. Knowl Inform Syst 3(3): 263-286.
20. Lin S, Chen S, Wu W, Chen C (2009) Parameter determination and feature selection for back-propagation network by particle swarm optimization. Knowl Inform Syst 21(2): 249-266.
21. Lowe D (2003) Distinctive image features from scale-invariant keypoints. Int J Comput Vis 60(2): 91-110.
22. Martinez JM (2002) Mpeg-7: overview of mpeg-7 description tools, part 2. IEEE Multimed 9(3): 83-93.
23. Sakurai Y, Yoshikawa M, Uemura S, Kojima H (2000) The A-tree: an index structure for high-dimensional spaces using relative approximation. In: Proceedings of the International Conference on Very Large Data Bases, pp 516-526.
24. Song G, Cui B, Zheng B, Xie K, Yang D (2009) Accelerating sequence searching: dimensionality reduction method. Knowl Inform Syst 20(3): 301-322.
25. UCI Machine Learning repository (1998) ftp://ftp. ics. uci. edu/pub/machine-learning-databases/optdigits/.
26. Vu K, Hua K, Cheng H, Lang SD (2008) Bounded approximation: a new criterion for dimensionality reduction approximation in similarity search. IEEE Trans Knowl Data Eng 20(6): 768-783.
27. Vu K, Hua KA, Cheng H, Lang SD (2006) A non-linear dimensionality-reduction technique for fast similarity search in large databases. In: Proceedings of the ACM SIGMOD international conference on Management of data, pp 527-538.
28. Wang JZ, Boujemaa N, Bimbo AD, Geman D, Hauptmann AG, Tesic J (2006) Diversity in multimedia information retrieval research. In: Proceedings of the ACM international workshop on Multimedia information retrieval, pp 5-12.
29. Weber R, Schek HJ, Blott S (1998) A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proceedings International Conference on Very Large Data Bases, pp 194-205.
30. White DA, Jain R (1996) Similarity indexing with the ss-tree. In: Proceedings of the International Conference on Data Engineering, pp 516-523.
31. Wu YL, Agrawal D, Abbadi AE (2000) A comparison of DFT and DWT based similarity search in time-series databases. In: Proceedings of the ACM CIKM International Conference on Information and Knowledge Management, pp 488-495.
32. Yi BK, Faloutsos C (2000) Fast time sequence indexing for arbitrary lp norms. In: Proceedings of the International Conference on Very Large Data Bases, pp 385-394.