Similarity search in arbitrary subspaces under Lp-norm

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2008, Pages 317-326

  Lian, Xiang ^a   Chen, Lei ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION SERVICES; SEARCH ENGINES; STATISTICAL METHODS; TECHNOLOGY; TIME SERIES ANALYSIS;

ARBITRARY NUMBERS; ARBITRARY SUBSPACES; COST MODELLING; DATA ENGINEERING; DATA OBJECTS; DATA SETS; IMAGE DATA ANALYSIS; INTERNATIONAL CONFERENCES; PROCESS DATA; QUERY OBJECT; SEARCH PROBLEMS; SIMILARITY QUERY; SIMILARITY SEARCHES; TIME-SERIES;

QUERY PROCESSING;

EID: 52649094835     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2008.4497440     Document Type: Conference Paper

References (31)

1. Data warehousing and OLAP; a research-oriented bibliography. http://www.ondelette.com/OLAP/dwbib.html.
2. R. Agrawal, C. Faloutsos, and A. N. Swami. Efficient similarity search in sequence databases. In Proc. Int. Conf. of Foundations of Data Organization and Algorithms, pages 69-84, 1993.
3. C. Böhm, S. Berchtold, and D. A. Keim. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases, ACM Comput. S.urv., 33(3):322-373, 2001.
4. T. Bozkaya and M. Ozsoyoglu. Distance-based indexing for high-dimensional metric spaces. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 357-368, 1997.
5. T. Bozkaya and M. Ozsoyoglu. Indexing large metric spaces for similarity search queries. ACM Trans: Database Sys., 24(3):361-404, 1999.
6. K. P. Chan and A.W-C Fu. Efficient time series matching by wavelets. In Proc. 15th Int. Conf. on Data Engineering, pages 126-133, 1999.
7. E. Chav́ez, G. Navarro, R. Baeza-Yates, and J. L. Marroquá. Searching in metric spaces. ACM Comput. Surv., 33(3);273-321, 2001.
8. L. Chen, M. T. Özsu, and V. Oria. Robust and fast similarity search for moving object trajectories. In Proc. ACM SIGMOD Int. Conf. On Management Of Data, pages 491-502, 2005.
9. C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast subsequence matching in time-series databases. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 419-429, 1994.
10. R. F. S. Filho, A. J. M. Traina, C. Traina Jr., and C. Faloutsos. Similarity search without tears: The OMNI family of all-purpose access methods. In Proc. 17th Int. Conf. on Data Engineering, pages 623-630, 2001.
11. K-S. Goh, B. T. Li, and Ed. Chang. Dyndex: a dynamic and non-metric space indexer. In Proc. 10th ACM Int. Conf. on Multimedia, pages 466-475, 2002.
12. C. M. Grinstead and J. L. Snell. Introduction to probability, pages 333-337. AMS, 1997.
13. A. Guttman. R-trees: a dynamic index structure for spatial searching. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 47-57, 1984.
14. I. Guyon and A. Elisseeff An introduction to variable and feature selection. J. Mach. Learn. Res.. 3:1157-1182, 2003.
15. X. He. Incremental semi-supervised subspace learning for image retrieval. In Proc. 13rd ACM Int. Conf. on Multimedia, 2005.
16. X. He, D. Cai, and P. Niyogi. Tensor subspace analysis. In Neural Information Processing Systems, 2005.
17. G. Jovanovic-Dolecek, Demo program for central limit theorem. In Circuits and Systems, 1997.
18. Y. Ke, R. Sukthankar, and L. Huston. An efficient parts-based near-duplicate and sub-image retrieval system. In Proc. 12nd ACM.Int. Conf. on Multimedia, pages 869-876, 2004.
19. R. Kohavi and D. Sommerfield. Feature subset selection using the wrapper model: Oyerfitting and dynamic search space topology. In Int. Conf. on Knowledge Discovery and Data Mining, pages 192-197, 1995.
20. F. Korn, H. Jagadish, and C. Faloutsos. Efficiently supporting ad hoc queries in large datasets of time sequences. In Proc, ACM SIGMOD Int. Conf. on Management of Data, pages .289-300, 1997.
21. M. Koskela, J. Laaksonen, and E. Oja. Use of image subset features in image retrieval with self-organizing maps, In Conf. on Image and Video Retrieval, pages 508-516, 2004.
22. N. Koudas, B. Ooi, H. Shen, and A. Tung. Ldc: Enabling search by partial distance in a hyper-dimensional space. In Proc. 21st Int. Conf. on Data Engineering, pages 6-17, 2004.
23. H., Lejsek, F. H. Ásmundsson, B T. Jónsson, and L. Amsaleg. Scalability of local image descriptors: A comparative study. In Proc. 14th ACM Int. Conf. on Multimedia, 2004.
24. D. G. Lowe. Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vision, 60(2):91-110, 2004.
25. R. T. Ng and J. Han. Efficient and effective clustering methods for spatial data milling. In 20th:Int. Conf. on Very Large Data Bases, pages 144-155, 1994.
26. W. Niblack, R. Barber, W. Equitz, M. Flickner, E. Glasman, D. Petkovic, P. Yanker, C. Faloutsos, and G. Taubin. The QBIC project: querying images by content using color, texture and shape, In Proc. 5th M. Symp. on Storage and Retrieval for Image and Video Databases, pages 173-185, 1993.
27. A. K. H. Tung, R. Zhang, N. Koudas, and B. C. Ooi. Similarity search: A matching based approach. In Proc. 32nd Int. Conf. on Vety Large Data Bases, pages 631-642, 2006.
28. E. W. Weisstein. Central Limit Theorem. http://mathworld.wolfram.com /CentralLimitTheorem.html.
29. p norms. In Proc. 26th Ini. Conf. on Very Large Data Bases, pages 385-394, 2000.
30. P. N. Yianilos, Data structures and algorithms for nearest neighbor search in general metric spaces. In Proc. of Annual ACM-SIAM Symposium on Discrete Algorithms, pages 311-321, 1993.
31. M. L. Yiu and N. Mamoulis. Reverse. nearest neighbors search in ad-hoc subspaces. In Proc, 22nd Int. Conf. on Data Engineering, page 76, 2006.