
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Lei Chen, Xiang Lian, "Efficient Similarity Search in Nonmetric Spaces with Local Constant Embedding," IEEE Transactions on Knowledge and Data Engineering, vol. 20, no. 3, pp. 321336, March, 2008.  
BibTex  x  
@article{ 10.1109/TKDE.2007.190700, author = {Lei Chen and Xiang Lian}, title = {Efficient Similarity Search in Nonmetric Spaces with Local Constant Embedding}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {20}, number = {3}, issn = {10414347}, year = {2008}, pages = {321336}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2007.190700}, 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  Efficient Similarity Search in Nonmetric Spaces with Local Constant Embedding IS  3 SN  10414347 SP321 EP336 EPD  321336 A1  Lei Chen, A1  Xiang Lian, PY  2008 KW  Multimedia databases KW  Query processing VL  20 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] Wikipeadia, http://en.wikipedia.org/wikiChisquare_test , 2007.
[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 (FODO), 1993.
[3] V. Athitsos, M. Hadjieleftheriou, G. Kollios, and S. Sclaroff, “QuerySensitive Embeddings,” Proc. ACM SIGMOD, 2005.
[4] D.J. Berndt and J. Clifford, “Finding Patterns in Time Series: A Dynamic Programming Approach,” Advances in Knowledge Discovery and Data Mining, 1996.
[5] J.S. Boreczky and L.A. Rowe, “Comparison of Video Shot Boundary Detection Techniques,” Proc. Int'l Symp. Storage and Retrieval for Image and Video Databases, 1996.
[6] T. Bozkaya and M. Ozsoyoglu, “Indexing Large Metric Spaces for Similarity Search Queries,” ACM Trans. Database Systems, vol. 24, no. 3, pp. 361404, 1999.
[7] T. Bozkaya, N. Yazdani, and Z.M. Ozsoyoglu, “Matching and Indexing Sequences of Different Lengths,” Proc. Sixth Int'l Conf. Information and Knowledge Management (CIKM), 1997.
[8] B. Bustos, G. Navarro, and E. Chávez, “Pivot Selection Techniques for Proximity Searching in Metric Spaces,” Pattern Recognition Letters, 2003.
[9] E. Chávez, G. Navarro, R. BaezaYates, and J.L. Marroquín, “Searching in Metric Spaces,” ACM Computing Surveys, 2001.
[10] L. Chen and R. Ng, “On the Marriage of Edit Distance and $L_{p}$ Norms,” Proc. 30th Int'l Conf. Very Large Data Bases (VLDB), 2004.
[11] L. Chen, M.T. Özsu, and V. Oria, “Robust and Fast Similarity Search for Moving Object Trajectories,” Proc. ACM SIGMOD, 2005.
[12] P. Ciaccia, M. Patella, and P. Zezula, “MTree: An Efficient Access Method for Similarity Search in Metric Spaces,” Proc. 23rd Int'l Conf. Very Large Data Bases (VLDB), 1997.
[13] G. Das, D. Gunopulos, and H. Mannila, “Finding Similar Time Series,” Proc. First European Symp. Principles of Data Mining and Knowledge Discovery (PKDD), 1997.
[14] C. Faloutsos and K.I. Lin, “FastMap: A Fast Algorithm for Indexing, Data Mining and Visualization of Traditional and Multimedia Datasets,” Proc. ACM SIGMOD, 1995.
[15] C. Faloutsos, M. Ranganathan, and Y. Manolopoulos, “Fast Subsequence Matching in TimeSeries Databases,” Proc. ACM SIGMOD, 1994.
[16] C. Faloutsos and S. Roseman, “Fractals for Secondary Key Retrieval,” Proc. Eighth ACM Symp. Principles of Database Systems (PODS), 1989.
[17] R.F.S. Filho, A.J.M. Traina, C. Faloutsos, “Similarity Search without Tears: The OMNI Family of AllPurpose Access Methods,” Proc. 17th Int'l Conf. Data Eng. (ICDE), 2001.
[18] V. Ganti, R. Ramakrishnan, J. Gehrke, A.L. Powell, and J.C. French, “Clustering Large Datasets in Arbitrary Metric Spaces,” Proc. 15th Int'l Conf. Data Eng. (ICDE), 1999.
[19] KS. Goh, B.T. Li, and E. Chang, “Dyndex: A Dynamic and NonMetric Space Indexer,” Proc. 10th ACM Int'l Conf. Multimedia (Multimedia), 2002.
[20] G.R. Hjaltason and H. Samet, “Properties of Embedding Methods for Similarity Searching in Metric Spaces,” IEEE Trans. Pattern Analysis and Machine Intelligence, 2003.
[21] G. Hristescu and M. FarachColton, “ClusterPreserving Embedding of Proteins,” technical report, Center for Discrete Math. and Theoretical Computer Science, 1999.
[22] D.P. Huttenlocher, G.A. Klanderman, and W.A. Rucklidge, “Comparing Images Using the Hausdorff Distance,” IEEE Trans. Pattern Analysis and Machine Intelligence, 1993.
[23] D.W. Jacobs, D. Weinshall, and Y. Gdalyahu, “Classification with Nonmetric Distances: Image Retrieval and Class Representation,” IEEE Trans. Pattern Analysis and Machine Intelligence, 2000.
[24] H.V. Jagadish, B.C. Ooi, K.L. Tan, C. Yu, and R. Zhang, “iDistance: An Adaptive ${\rm B}^{+}\hbox{}{\rm Tree}$ Based Indexing Method for Nearest Neighbor Search,” ACM Trans. Database Systems, vol. 30, no. 2, pp. 364397, 2005.
[25] E. Keogh, “Exact Indexing of Dynamic Time Warping,” Proc. 28th Int'l Conf. Very Large Data Bases (VLDB), 2002.
[26] S. Kim, S. Park, and W. Chu, “An IndexedBased Approach for Similarity Search Supporting Time Warping in Large Sequence Databases,” Proc. 17th Int'l Conf. Data Eng. (ICDE), 2001.
[27] V. Roth, J. Laub, J. Buhmann, and K.R. Muller, “Going Metric: Denoising Pairwise Data,” Proc. Int'l Conf. Neural Information Processing Systems (NIPS), 2002.
[28] H. Samet, Foundations of Multidimensional and Metric Data Structures. AddisonWesley, 2006.
[29] R. Schapire and Y. Singer, “Improved Boosting Algorithms Using ConfidenceRated Predictions,” Machine Learning, 1999.
[30] T. Seidl and H. Kriegel, “Optimal MultiStep $k{\hbox{}}{\rm Nearest}$ Neighbor Search,” Proc. ACM SIGMOD, 1998.
[31] T. Skopal, “On Fast NonMetric Similarity Search by Metric Access Methods,” Proc. 10th Int'l Conf. Extending Database Technology (EDBT), 2006.
[32] C. Traina Jr., A.J.M. Traina, B. Seeger, and C. Faloutsos, “SlimTrees: HighPerformance Metric Trees Minimizing Overlap between Nodes,” Proc. Fourth Int'l Conf. Extending Database Technology (EDBT), 2000.
[33] A. Tversky, “Features of Similarity,” Psychological Rev., 1977.
[34] M. Vlachos, G. Kollios, and D. Gunopulos, “Discovering Similar Multidimensional Trajectories,” Proc. 18th Int'l Conf. Data Eng. (ICDE), 2002.
[35] C.Z. Wang and X. Wang, “Supporting ContentBased Searches on Time Series via Approximation,” Proc. 12th Int'l Conf. Scientific and Statistical Database Management (SSDBM), 2000.
[36] X. Wang, J. Wang, K. Lin, D. Shasha, B. Shapiro, and K. Zhang, “An Index Structure for Data Mining and Clustering,” Knowledge and Information Systems, vol. 2, no. 2, pp. 161184, 2000.
[37] B.K. Yi and C. Faloutsos, “Fast Time Sequence Indexing for Arbitrary $L_{p}$ Norms,” Proc. 26th Int'l Conf. Very Large Data Bases (VLDB), 2000.
[38] B.K. Yi, H. Jagadish, and C. Faloutsos, “Efficient Retrieval of Similar Time Sequences under Time Warping,” Proc. 14th Int'l Conf. Data Eng. (ICDE), 1998.
[39] P. Zezula, G. Amato, V. Dohnal, and M. Batko, Similarity Search—The Metric Space Approach. Springer, 2006.