References
- Y. Rui et al., 'Relevance Feedback: A Power Tool for Interactive Content-Based Image Retrieval,' IEEE Trans. Circuits and Video Technology, 8(5), 644-655, 1998 https://doi.org/10.1109/76.718510
- K.S. Beyer et al., 'When is nearest neighbor meaningful?' Proc. ICDT, 217-235, 1999 https://doi.org/10.1007/3-540-49257-7_15
- A. Hinneburg, C.C. Aggarwal, and D.A. Keim, 'What is the nearest neighbor in high dimensional spaces?,' Proc. VLDB, 506-515, 2000
- C.C. Aggarwal and P.S. Yu, 'The IGrid Index: Reversing the Dimensionality Curse for Similarity Indexing in High Dimensional Space,' Proc. ACM SIGKDD, 119-129, 2000
- K. Bohm, M. Mlivoncic, H.-J. Schek, and R. Weber, 'Fast Evaluation Techniques for Complex Similarity Queries,' Proc. VLDB, 211-220, 2001
- R. Fagin, 'Combining Fuzzy Information from Multiple Systems,' Proc. ACM PODS, 216-226, 1996 https://doi.org/10.1145/237661.237715
- G.-H. Cha and C.-W. Chung, 'Object-Oriented Retrieval Mechanism for Semistructured Image Collections,' Proc. ACM Multimedia, 323-332, 1998 https://doi.org/10.1145/290747.290795
- R. Weber, H.-J. Schek, and S. Blott, 'A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces,' Proc. VLDB, 194-205, 1998
- K. Chakrabarti and S. Mehrotra, 'Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces,' Proc. VLDB, 89-100, 2000
- K.V.R. Kanth, D. Agrawal, and A. Singh, A., 'Dimensionality Reduction for Similarity Searching in Dynamic Databases,' Proc. ACM SIGMOD, 166-176, 1998 https://doi.org/10.1145/276304.276320
- S. Arya et al, 'An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions,' JACM, 45(6),. 891-923, Nov. 1998 https://doi.org/10.1145/293347.293348
- P. Indyk and R. Motwani, 'Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality,' Proc. ACM STOC, 604-613, 1998 https://doi.org/10.1145/276698.276876
- E. Kushilevitz, R. Ostrovsky, and Y. Rabani, 'Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces,' Proc. ACM STOC, 614-623, 1998 https://doi.org/10.1145/276698.276877
- W.-C. Lai, C. Chang, E. Chang, K.-T. Cheng, and M. Crandell, 'PBIR-MM: Multimodal Image Retrieval and Annotation,' Proc. ACM Multimedia, 421-422, 2002
- S. Berchtold, D.A. Keim, and H.-P. Kriegel, 'The X-tree: An index structure for high-dimensional data,' Proc. VLDB, 28-39, 1996
- D. White and R. Jain, 'Similarity indexing with the SS-tree,' Proc. ICDE, pp. 516-523, 1996
- G.-H. Cha, X. Zhu, D. Petkovic, and C.-W. Chung, 'An Efficient Indexing Method for Nearest Neighbor Searches in High-Dimensional Image Databases,' IEEE Trans. on Multimedia, 4(1), 76-87, March 2002 https://doi.org/10.1109/6046.985556
- G. H. Cha and C. W. Chung, 'The GC-Tree : A High-Dimensional Index Structure for Similarity Search in Image Databases IEEE Transactions on Multimedia, Vol.4, No.2, pp.235-247, 2002 https://doi.org/10.1109/TMM.2002.1017736
- E. Tuncel, H. Ferhatosmanoglu, and K. Rose, 'VQ-index: an index structure for similarity searching in multimedia databases,' Pro. the 10th ACM International Conference on Multimedia, pp.543-552, 2002 https://doi.org/10.1145/641007.641117
- J. MacQueen, 'Some methods for classification and analysis of multivariate observations,' Proc. 5th Berkeley Symp. Math. Statist, Prob., 1:281-297, 1967
- R. Agrawal, J. Gehrke, D. Gunopulos, P. Raghavan, 'Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications,' Proc. ACM SIGMOD, 94-105, 1998 https://doi.org/10.1145/276304.276314
- S. Berchtold, C. Boehm, D.A. Keim, and H.-P. Kriegel, 'A Cost Model for Nearest Neighbor Search in High-Dimensional Data Space,' Proc. ACM PODS, 78-86, 1997 https://doi.org/10.1145/263661.263671
- L. Wu, C. Faloutsos, K. Sycara, and T.R. Payne, 'FALCON: Feedback Adaptive Loop for Content-Based Retrieval,' Proc. VLDB Conf., 297-306, 2000
- P. O'Neil and D.Quass, 'Improved Query Performance with Variant Indexes.' In Proceeding of the ACM SIGMOD International Conference on Management of Data, 1997 https://doi.org/10.1145/253260.253268