
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
K. Shim, R. Srikant, R. Agrawal, "HighDimensional Similarity Joins," IEEE Transactions on Knowledge and Data Engineering, vol. 14, no. 1, pp. 156171, January/February, 2002.  
BibTex  x  
@article{ 10.1109/69.979979, author = {K. Shim and R. Srikant and R. Agrawal}, title = {HighDimensional Similarity Joins}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {14}, number = {1}, issn = {10414347}, year = {2002}, pages = {156171}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.979979}, 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  HighDimensional Similarity Joins IS  1 SN  10414347 SP156 EP171 EPD  156171 A1  K. Shim, A1  R. Srikant, A1  R. Agrawal, PY  2002 KW  Data mining KW  similar time sequences KW  similarity join VL  14 JA  IEEE Transactions on Knowledge and Data Engineering ER   
Abstract—Many emerging data mining applications require a similarity join between points in a highdimensional domain. We present a new algorithm that utilizes a new index structure, called the
[1] M. Arya, W. Cody, C. Faloutsos, J. Richardson, and A. Toga, “QBISM: A Prototype 3D Medical Image Database System,” IEEE Data Eng. Bull., vol. 16, no. 1, pp. 38–42, Mar. 1993.
[2] R. Agrawal, C. Faloutsos, and A. Swami, “Efficient Similarity Search in Sequence Databases,” Proc. Fourth Int'l Conf. Foundations of Data Organization and Algorithms, pp. 6984, Oct. 1993.
[3] R. Agrawal, K. Lin, H.S. Sawhney, and K. Shim, “Fast Similarity Search in the Presence of Noise, Scaling and Translation in TimeSeries Databases,” Proc. Very Large Data Bases, pp. 490501, Sept. 1995.
[4] J.L. Bentley, "Multidimensional Binary Search Trees Used for Associative Searching," Comm. ACM, vol. 18, no. 9, pp. 509517, 1975.
[5] S. Berchtold, D. Keim, and H.P. Kriegel, “The XTree: An Index Structure for HighDimensional Data,” Proc. 22nd Conf. Very Large Data Bases, pp. 2839, 1996.
[6] N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger, “The R*Tree: An Efficient and Robust Access Method for Points and Rectangles,” Proc. ACM SIGMOD Conf. Management of Data, 1990.
[7] C. Faloutsos and K.I. Lin, “Fastmap: A Fast Algorithm for Indexing, DataMining and Visualization of Traditional and Multimedia Datasets,” Proc. SIGMOD, Int'l Conf. Management of Data, pp. 163174, 1995.
[8] A. Guttman, “RTrees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD Conf. Management of Data, 1984.
[9] H.V. Jagadish, “A Retrieval Technique for Similar Shapes,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 208217, 1991.
[10] K. Lin, H.V. Jagadish, and C. Faloutsos, “The TVTree: An Index Structure for HighDimensional Data,” VLDB J., vol. 3, pp. 517542, 1995.
[11] M. Lo and C.V. Ravishankar, “Spatial Joins Using Seeded Trees,” Proc. 1994 ACM SIGMOD Int'l Conf. Management of Data, pp. 209220, 1994.
[12] D. Lomet and B. Salzberg, "The hBTree: A Multiattribute Indexing Method with Good Guaranteed Performance," ACM Trans. Database Systems. vol. 15, no. 4, pp. 625658, Dec. 1990.
[13] W. Niblack, R. Barber, W. Equitz, M. Flickner, E. Glasman, D. Petkovic, P. Yanker, C. Faloutsos, and G. Taubin, “The QBIC Project: Querying Images by Content Using Color, Texture, and Shape,” Proc. SPIE 1993 Int'l Symp. Electronic Imaging: Science and Technology, Conf. 1908, Storage and Retrieval for Image and Video Databases, 1993.
[14] A.D. Narasimhalu and S. Christodoulakis, “Multimedia Information Systems: The Unfolding of a Reality,” Computer, vol. 24, no. 10, pp. 6–8, 1991.
[15] J. Nievergelt, H. Hinterberger, and K.C. Sevcik, "The Grid File: An Adaptable, Symmetric Multikey File Structure," ACM Trans. Database Systems, vol. 9, no. 1, pp. 3871, Mar. 1984.
[16] J.M. Patel and D.J. DeWitt, “Partition Based SpatialMerge Join,” Proc. ACM SIGMOD, pp. 259270, June 1996.
[17] J.T. Robinson, “The KDBTree: A Search Structure for Large Multidimensional Dynamic Indexes,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 1018, 1981.
[18] H. Samet, The Design and Analysis of Spatial Data Structures. AddisonWesley, 1990.
[19] T. Sellis, N. Roussopoulos, and C. Faloutsos, “The R+Tree: A Dynamic Index for Multidimensional Objects,” Proc. 13th Int'l Conf. Very Large Data Bases (VLDB), 1987.
[20] A.W. Toga, P.K. Banerjee, and E.M. Santori, “Warping 3D Models for Interbrain Comparisons,” Neuroscience Abstract, vol. 16, p. 247, 1990.
[21] D. Vassiliadis, “The InputState Space Approach to the Prediction of Auroral Geomagnetic Activity from Solar Wind Variables,” Proc. Int'l Workshop Applications of Artificial Intelligence in Solar Terrestrial Physics, Sept. 1993.