暂无分享,去创建一个
Arnab Bhattacharya | Piyush Kumar | Sakshi Sinha | Akhil Arora | Piyush Kumar | Arnab Bhattacharya | Akhil Arora | Sakshi Sinha
[1] Naonori Ueda,et al. Fast approximate similarity search based on degree-reduced neighborhood graphs , 2011, KDD.
[2] Jing Wang,et al. Fast Neighborhood Graph Search Using Cartesian Concatenation , 2013, 2013 IEEE International Conference on Computer Vision.
[3] Hans-Peter Kriegel,et al. The X-tree : An Index Structure for High-Dimensional Data , 2001, VLDB.
[4] James M. Kang,et al. Space-Filling Curves , 2017, Encyclopedia of GIS.
[5] A. Guttmma,et al. R-trees: a dynamic index structure for spatial searching , 1984 .
[6] Yury A. Malkov,et al. Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs , 2016, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[7] Shin'ichi Satoh,et al. The SR-tree: an index structure for high-dimensional nearest neighbor queries , 1997, SIGMOD '97.
[8] Michael E. Houle,et al. Rank-Based Similarity Search: Reducing the Dimensional Dependence , 2015, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[9] Hanan Samet,et al. Foundations of multidimensional and metric data structures , 2006, Morgan Kaufmann series in data management systems.
[10] Christian Böhm,et al. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases , 2001, CSUR.
[11] Longin Jan Latecki,et al. The choice of vantage objects for image retrieval , 2003, Pattern Recognit..
[12] Nimrod Megiddo,et al. Fast indexing method for multidimensional nearest-neighbor search , 1998, Electronic Imaging.
[13] Arthur R. Butz,et al. Alternative Algorithm for Hilbert's Space-Filling Curve , 1971, IEEE Transactions on Computers.
[14] Enrique Vidal,et al. New formulation and improvements of the nearest-neighbour approximating and eliminating search algorithm (AESA) , 1994, Pattern Recognit. Lett..
[15] Piotr Indyk,et al. Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.
[16] Christian Böhm,et al. Independent quantization: an index compression technique for high-dimensional data spaces , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).
[17] Xuemin Lin,et al. SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index , 2014, Proc. VLDB Endow..
[18] Jian Sun,et al. Optimized Product Quantization for Approximate Nearest Neighbor Search , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.
[19] Remco C. Veltkamp,et al. Selecting vantage objects for similarity indexing , 2006, 18th International Conference on Pattern Recognition (ICPR'06).
[20] Pasquale Savino,et al. Approximate similarity search in metric spaces using inverted files , 2008, Infoscale.
[21] Juan Carlos Pérez-Cortes,et al. Approximate Nearest Neighbor Search using a Single Space-filling Curve and Multiple Representations of the Data Points , 2006, 18th International Conference on Pattern Recognition (ICPR'06).
[22] Mario A. López,et al. High dimensional similarity search with space filling curves , 2001, Proceedings 17th International Conference on Data Engineering.
[23] Jun Sakuma,et al. Fast approximate similarity search in extremely high-dimensional data sets , 2005, 21st International Conference on Data Engineering (ICDE'05).
[24] David J. Fleet,et al. Cartesian K-Means , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.
[25] Beng Chin Ooi,et al. Indexing the edges—a simple and yet efficient approach to high-dimensional indexing , 2000, PODS.
[26] Zhe Wang,et al. Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search , 2007, VLDB.
[27] Shipeng Li,et al. Query-driven iterated neighborhood graph search for large scale indexing , 2012, ACM Multimedia.
[28] B. Reilly. Social Choice in the South Seas: Electoral Innovation and the Borda Count in the Pacific Island Countries , 2002 .
[29] Matthieu Cord,et al. High-dimensional descriptor indexing for large multimedia databases , 2008, CIKM '08.
[30] Douglas Comer,et al. Ubiquitous B-Tree , 1979, CSUR.
[31] Jakub Lokoc,et al. Ptolemaic access methods: Challenging the reign of the metric space model , 2013, Inf. Syst..
[32] Pavel Zezula,et al. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces , 1997, VLDB.
[33] Qiang Huang,et al. Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search , 2015, Proc. VLDB Endow..
[34] E. Ruiz. An algorithm for finding nearest neighbours in (approximately) constant average time , 1986 .
[35] Mauricio Marín,et al. Hybrid Index for Metric Space Databases , 2008, ICCS.
[36] John Langford,et al. Cover trees for nearest neighbor , 2006, ICML.
[37] Christos Faloutsos,et al. On packing R-trees , 1993, CIKM '93.
[38] Christopher D. Manning,et al. Introduction to Information Retrieval , 2010, J. Assoc. Inf. Sci. Technol..
[39] Wilfred Ng,et al. Locality-sensitive hashing scheme based on dynamic collision counting , 2012, SIGMOD Conference.
[40] Panos Kalnis,et al. Quality and efficiency in high dimensional nearest neighbor search , 2009, SIGMOD Conference.
[41] Philip M. Long,et al. Performance guarantees for hierarchical clustering , 2002, J. Comput. Syst. Sci..
[42] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[43] Hans-Peter Kriegel,et al. The pyramid-technique: towards breaking the curse of dimensionality , 1998, SIGMOD '98.
[44] Beng Chin Ooi,et al. Indexing the Distance: An Efficient Method to KNN Processing , 2001, VLDB.
[45] Nimrod Megiddo,et al. EFFICIENT NEAREST NEIGHBOR INDEXING BASED ON A COLLECTION OF SPACE FILLING CURVES , 1997 .
[46] Andrew W. Moore,et al. An Investigation of Practical Approximate Nearest Neighbor Algorithms , 2004, NIPS.
[47] Zi Huang,et al. SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search , 2014, Proc. VLDB Endow..
[48] Cordelia Schmid,et al. Product Quantization for Nearest Neighbor Search , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[49] Vladimir Krylov,et al. Approximate nearest neighbor algorithm based on navigable small world graphs , 2014, Inf. Syst..
[50] Richard I. Hartley,et al. Optimised KD-trees for fast image descriptor matching , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.
[51] Peter J. H. King,et al. Using Space-Filling Curves for Multi-dimensional Indexing , 2000, BNCOD.
[52] Luisa Micó,et al. A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements , 1994, Pattern Recognit. Lett..
[53] Robert Krauthgamer,et al. Navigating nets: simple algorithms for proximity search , 2004, SODA '04.
[54] Gang Chen,et al. Efficient metric indexing for similarity search , 2015, 2015 IEEE 31st International Conference on Data Engineering.
[55] Ronald Fagin,et al. Efficient similarity search and classification via rank aggregation , 2003, SIGMOD '03.
[56] Nicole Immorlica,et al. Locality-sensitive hashing scheme based on p-stable distributions , 2004, SCG '04.
[57] Hans-Jörg Schek,et al. A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces , 1998, VLDB.
[58] Masatoshi Yoshikawa,et al. The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation , 2000, VLDB.
[59] Nieves R. Brisaboa,et al. A Dynamic Pivot Selection Technique for Similarity Search , 2008, First International Workshop on Similarity Search and Applications (sisap 2008).
[60] David G. Lowe,et al. Scalable Nearest Neighbor Algorithms for High Dimensional Data , 2014, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[61] Christos Faloutsos,et al. The Omni-family of all-purpose access methods: a simple and effective way to make similarity search more efficient , 2007, The VLDB Journal.
[62] Ramesh C. Jain,et al. Similarity indexing with the SS-tree , 1996, Proceedings of the Twelfth International Conference on Data Engineering.
[63] Tamer Kahveci,et al. Reference-based indexing for metric spaces with costly distance measures , 2008, The VLDB Journal.
[64] Nora Reyes,et al. Similarity Search Using Sparse Pivots for Efficient Multimedia Information Retrieval , 2006, Eighth IEEE International Symposium on Multimedia (ISM'06).
[65] Nieves R. Brisaboa,et al. Spatial Selection of Sparse Pivots for Similarity Search in Metric Spaces , 2007, SOFSEM.