A non-linear dimensionality-reduction technique for fast similarity search in large databases

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2006, Pages 527-538

  Vu, Khanh ^a   Hua, Kien A ^a   Cheng, Hao ^a   Lang, Sheau Dong ^a  

^a University of Central Florida   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INDEXING (OF INFORMATION); NONLINEAR SYSTEMS; PARAMETER ESTIMATION;

DATASPACE; EUCLIDEAN DISTANCE; LINEAR TRANSFORMATION SCHEME;

DATA REDUCTION;

EID: 34250655397     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1142473.1142532     Document Type: Conference Paper

References (36)

1. http://sipi.iisc.edu/services/database/database.html.
2. http://u-foria.org/marioh/spatialindex/.
3. http://www.cse.ohio-state.edu/o&Tild;zturk/data/data.
4. http://www.ctisus.org/tf/indextf.html.
5. http://www.mediateam.oulu.fi/mtdb/download.html.
6. N. Beckman, H. Kriegel, R. Schneider, and B. Seeger, The r*-tree: an efficient and robust access method foipoints and rectangles. In ACM SIGMOD, pages 322-331, May 1990.
7. S. Berchtold, C. Bohm, and H. Kriegel. The pyramid-technique: Toward breaking the curse of dimentionality. In Proc. of the ACM SIGMOD Int. Conf. on Management of Data, pages 142-153, 1998.
8. S. Berchtold, D. Keim, and H. Kriegel. The x-tree: An index structure for high-dimensional data. In Proc. of VLDB Conference, 1996.
9. C. Blake and C. Merz. UCI repository of machine learning databases, 1998.
10. J. Bourgain. On lipschitz embedding of finite metric spaces into hilbert space. Israel Journal of Mathematics, (52):46-52, 1985.
11. J. C. Traina, A. Traina, C. Faloutsos, and B. Seeger. Fast indexing and visualization of metric data, sets using slim-trees. IEEE Transactions on Knowledge and Data Engineering, 14(2):244-260, 2002.
12. G. Cha, X. Zhu, D. Petkovic, and C. Chung. An efficient indexing method for nearest neighbor searches in high-dimensional image databases. IEEE Transactions on Multimedia, 4(1):76-87, Mar. 2002.
13. D. L. Donoho. High-dimensional data analysis: The curses and blessings of dimensionality. In AMS Conference Mathematical Challenges of the 21st Century, 2000, http://www.waveletidr.org/lectures.html.
14. O. Egecioglu, H. Ferhatosmanoglu, and U. Ogra. Dimensionality reduction and similarity computation by inner-product approximations. IEEE Transactions on Knowledge and Engineering, 16(6): 1-13, 2004.
15. C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast subsequence matching in time-series databases. In Proc. ACM SIGMOD, pages 419-429, May 1994.
16. R. F. S. Filho, A. J. M. Traina, C. T. Jr., and C. Faloutsos. Similarity search without tears: The OMNI family of all-purpose access methods. In ICDE, pages 623-630, 2001.
17. V. Gaede and O. Günther. Multidimensional access methods. ACM Computing Surveys, 30(2):170-231, 1998.
18. D. Goldin and P. Kanellakis. On similarity queries for time-series data,: Constraint specifications and implementation. In Proc. of Constraint Programming, pages 137-153, Sep. 1995.
19. K. A. Hua, K. Vu, and J. Oh. Sammatch: A flexible and efficient sampling-based image retrieval technique for large image databases. In Proc. of the 1999 ACM International Multimedia Conference, pages 225-234, Oct 1999.
20. K. V. R,. Kanth, D. Agrawal, A. E. Abbadi, and A. Singh. Dimensionality reduction for similarity searching in dynamic databases. In ACM SIGMOD Conference Proceedings, pages 166-176, 1998.
21. E. Keogh, K. Chakrabarti, M. Pazzani, and Mehrotra. Dimensionality reduction for fast similarity search in large time series databases. Journal of Knowledge and Information Systems, 2000.
22. E. J. Keogh, K. Chakrabarti, S. Mehrotra, and M. J. Pazzani. Locally adaptive dimensionality reduction for indexing large time series databases. In SIGMOD Conference, pages 151-162, 2001.
23. E. J. Keogh and M. J. Pazzani. Scaling up dynamic time warping for data mining applications. In KDD, pages 285-289, 2000.
24. C. Li, P. Yu, and V. Castelli. Hierarchyscan: A hierarchical similarity search algorithm for databases of long sequences. In Proc. of ICDE, pages 546-553, 1996.
25. A. Natsev, R. Rastogi, and K. Shim. Walrus: A similarity retrieval algorithm for image databases. In Proc. of the 1999 ACM SIGMOD Int. Conf. on Management of Data, pages 395-406, 1999.
26. A. Paradopoulos and Y. Manolopoulos. Performance of nearest neighbor queries in r-trees. In Int. Conf. Database Theory, pages 394-408, 1997.
27. R.Agrawal, C. Faloutsos, and A. Swami. Efficient similarity search in sequence databases. In Proc. of the FODO Conference, Oct 1993.
28. S. Roweis. Em algorithms for pea and spca. In Neural Information Processing Systems 10, page 626632, 1997.
29. H. Samet. Foundations of Multidimensional and Metric Data Structures. The Morgan Kaufmann Series in Computer Graphics, San Fransisco, CA, first edition, 2006.
30. T. Seidl and H. Kriegel. Optimal multi-step k-nearest neighbor search. In Proc. of the ACM SIGMOD Int. Conf. on Management of Data, pages 154-165, 1998.
31. L. Sirovich and R,. Everson. Management and analysis of large scientific datasets. Int. Journal of Supercomputer Applications, 6(1):5068, 1992.
32. K. Vu, K. A. Hua, and S.-D. Lang. Bounding search spheres using iso-hypersurfaces: An approach to efficient spherical range search in high dimensional spaces. To appear.
33. R. Weber, H. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proc. of the 24*h VLDB Conference, pages 194-205, 1998.
34. Y. Wu, D. Agrawal, and A. Abbadi. A comparison of dft and dwt based similarity search in time series databases. In Proc. of the 19th International Conference on Information and Knowledge Management, 2000.
35. J. Ye, R. Janardan, and Q. Li. Gpca: an efficient dimension reduction scheme for image compression and retrieval. In KDD '04: Proceedings of the 2004 ACM SIGKDD international conference on Knowledge discovery and data mining, pages 354-363, 2004.
36. p norms. In The VLDB Journal, pages 385-394, 2000.