Query-sensitive embeddings

ACM Transactions on Database Systems

Volumn 32, Issue 2, 2007, Pages

  Athitsos, Vassilis ^a   Hadjieleftheriou, Marios ^b,c   Kollios, George ^a   Sclaroff, Stan ^a  

^a BOSTON UNIVERSITY   (United States)

^b AT AND T LABS RESEARCH   (United States)

^c AT AND T LABS RESEARCH   (United States)

Author keywords

Embedding methods; Nearest neighbor retrieval; Non Euclidean spaces; Nonmetric spaces; Similarity matching

Indexed keywords

EMBEDDING METHODS; NEAREST-NEIGHBOR RETRIEVAL; NON-EUCLIDEAN SPACES; NONMETRIC SPACES; SIMILARITY MATCHING;

CONFORMAL MAPPING; DATABASE SYSTEMS; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL; TIME SERIES ANALYSIS;

QUERY PROCESSING;

EID: 34547492888     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1242524.1242525     Document Type: Article

References (45)

1. AGGARWAL, C. C. 2001. Re-Designing distance functions and distance-based applications for high dimensional data. SIGMOD Rec. 30, 1, 13-18.
2. ATHITSOS, V. 2006. Learning embeddings for indexing, retrieval, and classification, with applications to object and shape recognition in image databases. Ph.D. thesis, Boston University.
3. ATHITSOS, V., ALON, J., AND SCLAROFF, S. 2005. Efficient nearest neighbor classification using a cascade of approximate similarity measures. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 486-493.
4. ATHITSOS, V., ALON, J., SCLAROFF, S., AND KOLLIOS, G. 2004. BoostMap: A method for efficient approximate similarity rankings. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 268-275.
5. ATHITSOS, V., HADJIELEFTHERIOU, M., KOLLIOS, G., AND SCLAROFF, S. 2005. Query-Sensitive embeddings. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 706-717.
6. ATHITSOS, V. AND SCLAROFF, S. 2003. Database indexing methods for 3D hand pose estimation. In Proceedings of the Gesture Workshop. (Heidelberg, Germany) Springer Verlag. 288-299.
7. BARROW, H., TENENBAUM, J., BOLLES, R., AND WOLF, H. 1977. Parametric correspondence and Chamfer matching: Two new techniques for image matching. In Proceedings of the International Joint Conference on Artificial Intelligence. 659-663.
8. BELONGIE, S., MALIK, J., AND PUZICHA, J. 2002. Shape matching and object recognition using shape contexts. IEEE Trans. Pattern Anal. Mach. Intell. 24, 4, 509-522.
9. BÖHM, C., BERCHTOLD, S., AND KEIM, D. A. 2001. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Comput. Surv. 33, 3, 322-373.
10. BOURGAIN, J. 1985. On Lipschitz embeddings of finite metric spaces in Hilbert space. Israel J. Math. 52, 46-52.
11. BOZKAYA, T. AND ÖZSOYOGLU, Z. 1999. Indexing large metric spaces for similarity search queries. ACM Trans. Database Syst. 24, 3, 361-404.
12. CHAKRABARTI, K. AND MEHROTRA, S. 2000. Local dimensionality reduction: A new approach to indexing high dimensional spaces. In Proceedings of the International Conference on Very Large Data Bases. 89-100.
13. DOMENICONI, C., PENG, J., AND GUNOPULOS, D. 2002. Locally adaptive metric nearest-neighbor classification. IEEE Trans. Pattern Anal. Mach. Intell. 24, 9, 1281-1285.
14. EGECIOGLU, Ö. AND FERHATOSMANOGLU, H. 2000. Dimensionality reduction and similarity distance computation by inner product approximations. In Proceedings of the International Conference on Information and Knowledge Management. 219-226.
15. FALOUTSOS, C. AND LIN, K. I. 1995. FastMap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 163-174.
16. GIONIS, A., INDYK, P., AND MOTWANI, R. 1999. Similarity search in high dimensions via hashing. In Proceedings of the International Conference on Very Large Databases. 518-529.
17. HASTIE, T. AND TIBSHIRANI, R. 1996. Discriminant adaptive nearest-neighbor classification. IEEE Trans. Pattern Analy. Mach. Intell. 18, 6, 607-616.
18. HINNEBURG, A., AGGARWAL, C. C., AND KEIM, D. A. 2000. What is the nearest neighbor in high dimensional spaces? In Proceedings of the International Conference on Very Large Data Bases. 506-515.
19. HJALTASON, G. AND SAMET, H. 2003a. Properties of embedding methods for similarity searching in metric spaces. IEEE Trans. Pattern Anal. Mach. Intell. 25, 5, 530-549.
20. HJALTASON, G. R. AND SAMET, H. 2003b. Index-Driven similarity search in metric spaces. ACM Trans. Database Syst. 28, 4, 517-580.
21. HRISTESCU, G. AND FARACH-COLTON, M. 1999. Cluster-Preserving embedding of proteins. Tech. Rep. 99-50, Department of Computer Science, Rutgers University.
22. HUTTENLOCHER, D., KLANDERMAN, D., AND RUCKLIGE, A. 1993. Comparing images using the Hausdorff distance. IEEE Trans. Pattern Anal. Mach. Intell. 15, 9, 850-863.
23. JACOBS, D. W., WEINSHALL, D., AND GDALYAHU, Y. 2000. Classification with nonmetric distances: Image retrieval and class representation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22, 6, 583-600.
24. KANTH, K. V. R., AGRAWAL, D., AND SINGH, A. 1998. Dimensionality reduction for similarity searching in dynamic databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 166-176.
25. KEOGH, E. 2002. Exact indexing of dynamic time warping. In Proceedings of the International Conference on Very Large Data Bases. 406-417.
26. KOUDAS, N., OOI, B. C., SHEN, H. T., AND TUNG, A. K. H. 2004. LDC: Enabling search by partial distance in a hyper-dimensional space. In Proceedings of the IEEE International Conference on Data Engineering. 6-17.
27. KRUSKALL, J. B. AND LIBERMAN, M. 1983. The symmetric time warping algorithm: From continuous to discrete. In Time Warps. Addison-Wesley.
28. LECUN, Y., BOTTOU, L., BENGIO, Y., AND HAFFNER, P. 1998. Gradient-Based learning applied to document recognition. Proc. IEEE 86, 11, 2278-2324.
29. LI, C., CHANG, E., GARCIA-MOLINA, H., AND WIEDERHOLD, G. 2002. Clustering for approximate similarity search in high-dimensional spaces. IEEE Trans. Knowl. Data Eng. 14, 4, 792-808.
30. PAREDES, R. AND VIDAL, E. 2000. A class-dependent weighted dissimilarity measure for nearest neighbor classification problems. Pattern Recogn. Lett. 21, 12, 1027-1036.
31. ROWEIS, S. AND SAUL, L. 2000. Nonlinear dimensionality reduction by locally linear embedding. Sci. 290, 2323-2326.
32. SAHINALP, S. C., TASAN, M., MACKER, J., AND ÖZSOYOGLU, Z. M. 2003. Distance based indexing for string proximity search. In Proceedings of the IEEE International Conference on Data Engineering. 125-136.
33. SAKURAI, Y., YOSHIKAWA, M., UEMURA, S., AND 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. 516-526.
34. SCHAPIRE, R. AND SINGER, Y. 1999. Improved boosting algorithms using confidence-rated predictions. Mach. Learn. 37, 3, 297-336.
35. TENENBAUM, J., SILVA, V. D., AND LANGFORD, J. 2000. A global geometric framework for nonlinear dimensionality reduction. Sci. 290, 2319-2323.
36. TRAINA, JR., C., TRAINA, A., SEEGER, B., AND FALOUTSOS, C. 2000. Slim-Trees: High performance metric trees minimizing overlap between nodes. In Proceedings of the 7th International Conference on Extending Database Technology (EDBT). 51-65.
37. VLACHOS, M., HADJIELEFTHERIOU, M., GUNOPULOS, D., AND KEOGH, E. 2003. Indexing multi-dimensional time-series with support for multiple distance measures. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 216-225.
38. WANG, X., WANG, J. T. L., LIN, K. I., SHASHA, D., SHAPIRO, B. A., AND ZHANG, K. 2000. An index structure for data mining and clustering. Know. Inf. Syst. 2, 2, 161-184.
39. WEBER, R. AND BÖHM, K. 2000. Trading quality for time with nearest-neighbor search. In Proceedings of the International Conference on Extending Database Technology. 21-35.
40. WEBER, R., SCHEK, H.-J., AND BLOTT, S. 1998. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proceedings of the International Conference on Very Large Data Bases. 194-205.
41. WHITE, D. A. AND JAIN, R. 1996. Similarity indexing: Algorithms and performance. In Proceedings of the SPIE Storage and Retrieval for Image and Video Databases. 62-73.
42. YI, B.-K., JAGADISH, H. V., AND FALOUTSOS, C. 1998. Efficient retrieval of similar time sequences under time warping. In Proceedings of the IEEE International Conference on Data Engineering. 201-208.
43. YIANILOS, P. 1993. Data structures and algorithms for nearest neighbor search in general metric spaces. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. 311-321.
44. YOUNG, F. AND HAMER, R. 1987. Multidimensional Scaling: History, Theory and Applications. Lawrence Erlbaum, Hillsdale, NJ.
45. ZEZULA, P., SAVINO, P., AMATO, G., AND RABITTI, F. 1998. Approximate similarity retrieval with M-trees. VLDB J. 4, 275-293.