Probabilistic proximity searching algorithms based on compact partitions
暂无分享,去创建一个
[1] Iraj Kalantari,et al. A Data Structure and an Algorithm for the Nearest Point Problem , 1983, IEEE Transactions on Software Engineering.
[2] Pavel Zezula,et al. Approximate similarity retrieval with M-trees , 1998, The VLDB Journal.
[3] Donna K. Harman,et al. Overview of the Second Text REtrieval Conference (TREC-2) , 1994, HLT.
[4] Raj Jain,et al. Algorithms and strategies for similarity retrieval , 1996 .
[5] Jeffrey K. Uhlmann,et al. Satisfying General Proximity/Similarity Queries with Metric Trees , 1991, Inf. Process. Lett..
[6] Sunil Arya,et al. An optimal algorithm for approximate nearest neighbor searching fixed dimensions , 1998, JACM.
[7] Gonzalo Navarro. Searching in metric spaces by spatial approximation , 2002, The VLDB Journal.
[8] F. DEHNE,et al. Voronoi trees and clustering problems , 1987, Inf. Syst..
[9] Gonzalo Navarro,et al. Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces , 2003, Inf. Process. Lett..
[10] Sergey Brin,et al. Near Neighbor Search in Large Metric Spaces , 1995, VLDB.
[11] Hartmut Noltemeier,et al. Monotonous Bisector* Trees - A Tool for Efficient Partitioning of Complex Scenes of Geometric Objects , 1992, Data Structures and Efficient Algorithms.
[12] Gonzalo Navarro,et al. An effective clustering algorithm to index high dimensional metric spaces , 2000, Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000.
[13] Sunil Arya,et al. Approximate range searching , 1995, SCG '95.
[14] Jonathan Goldstein,et al. Contrast Plots and P-Sphere Trees: Space vs. Time in Nearest Neighbour Searches , 2000, VLDB.
[15] Peter N. Yianilos,et al. Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract) , 2000, SODA '00.
[16] Ricardo A. Baeza-Yates,et al. Searching in metric spaces , 2001, CSUR.
[17] Kenneth L. Clarkson,et al. Nearest Neighbor Queries in Metric Spaces , 1999, Discret. Comput. Geom..
[18] Pavel Zezula,et al. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces , 1997, VLDB.
[19] 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).