
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Sharadh Ramaswamy, Kenneth Rose, "Adaptive Cluster Distance Bounding for HighDimensional Indexing," IEEE Transactions on Knowledge and Data Engineering, vol. 23, no. 6, pp. 815830, June, 2011.  
BibTex  x  
@article{ 10.1109/TKDE.2010.59, author = {Sharadh Ramaswamy and Kenneth Rose}, title = {Adaptive Cluster Distance Bounding for HighDimensional Indexing}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {23}, number = {6}, issn = {10414347}, year = {2011}, pages = {815830}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.59}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Adaptive Cluster Distance Bounding for HighDimensional Indexing IS  6 SN  10414347 SP815 EP830 EPD  815830 A1  Sharadh Ramaswamy, A1  Kenneth Rose, PY  2011 KW  Multimedia databases KW  indexing methods KW  similarity measures KW  clustering KW  image databases. VL  23 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] C. Faloutsos, Searching in Multimedia Databases By Content. Kluwer Academic Press, 1996.
[2] K.S. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft, "When is "Nearest Neighbor" Meaningful?," Proc. Int'l Conf. Database Theory (ICDT), pp. 217235, 1999.
[3] C.C. Aggarwal, A. Hinneburg, and D.A. Keim, "On the Surprising Behavior of Distance Metrics in High Dimensional Spaces," Proc. Int'l Conf. Database Theory (ICDT), pp. 420434, 2001.
[4] B.U. Pagel, F. Korn, and C. Faloutsos, "Deflating the Dimensionality Curse Using Multiple Fractal Dimensions," Proc. Int'l Conf. Data Eng. (ICDE), pp. 589598, 2000.
[5] T. Huang and X.S. Zhou, "Image Retrieval with Relevance Feedback: From Heuristic Weight Adjustment to Optimal Learning Methods," Proc. Int'l Conf. Image Processing (ICIP), vol. 3, pp. 25, 2001.
[6] J. Davis, B. Kulis, P. Jain, S. Sra, and I. Dhillon, "InformationTheoretic Metric Learning," Proc. Int'l Conf. Machine Learning (ICML), pp. 209216, 2007.
[7] R. Weber, H. Schek, and S. Blott, "A Quantitative Analysis and Performance Study for SimilaritySearch Methods in HighDimensional Spaces," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 194205, Aug. 1998.
[8] A. Gersho and R.M. Gray, Vector Quantization and Signal Compression. Kluwer Academic Publishers, 1992.
[9] T. Zhang, R. Ramakrishnan, and M. Livny, "BIRCH: An Efficient Data Clustering Method for Very Large Databases," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 103114, 1996.
[10] N. Katayama and S. Satoh, "The SRTree: An Index Structure for HighDimensional Nearest Neighbor Queries," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 369380, May 1997.
[11] D.A. White and R. Jain, "Similarity Indexing with the SSTree," Proc. Int'l Conf. Data Eng. (ICDE), pp. 516523, 1996.
[12] N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger, "The ${\rm R}^\ast$ Tree: An Efficient and Robust Access Method for Points and Rectangles," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 322331, 1990.
[13] Y. Sakurai, M. Yoshikawa, S. Uemura, and H. Kojima, "The ATree: An Index Structure for HighDimensional Spaces Using Relative Approximation," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 516526, Sept. 2000.
[14] S. Berchtold, C. Bohm, H.V. Jagadish, H.P. Kriegel, and J. Sander, "Independent Quantization: An Index Compression Technique for HighDimensional Data Spaces," Proc. Int'l Conf. Data Eng. (ICDE), pp. 577588, 2000.
[15] C. Yu, B.C. Ooi, K.L. Tan, and H.V. Jagadish, "Indexing the Distance: An Efficient Method to KNN Processing," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 421430, Sept. 2001.
[16] Y. Ishikawa, R. Subramanya, and C. Faloutsos, "Mindreader: Querying Databases through Multiple Examples," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 218227, Aug. 1998.
[17] Y. Rui and T. Huang, "Optimizing Learning in Image Retrieval," Computer Vision and Pattern Recognition, vol. 1, pp. 12361243, 2000.
[18] S. Ramaswamy and K. Rose, "Adaptive ClusterDistance Bounding for Similarity Search in Image Databases," Proc. Int'l Conf. Image Processing (ICIP), vol. 6, pp. 381384, 2007.
[19] N. Koudas, B.C. Ooi, H.T. Shen, and A.K.H. Tung, "LDC: Enabling Search by Partial Distance in a HyperDimensional Space," Proc. Int'l Conf. Data Eng. (ICDE), pp. 617, 2004.
[20] A. Guttman, "RTrees: A Dynamic Index Structure for Spatial Searching," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 4757, 1984.
[21] P. Ciaccia, M. Patella, and P. Zezula, "MTree: An Efficient Access Method for Similarity Search in Metric Spaces," Proc. Int'l Conf. Very Large Databases (VLDB), pp. 426435, 1997.
[22] R. Bellman, Adaptive Control Processes: A Guided Tour. Princeton Univ. Press, 1961.
[23] H. Ferhatosmanoglu, E. Tuncel, D. Agrawal, and A.E. Abbadi, "Vector Approximation Based Indexing for NonUniform High Dimensional Data Sets," Proc. Int'l Conf. Information and Knowledge Management (CIKM), pp. 202209, 2000.
[24] K. Chakrabarti and S. Mehrotra, "Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces," Proc. Int'l Conf. Very Large Databases (VLDB), pp. 89100, Sept. 2000.
[25] K. Vu, K. Hua, H. Cheng, and S. Lang, "A NonLinear DimensionalityReduction Technique for Fast Similarity Search in Large Databases," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 527538, 2006.
[26] S. Berchtold, C. Bohm, and H. Kriegel, "The PyramidTechnique: Towards Breaking the Curse of Dimensionality," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 142153, 1998.
[27] H. Jin, B.C. Ooi, H.T. Shen, C. Yu, and A. Zhou, "An Adaptive and Efficient Dimensionality Reduction Algorithm for HighDimensional Indexing," Proc. Int'l Conf. Data Eng. (ICDE), pp. 8798, Mar. 2003.
[28] P. Ciaccia and M. Patella, "PAC Nearest Neighbor Queries: Approximate and Controlled Search in HighDimensional and Metric Spaces," Proc. Int'l Conf. Data Eng. (ICDE), pp. 244255, 2000.
[29] R. Weber and K. Böhm, "Trading Quality for Time with Nearest Neighbor Search," Proc. Seventh Int'l Conf. Extending Database Technology (EDBT): Advances in Database Technology, pp. 2135, 2000.
[30] E. Tuncel, H. Ferhatosmanoglu, and K. Rose, "VQIndex: An Index Structure for Similarity Searching in Multimedia Databases," Proc. ACM Int'l Conf. Multimedia, pp. 543552, 2002.
[31] E. Tuncel and K. Rose, "Towards Optimal Clustering for Approximate Similarity Searching," Proc. IEEE Int'l Conf. Multimedia and Expo (ICME), vol. 2, pp. 497500, Aug. 2002.
[32] H. Ferhatosmanoglu, E. Tuncel, D. Agrawal, and A.E. Abbadi, "Approximate Nearest Neighbor Searching in Multimedia Databases," Proc. Int'l Conf. Data Eng. (ICDE), pp. 503511, Apr. 2001.
[33] A. Gionis, P. Indyk, and R. Motwani, "Similarity Search in High Dimensions via Hashing," Proc. Int'l Conf. Very Large Databases (VLDB), pp. 518529, Sept. 1999.
[34] P. Ciaccia and M. Patella, "Approximate Similarity Queries: A Survey," Technical Report CSITE0801, May 2001.
[35] E. Tuncel, P. Koulgi, and K. Rose, "RateDistortion Approach to Databases: Storage and ContentBased Retrieval," IEEE Trans. Information Theory, vol. 50, no. 6, pp. 953967, June 2004.
[36] R.O. Duda and P.E. Hart, Pattern Classification and Scene Analysis. John Wiley & Sons, 1996.