On fast non-metric similarity search by metric access methods

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3896 LNCS, Issue , 2006, Pages 718-736

  Skopal, Tomáš ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATABASE SYSTEMS; INFORMATION RETRIEVAL; MULTIMEDIA SYSTEMS;

METRIC ACCESS METHODS (MAMS); RETRIEVAL EFFICIENCY; TRIANGULAR INEQUALITY; TRIGEN ALGORITHMS;

OBJECT RECOGNITION;

EID: 33745601374     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11687238_43     Document Type: Conference Paper

References (33)

1. C. C. Aggarwal, A. Hinneburg, and D. A. Keim. On the surprising behavior of distance metrics in high dimensional spaces. In ICDT. LNCS, Springer, 2001.
2. F. Ashby and N. Perrin. Toward a unified theory of similarity and recognition. Psychological Review, 95(1):124-150, 1988.
3. I. Bartolini, P. Ciaccia, and M. Patella. WARP: Accurate Retrieval of Shapes Using Phase of Fourier Descriptors and Time Warping Distance. IEEE Pattern Analysis and Machine Intelligence, 27(1):142-147, 2005.
4. E. Chávez and G. Navarro. A Probabilistic Spell for the Curse of Dimensionality. In ALENEX'01, LNCS 2153, pages 147-160. Springer, 2001.
5. E. Chávez, G. Navarro, R. Baeza-Yates, and J. L. Marroquín. Searching in metric spaces. ACM Computing Surveys, 33(3):273-321, 2001.
6. P. Ciaccia and M. Patella. Searching in metric spaces with user-defined and approximate distances. ACM Database Systems, 27(4):398-437, 2002.
7. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In VLDB'97, pages 426-435, 1997.
8. P. Corazza. Introduction to metric-preserving functions. American Mathematical Monthly, 104(4):309-23, 1999.
9. V. Dohnal, C. Gennaro, P. Savino, and P. Zezula. D-index: Distance searching index for metric data sets. Multimedia Tools and Applications, 21(1):9-33, 2003.
10. M. Donahue, D. Geiger, T. Liu, and R. Hummel. Sparse representations for image decomposition with occlusions. In CVPR, pages 7-12, 1996.
11. C. Faloutsos and K. Lin. Fastmap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets. In SIGMOD, 1995.
12. R. F. S. Filho, A. J. M. Traina, C. Traina, and C. Faloutsos. Similarity search without tears: The OMNI family of all-purpose access methods. In ICDE, 2001.
13. K.-S. Goh, B. Li, and E. Chang. DynDex: a dynamic and non-metric space indexer. In ACM Multimedia, 2002.
14. P. Hart. The condensed nearest neighbour rule. IEEE Transactions on Information Theory, 14(3):515-516, 1968.
15. G. R. Hjaltason and H. Samet. Properties of embedding methods for similarity searching in metric spaces. IEEE Patt.Anal. and Mach.Intell., 25(5):530-549, 2003.
16. P. Howarth and S. Ruger. Fractional distance measures for content-based image retrieval. In ECIR 2005, pages 447-456. LNCS 3408, Springer-Verlag, 2005.
17. D. Huttenlocher, G. Klanderman, and W. Rucklidge. Comparing images using the hausdorff distance. IEEE Pott. Anal and Mach. Intell., 15(9):850-863, 1993.
18. D. Jacobs, D. Weinshall, and Y. Gdalyahu. Classification with nonmetric distances: Image retrieval and class representation. IEEE Pattern Analysis and Machine Intelligence, 22(6):583-600, 2000.
19. A. K. Jain and D. E. Zongker. Representation and recognition of handwritten digits using deformable templates. IEEE Patt.Anal.Mach.Intell., 19(12):1386-1391, 1997.
20. O. Jesorsky, K. J. Kirchberg, and R. Frischholz. Robust face detection using the hausdorff distance. In AVBPA, pages 90-95. LNCS 2091, Springer-Verlag, 2001.
21. C. L. Krumhansl. Concerning the applicability of geometric models to similar data: The interrelationship between similarity and spatial density. Psychological Review, 85(5):445-463, 1978.
22. T. Mandl. Learning similarity functions in information retrieval. In EUFIT, 1998.
23. E. Rosch. Cognitive reference points. Cognitive Psychology, 7:532-47, 1975.
24. E. Rothkopf. A measure of stimulus similarity and errors in some paired-associate learning tasks. J. of Experimental Psychology, 53(2):94-101, 1957.
25. S. Santini and R. Jain. Similarity measures. IEEE Pattern Analysis and Machine Intelligence, 21(9):871-883, 1999.
26. T. Skopal, J. Pokorný, M. Krátký, and V. Snášel. Revisiting M-tree Building Principles. In ADBIS, Dresden, pages 148-162. LNCS 2798, Springer, 2003.
27. T. Skopal, J. Pokorný, and V. Snášel. Nearest Neighbours Search using the PM-tree. In DASFAA '05, Beijing, China, pages 803-815. LNCS 3453, Springer, 2005.
28. A. Tversky. Features of similarity. Psychological review, 84(4)-327-352, 1977.
29. A. Tversky and I. Gati. Similarity, separability, and the triangle inequality. Psychological Review, 89(2):123-154, 1982.
30. Wavelet-based Image Indexing and Searching, Stanford University, wing.ist.psu.idu.
31. R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In VLDB, 1998.
32. D. L. Wilson. Asymptotic properties of nearest neighbor rules using edited data. IEEE Transactions on Systems, Man, and Cybernetics, 2(3):408-421, 1972.
33. B.-K. Yi, H. V. Jagadish, and C. Faloutsos. Efficient retrieval of similar time sequences under time warping. In ICDE '98, pages 201-208, 1998.