Genetic algorithms for approximate similarity queries
暂无分享,去创建一个
[1] Pavel Zezula,et al. Approximate similarity retrieval with M-trees , 1998, The VLDB Journal.
[2] Christos Faloutsos,et al. Distance Exponent: A New Concept for Selectivity Estimation in Metric Trees , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).
[3] Darrell Whitley,et al. A genetic algorithm tutorial , 1994, Statistics and Computing.
[4] Christos Faloutsos,et al. Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes , 2000, EDBT.
[5] Yufei Tao,et al. An efficient cost model for optimization of nearest neighbor search in low and medium dimensional spaces , 2004, IEEE Transactions on Knowledge and Data Engineering.
[6] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[7] Carlo Tomasi,et al. Perceptual metrics for image database navigation , 1999 .
[8] Jonathan Goldstein,et al. Contrast Plots and P-Sphere Trees: Space vs. Time in Nearest Neighbour Searches , 2000, VLDB.
[9] Marco Patella,et al. PAC nearest neighbor queries: Approximate and controlled search in high-dimensional and metric spaces , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).
[10] Pavel Zezula,et al. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces , 1997, VLDB.
[11] Christos Faloutsos,et al. On the 'Dimensionality Curse' and the 'Self-Similarity Blessing' , 2001, IEEE Trans. Knowl. Data Eng..
[12] Chung-Min Chen,et al. A Sampling-Based Estimator for Top-k Query. , 2002, ICDE 2002.
[13] Nick Roussopoulos,et al. Nearest neighbor queries , 1995, SIGMOD '95.
[14] Piotr Indyk,et al. Similarity Search in High Dimensions via Hashing , 1999, VLDB.
[15] Christos Faloutsos,et al. Fast Indexing and Visualization of Metric Data Sets using Slim-Trees , 2002, IEEE Trans. Knowl. Data Eng..
[16] Ricardo A. Baeza-Yates,et al. Searching in metric spaces , 2001, CSUR.
[17] Martín Abadi,et al. Security analysis of cryptographically controlled access to XML documents , 2005, PODS '05.
[18] Christos Faloutsos,et al. FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets , 1995, SIGMOD '95.
[19] Christos Faloutsos,et al. Indexing of Multimedia Data , 1997, Multimedia Databases in Perspective.
[20] Timos K. Sellis,et al. Efficient Cost Models for Spatial Queries Using R-Trees , 2000, IEEE Trans. Knowl. Data Eng..
[21] Gonzalo Navarro,et al. Probabilistic proximity searching algorithms based on compact partitions , 2004, J. Discrete Algorithms.
[22] Peter M. G. Apers,et al. Multimedia Databases in Perspective , 1997, Springer London.
[23] Dimitrios Gunopulos,et al. Selectivity estimators for multidimensional range queries over real attributes , 2005, The VLDB Journal.
[24] Christian Böhm,et al. A cost model for nearest neighbor search in high-dimensional data space , 1997, PODS.
[25] Walter A. Burkhard,et al. Some approaches to best-match file searching , 1973, Commun. ACM.
[26] Hans-Peter Kriegel,et al. The pyramid-technique: towards breaking the curse of dimensionality , 1998, SIGMOD '98.
[27] Kenneth Alan De Jong,et al. An analysis of the behavior of a class of genetic adaptive systems. , 1975 .
[28] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[29] Vladimir I. Levenshtein,et al. Binary codes capable of correcting deletions, insertions, and reversals , 1965 .
[30] Hanan Samet,et al. Index-driven similarity search in metric spaces (Survey Article) , 2003, TODS.
[31] Sridhar Ramaswamy,et al. Selectivity estimation in spatial databases , 1999, SIGMOD '99.