Genetic algorithms for approximate similarity queries

Data and Knowledge Engineering

Volumn 62, Issue 3, 2007, Pages 459-482

  Bueno, Renato ^a   Traina, Agma J M ^a   Traina Jr , Caetano ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Approximate similarity queries; Genetic algorithms; Metric Access Methods

Indexed keywords

APPROXIMATION THEORY; DATABASE SYSTEMS; FEATURE EXTRACTION; INFORMATION RETRIEVAL; QUERY PROCESSING; SET THEORY;

APPROXIMATE SIMILARITY QUERIES; METRIC ACCESS METHODS;

GENETIC ALGORITHMS;

EID: 34248380533     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2006.08.013     Document Type: Article

References (34)

1. Rubner Y., and Tomasi C. Perceptual Metrics for Image Database Navigation (2001), Kluwer Academic Publishers., Norwell, MA, USA
2. Korn F., Pagel B.-U., and Faloutsos C. On the 'dimensionality curse' and the 'self-similarity blessing'. IEEE Trans. Knowledge Data Eng. (TKDE) 13 1 (2001) 96-111
3. Chávez E., Navarro G., Baeza-Yates R., and Marroquín J.L. Searching in metric spaces. ACM Comput. Surv. 33 3 (2001) 273-321
4. E. Chávez, G. Navarro, Towards measuring the searching complexity of metric spaces, in: Proceedings of the Mexican Computing Meeting, vol. II, Sociedad Mexicana de Ciencias de la Computación, Aguascalientes, México, 2001, pp. 969-978.
5. Faloutsos C. Indexing of multimedia data. Multimedia Databases in Perspective (1997), Springer-Verlag 219-245
6. Burkhard W.A., and Keller R.M. Some approaches to best-match file searching. Commun. ACM 16 4 (1973) 230-236
7. P. Ciaccia, M. Patella, P. Zezula, M-tree: an efficient access method for similarity search in metric spaces, in: International Conference on Very Large Data Bases (VLDB), Athens, Greece, 1997, pp. 426-435.
8. Traina Jr. C., Traina A.J.M., Seeger B., and Faloutsos C. Slim-trees: high performance metric trees minimizing overlap between nodes. International Conference on Extending Database Technology. Lecture Notes in Computer Science vol. 1777 (2000), Springer, Konstanz, Germany 51-65
9. Traina Jr. C., Traina A.J.M., Faloutsos C., and Seeger B. Fast indexing and visualization of metric datasets using Slim-trees. IEEE Trans. Knowledge Data Eng. (TKDE) 14 2 (2002) 244-260
10. Vieira M.R., Traina C., Chino F.J.T., and Traina A.J.M. DBM-tree: a dynamic metric access method sensitive to local density data. Brazilian Symposium on Databases (SBBD) (2004), Brasília, DF, Brazil 163-177
11. Hjaltason G.R., and Samet H. Index-driven similarity search in metric spaces. ACM Trans. Database Syst. 28 4 (2003) 517-580
12. Roussopoulos N., Kelley S., and Vincent F. Nearest neighbor queries. ACM International Conference on Management of Data (SIGMOD) (1995), ACM Press, San Jose, CA, USA 80-91
13. Holland J.H. Adaptation in Natural and Artificial Systems (1975), University of Michigan Press, Ann Arbor, MI, USA
14. Goldberg D.E. Genetic Algorithms in Search Optimization and Machine Learning. first ed. (1989), Addison-Wesley, Boston, MA, USA
15. Whitley D. A genetic algorithm tutorial. Statist. Comput. 4 2 (1994) 65-85
16. K.A. De Jong, An analysis of the behavior of a class of genetic adaptive systems, Ph.D. thesis, University of Michigan, Department of Computer and Communication Sciences, 1975.
17. S. Berchtold, C. Bhm, H.-P. Kriegel, The Pyramid-tree: breaking the curse of dimensionality, in: ACM International Conference on Management of Data (SIGMOD), Seattle, WA, USA, 1998, pp. 142-153.
18. Gionis A., Indyk P., and Motwani R. Similarity search in high dimensions via hashing. International Conference on Very Large Data Bases (VLDB) vol. 1 (1999), Morgan Kaufman, Edinburgh, Scotland, UK 518-529
19. Ciaccia P., and Patella M. PAC nearest neighbor queries: approximate and controlled search in high-dimensional and metric spaces. IEEE International Conference on Data Engineering (ICDE) (2000), IEEE Computer Society, San Diego, CA, USA 244-255
20. Zezula P., Savino P., Amato G., and Rabitti F. Approximate similarity retrieval with M-trees. The VLDB J. The Int. J. Very Large Data Bases 7 4 (1998) 275-293
21. J. Goldstein, R. Ramakrishnan, Contrast plots and P-sphere trees: space vs. time in nearest neighbour searches, in: International Conference on Very Large Data Bases (VLDB), Cairo, Egypt, 2000, pp. 429-440.
22. Bustos B., and Navarro G. Probabilistic proximity search algorithms based on compact partitions. J. Discr. Algorithms 2 1 (2004) 115-134
23. G.R. Hjaltason, H. Samet, Incremental similarity search in multimedia databases, Technical Report TR-4199, University of Maryland, College Park, MD, USA, 2000.
24. Faloutsos C., and Lin K.-I.D. FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. ACM International Conference on Management of Data (SIGMOD) (1995), ACM Press, San Jose, CA, USA 163-174
25. Berchtold S., Bhm C., Keim D.A., and Kriegel H.-P. A cost model for nearest neighbor search in high-dimensional data space. ACM Symposium on Principles of Database Systems (PODS) (1997), ACM Press, Tucson, AZ, USA 78-86
26. Acharya S., Poosala V., and Ramaswamy S. Selectivity estimation in spatial databases. In: Delis A., Faloutsos C., and Ghandeharizadeh S. (Eds). ACM International Conference on Management of Data (SIGMOD) (1999), ACM Press, Philadelphia, PA, USA 13-24
27. Tao Y., Zhang J., Papadias D., and Mamoulis N. An efficient cost model for optimization of nearest neighbor search in low and medium dimensional spaces. IEEE Trans. Knowledge Data Eng. (TKDE) 16 10 (2004) 1169-1184
28. Gunopulos D., Kollios G., Tsotras V.J., and Domeniconi C. Selectivity estimators for multidimensional range queries over real attributes. The VLDB J. The Int. J. Very Large Data Bases 14 2 (2005) 137-154
29. Theodoridis Y., Stefanakis E., and Sellis T.K. Efficient cost models for spatial queries using r-trees. IEEE Trans. Knowledge Data Eng. (TKDE) 12 1 (2000) 19-32
30. Traina Jr. C., Traina A.J.M., and Faloutsos C. Distance exponent: a new concept for selectivity estimation in metric trees. IEEE International Conference on Data Engineering (ICDE) (2000), IEE CS Press, San Diego, CA, USA 195
31. Chen C.-M., and Ling Y. A sampling-based estimator for top-k query. IEEE International Conference on Data Engineering (ICDE) (2002), IEEE Computer Society, San Jose, CA, USA 617-627
32. R. Bueno, A.J.M. Traina, C. Traina Jr., Genetic algorithm for approximate similarity searching, in: Brazilian Symposium on Databases (SBBD), Uberlândia, MG, Brazil, 2005, pp. 190-204 (in portuguese).
33. R. Bueno, M.R.P. Ferreira, C. Traina Jr., Dbgen manual, Technical Report 246, University of São Paulo, São Carlos, SP, Brazil, 2004.
34. Levenshtein V. Binary codes capable of correcting deletions, insertions, and reversals. Cybernet. Control Theory 10 8 (1966) 707-710