Clustering-based similarity search in metric spaces with sparse spatial centers

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

Volumn 4910 LNCS, Issue , 2008, Pages 186-197

  Brisaboa, Nieves ^a   Pedreira, Oscar ^a   Seco, Diego ^a   Solar, Roberto ^b,c   Uribe, Roberto ^b,c  

^a UNIVERSITY OF A CORUÑA   (Spain)

^b UNIVERSIDAD DE MAGALLANES   (Chile)

^c UNIVERSIDAD NACIONAL DE LA PATAGONIA AUSTRAL   (Argentina)

Author keywords

Cluster center selection; Metric spaces; Similarity search; Sparse spatial selection

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA MINING; INDEXING (OF INFORMATION);

CLUSTER CENTER SELECTION; METRIC SPACES; SIMILARITY SEARCH; SPARSE SPATIAL SELECTION;

INFORMATION SYSTEMS;

EID: 38549178020     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77566-9_16     Document Type: Conference Paper

References (18)

1. Chávez, E., Navarro, G., Baeza-Yates, R., Marroquín, J.L.: Searching in metric spaces. ACM Computing Surveys 33, 273-321 (2001)
2. Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity search. The metric space approach 32 (2006)
3. Burkhard, W.A., Keller, R.M.: Some approaches to best-match file searching. Communications of the ACM 16, 230-236 (1973)
4. Baeza-Yates, R., Cunto, W., Manber, U., Wu, S.: Proximity matching using fixed-queries trees. In: Crochemore, M., Gusfield, D. (eds.) CPM 1994. LNCS, vol. 807, pp. 198-212. Springer, Heidelberg (1994)
5. Baeza-Yates, R.: Searching: an algorithmic tour. Encyclopedia of Computer Science and Technology 37, 331-359 (1997)
6. Chávez, E., Marroquín, J.L., Navarro, G.: Overcoming the curse of dimensionality. In: CBMI 1999. European Workshop on Content-based Multimedia Indexing, pp. 57-64 (1999)
7. Yianilos, P.: Data structures and algorithms for nearest-neighbor search in general metric space. In: Proceedings of the fourth annual ACM-SIAM Symposium on Discrete Algorithms, pp. 311-321 (1993)
8. Bozkaya, T., Ozsoyoglu, M.: Distance-based indexing for high-dimensional metric spaces. In: SIGMOD 1997. Proceedings of the ACM International Conference on Management of Data, pp. 357-368 (1997)
9. Yianilos, P.: Excluded middle vantage point forests for nearest neighbor search. In: Goodrich, M.T., McGeoch, C.C. (eds.) ALENEX 1999. LNCS, vol. 1619, Springer, Heidelberg (1999)
10. Vidal, E.: An algorithm for finding nearest neighbors in (aproximately) constant average time. Pattern Recognition Letters 4, 145-157 (1986)
11. Mico, L., Oncina, J., Vidal, R.E.: A new version of the nearest-neighbor approximating and eliminating search (aesa) with linear pre-processing time and memory requirements. Pattern Recognition Letters 15, 9-17 (1994)
12. Kalantari, I., McDonald, G.: A data structure and an algorithm for the nearest point problem. IEEE Transactions on Software Engineering 9, 631-634 (1983)
13. Uhlmann, J.K.: Satisfying general proximity/similarity queries with metric trees. Information Processing Letters 40, 175-179 (1991)
14. Brin, S.: Near neighbor search in large metric spaces. In: 21st conference on Very Large Databases (1995)
15. Brisaboa, N.R., Pedreira, O.: Spatial selection of sparse pivots for similarity search in metric spaces. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plášil, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 434-445. Springer, Heidelberg (2007)
16. Uribe, R., Navarro, G., Barrientes, R.J., Marín, M.: An index data structure for searching in metric space databases. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J.J. (eds.) ICCS 2006. LNCS, vol. 3991, pp. 611-617. Springer, Heidelberg (2006)
17. Bustos, B., Navarro, G., Chavez, E.: Pivot selection techniques for proximity searching in metric spaces. Pattern Recognition Letters 24(14), 2357-2366 (2003)
18. Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: VLDB 1997. Proceedings of the 23rd International Conference on Very Large Data Bases, pp. 426-435 (1997)