
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Xiang Lian, Lei Chen, "Subspace Similarity Search under {\rm L}_pNorm," IEEE Transactions on Knowledge and Data Engineering, vol. 24, no. 2, pp. 365382, February, 2012.  
BibTex  x  
@article{ 10.1109/TKDE.2010.219, author = {Xiang Lian and Lei Chen}, title = {Subspace Similarity Search under {\rm L}_pNorm}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {24}, number = {2}, issn = {10414347}, year = {2012}, pages = {365382}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.219}, 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  Subspace Similarity Search under {\rm L}_pNorm IS  2 SN  10414347 SP365 EP382 EPD  365382 A1  Xiang Lian, A1  Lei Chen, PY  2012 KW  Subspace similarity search KW  L_pnorm KW  triangle inequality. VL  24 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] "Data Warehousing and OLAP: A ResearchOriented Bibliography," http://www.ondelette.com/OLAPdwbib.html, 2011.
[2] R. Agrawal, C. Faloutsos, and A.N. Swami, "Efficient Similarity Search in Sequence Databases," Proc. Int'l Conf. Foundations of Data Organization and Algorithms, 1993.
[3] R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan, "Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications," SIGMOD Record, vol. 27, no. 2, pp. 94105, 1998.
[4] R. Basri, T. Hassner, and L. ZelnikManor, "A General Framework for Approximate Nearest Subspace Search," Technical Report CCIT #699, Dept. of Electrical Eng., Technion, 2008.
[5] S. Berchtold, C. Böhm, and H.P. Kriegel, "The PyramidTechnique: Towards Breaking the Curse of Dimensionality," Proc. ACM SIGMOD Int'l Conf. Management of Data, 1998.
[6] S. Berchtold, D.A. Keim, and H.P. Kriegel, "The XTree: An Index Structure for HighDimensional Data," Proc. 22nd Int'l Conf. Very Large Data Bases (VLDB), 1996.
[7] T. Bozkaya and M. Ozsoyoglu, "DistanceBased Indexing for HighDimensional Metric Spaces," Proc. ACM SIGMOD Int'l Conf. Management of Data, 1997.
[8] C. TrainaJr., R.F. Filho, A.J. Traina, M.R. Vieira, and C. Faloutsos, "The OmniFamily of AllPurpose Access Methods: A Simple and Effective Way to Make Similarity Search More Efficient," The Int'l J. Very Large Data Bases, vol. 16, no. 4, pp. 483505, 2007.
[9] K.P. Chan and A.WC Fu, "Efficient Time Series Matching by Wavelets," Proc. 15th Int'l Conf. Data Eng. (ICDE), 1999.
[10] E. Chaváez, G. Navarro, R. BaezaYates, and J.L. Marroquń, "Searching in Metric Spaces," ACM Computing Surveys, vol. 33, no. 3, pp. 273321, 2001.
[11] R. Cheng, D.V. Kalashnikov, and S. Prabhakar, "Evaluating Probabilistic Queries over Imprecise Data," Proc. ACM SIGMOD Int'l Conf. Management of Data, 2003.
[12] A. Faradjian, J. Gehrke, and P. Bonnet, "GADT: A Probability Space ADT for Representing and Querying the Physical World," Proc. 18th Int'l Conf. Data Eng. (ICDE), 2002.
[13] Y. Gao, B. Zheng, G. Chen, W.C. Lee, K.C.K. Lee, and Q. Li, "Visible Reverse KNearest Neighbor Query Processing in Spatial Databases," IEEE Trans. Knowledge and Data Eng., vol. 21, no. 9, pp. 13141327, Sept. 2009.
[14] KS. Goh, B.T. Li, and Ed. Chang, "Dyndex: A Dynamic and NonMetric Space Indexer," Proc. 10th ACM Int'l Conf. Multimedia, 2002.
[15] C.M. Grinstead and J.L. Snell, Introduction to Probability. Am. Math. Soc., 1997.
[16] A. Guttman, "RTrees: A Dynamic Index Structure for Spatial Searching," Proc. ACM SIGMOD Int'l Conf. Management of Data, 1984.
[17] I. Guyon and A. Elisseeff, "An Introduction to Variable and Feature Selection," J. Machine Learning Research, vol. 3, pp. 11571182, 2003.
[18] X. He, "Incremental SemiSupervised Subspace Learning for Image Retrieval," Proc. 13rd ACM Int'l Conf. Multimedia, 2005.
[19] X. He, D. Cai, and P. Niyogi, "Tensor Subspace Analysis," Proc. Nineth Ann. Conf. Neural Information Processing Systems (NIPS), 2005.
[20] H.V. Jagadish, B.C. Ooi, K.L. Tan, C. Yu, and R. Zhang, "Idistance: An Adaptive ${\rm b}^+$ Tree Based Indexing Method for Nearest Neighbor Search," ACM Trans. Database Systems, vol. 30, no. 2, pp. 364397, 2005.
[21] G. JovanovicDolecek, "Demo Program for Central Limit Theorem," Proc. 40th Midwest Symp. Circuits and Systems, 1997.
[22] Y. Ke, R. Sukthankar, and L. Huston, "An Efficient PartsBased NearDuplicate and SubImage Retrieval System," Proc. 12th ACM Int'l Conf. Multimedia, 2004.
[23] R. Kohavi and D. Sommerfield, "Feature Subset Selection Using the Wrapper Model: Overfitting and Dynamic Search Space Topology," Proc. Int'l Conf. Knowledge Discovery and Data Mining, 1995.
[24] F. Korn, H. Jagadish, and C. Faloutsos, "Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences," Proc. ACM SIGMOD Int'l Conf. Management of Data, 1997.
[25] M. Koskela, J. Laaksonen, and E. Oja, "Use of Image Subset Features in Image Retrieval with SelfOrganizing Maps," Proc. Conf. Image and Video Retrieval, 2004.
[26] H.P. Kriegel, P. Kroger, M. Schubert, and Z. Zhu, "Efficient Query Processing in Arbitrary Subspaces Using Vector Approximations," Proc. Int'l Conf. Scientific and Statistical Database Management (SSDBM), 2006.
[27] H.P. Kriegel, P. Kunath, M. Pfeifle, and M. Renz, "Probabilistic Similarity Join on Uncertain Data," Proc. Int'l Conf. Database Systems for Advanced Applications (DASFAA), 2006.
[28] F. Li, J. Sun, S. Papadimitriou, G.A. Mihaila, and I. Stanoi, "Hiding in the Crowd: Privacy Preservation on Evolving Streams through Correlation Tracking," Proc. 23rd Int'l Conf. Data Eng. (ICDE), 2007.
[29] M. Li, Y. He, Y. Liu, J. Zhao, S. Tang, X.Y. Li, and G. Dai, "Canopy Closure Estimates with Greenorbs: Sustainable Sensing in the Forest," Proc. Seventh ACM Conf. Embedded Networked Sensor Systems (Sensys '09), http:/greenorbs.org, 2009.
[30] X. Lian and L. Chen, "Similarity Search in Arbitrary Subspaces under ${\rm L}_p$ norm," Proc. 24th Int'l Conf. Data Eng. (ICDE), 2008.
[31] V. Ljosa and A.K. Singh, "APLA: Indexing Arbitrary Probability Distributions," Proc. 23rd Int'l Conf. Data Eng. (ICDE), 2007.
[32] D.G. Lowe, "Distinctive Image Features from ScaleInvariant Keypoints," Int'l J. Computer Vision, vol. 60, no. 2, pp. 91110, 2004.
[33] E. Müller, S. Günnemann, I. Assent, and T. Seidl, "Evaluating Clustering in Subspace Projections of High Dimensional Data," J. Very Large Data Bases Endowment, vol. 2, no. 1, pp. 12701281, 2009.
[34] R.T. Ng and J. Han, "Efficient and Effective Clustering Methods for Spatial Data Mining," Proc. 20th Int'l Conf. Very Large Data Bases (VLDB), 1994.
[35] 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. Fifth Int'l Symp. Storage and Retrieval for Image and Video Databases, 1993.
[36] S. Papadimitriou, F. Li, G. Kollios, and P.S. Yu, "Time Series Compressibility and Privacy," Proc. 33rd Int'l Conf. Very Large Data Bases (VLDB), 2007.
[37] J. Pei, B. Jiang, X. Lin, and Y. Yuan, "Probabilistic Skylines on Uncertain Data," Proc. 33rd Int'l Conf. Very Large Data Bases (VLDB), 2007.
[38] H. Samet, Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann, 2006.
[39] T. Skopal and P. Zezula, Second Int'l Workshop Similarity Search and Applications (SISAP), IEEE CS, 2009.
[40] M.A. Soliman, I.F. Ilyas, and K.C. Chang, "Top$k$ Query Processing in Uncertain Databases," Proc. 23rd Int'l Conf. Data Eng. (ICDE), 2007.
[41] Y. Tao, R. Cheng, X. Xiao, W.K. Ngai, B.K., and S. Prabhakar, "Indexing MultiDimensional Uncertain Data with Arbitrary Probability Density Functions," Proc. 31st Int'l Conf. Very Large Data Bases (VLDB), 2005.
[42] A.P. Vries, N. Mamoulis, N. Nes, and M. Kersten, "Efficient $k$ nn Search on Vertically Decomposed Data," Proc. ACM SIGMOD Int'l Conf. Management of Data, 2002.
[43] H. Wang, F. Chu, W. Fan, P.S. Yu, and J. Pei, "A Fast Algorithm for Subspace Clustering by Pattern Similarity," Proc. Int'l Conf. Scientific and Statistical Database Management (SSDBM), 2004.
[44] E.W. Weisstein, "Central Limit Theorem," http://mathworld. wolfram.comCentralLimitTheorem.html , 2011.
[45] M.L. Yiu and N. Mamoulis, "Reverse Nearest Neighbors Search in AdHoc Subspaces," Proc. 22nd Int'l Conf. Data Eng., p. 76, 2006.
[46] M.L. Yiu, N. Mamoulis, X. Dai, Y. Tao, and M. Vaitis, "Efficient Evaluation of Probabilistic Advanced Spatial Queries on Existentially Uncertain Data," IEEE Trans. Knowl. Data Eng., vol. 21, no. 1, pp. 108122, Jan. 2009.
[47] P. Zezula, G. Amato, V. Dohnal, and M. Batko, Similarity Search  the Metric Space Approach. Springer, 2006.