
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Fabrizio Angiulli, Fabio Fassetti, "Indexing Uncertain Data in General Metric Spaces," IEEE Transactions on Knowledge and Data Engineering, vol. 24, no. 9, pp. 16401657, Sept., 2012.  
BibTex  x  
@article{ 10.1109/TKDE.2011.93, author = {Fabrizio Angiulli and Fabio Fassetti}, title = {Indexing Uncertain Data in General Metric Spaces}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {24}, number = {9}, issn = {10414347}, year = {2012}, pages = {16401657}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2011.93}, 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  Indexing Uncertain Data in General Metric Spaces IS  9 SN  10414347 SP1640 EP1657 EPD  16401657 A1  Fabrizio Angiulli, A1  Fabio Fassetti, PY  2012 KW  uncertain data KW  Indexing KW  metric spaces VL  24 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] R. Cheng, Y. Xia, S. Prabhakar, R. Shah, and J.S. Vitter, "Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data," Proc. 13th Int'l Conf. Very Large Data Bases (VLDB '04), pp. 876887, 2004.
[2] Y. Tao, R. Cheng, X. Xiao, W.K. Ngai, B. Kao, and S. Prabhakar, "Indexing MultiDimensional Uncertain Data with Arbitrary Probability Density Functions," Proc. 31st Int'l Conf. Very Large Data Bases (VLDB '05), pp. 922933, 2005.
[3] T. Green and V. Tannen, "Models for Incomplete and Probabilistic Information," IEEE Data Eng. Bull., vol. 29, no. 1, pp. 1724, 2006.
[4] Y. Tao, X. Xiao, and R. Cheng, "Range Search on Multidimensional Uncertain Data," ACM Trans. Database Systems, vol. 32, no. 3, pp. 154, 2007.
[5] C. Aggarwal and P. Yu, "A Survey of Uncertain Data Algorithms and Applications," IEEE Trans. Knowledge Data Eng., vol. 21, no. 5, pp. 609623, May 2009.
[6] P.K. Agarwal, S.W. Cheng, Y. Tao, and K. Yi, "Indexing Uncertain Data," Proc. 28th ACM SIGMODSIGACTSIGART Symp. Principles of Database Systems (PODS '09), pp. 137146, 2009.
[7] C.C. Aggarwal, Managing and Mining Uncertain Data, ser. Advances in Database Systems, Springer, vol. 35, 2009.
[8] E. Chávez, G. Navarro, R. BaezaYates, and J. Marroquín, "Searching in Metric Spaces," ACM Computing Surveys, vol. 33, no. 3, pp. 273321, 2001.
[9] H. Samet, Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling). Morgan Kaufmann Publishers, Inc., 2005.
[10] P. Zezula, G. Amato, V. Dohnal, and M. Batko, Similarity Search: The Metric Space Approach, ser. Advances in Database Systems. Springer, vol. 32, 2006.
[11] V. Levenshtein, "Binary Codes Capable of Correcting Deletions, Insertions, and Reversals," Soviet Physics Doklady, vol. 10, pp. 707710, 1966.
[12] 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, pp. 295309, 2006.
[13] M. Chau, R. Cheng, B. Kao, and J. Ng, "Uncertain Data Mining: An Example in Clustering Location Data," Proc. 10th PacificAsia Conf. Knowledge Discovery and Data Mining (PAKDD '06), pp. 199204, 2006.
[14] S. Łukaszyk, "A New Concept of Probability Metric and its Applications in Approximation of Scattered Data Sets," Computational Mechanics, vol. 33, no. 4, pp. 299304, 2004.
[15] W. Ngai, B. Kao, C. Chui, R. Cheng, M. Chau, and K. Yip, "Efficient Clustering of Uncertain Data," Proc. Int'l Conf. Data Mining, pp. 436445, 2006.
[16] S. Singh, C. Mayfield, S. Prabhakar, R. Shah, and S. Hambrusch, "Indexing Uncertain Categorical Data," Proc. IEEE 23rd Int'l Conf. Data Eng. (ICDE), pp. 616625, Apr. 2007.
[17] Y. Zhang, X. Lin, W. Zhang, J. Wang, and Q. Lin, "Effectively Indexing the Uncertain Space," IEEE Trans. Knowledge Data Eng., vol. 22, no. 9, pp. 12471261, Sept. 2010.
[18] J. Bentley, "Multidimensional Binary Search Trees Used for Associative Searching," Comm. ACM, vol. 18, pp. 509517, 1975.
[19] 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 Int'l Conf. Management of Data (SIGMOD '90), pp. 322331, 1990.
[20] S. Berchtold, D. Keim, and H.P. Kriegel, "The Xtree: An Index Structure for HighDimensional Data," Proc. 22th Int'l Conf. Very Large Data Bases (VLDB '96), pp. 2839, 1996.
[21] P.N. Yianilos, "Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces," Proc. ACMSIAM Symp. Discrete Algorithms (SODA '93), pp. 311321, 1993.
[22] L. Micó, J. Oncina, and E. Vidal, "A New Version of the NearestNeighbour Approximating and Eliminating Search Algorithm (Aesa) with Linear Preprocessing Time and Memory Requirements," Pattern Recognition Letters, vol. 15, no. 1, pp. 917, 1994.
[23] E. Chávez, J.L. Marroquín, and R.A. BaezaYates, "Spaghettis: An Array Based Algorithm for Similarity Queries in Metric Spaces," Proc. Symp. String Processing and Information Retrieval (SPIRE), pp. 3846, 1999.
[24] B. Bustos, G. Navarro, and E. Chávez, "Pivot Selection Techniques for Proximity Searching in Metric Spaces," Pattern Recognition Letters, vol. 24, no. 14, pp. 23572366, 2003.
[25] B. Bustos, O. Pedreira, and N.R. Brisaboa, "A Dynamic Pivot Selection Technique for Similarity Search," Proc. IEEE 24th Int'l Conf. Data Eng. Workshop (ICDEW), pp. 394401, 2008.
[26] L. Ares, N. Brisaboa, M. Esteller, O. Pedreira, and A. Places, "Optimal Pivots to Minimize the Index Size for Metric Access Methods," Proc. Int'l Workshop Similarity Search and Applications (SISAP), pp. 7480, 2009.
[27] J.F. Traub, G.W. Wasilkowski, and H. Woźniakowski, InformationBased Complexity. Academic Press Professional, Inc., 1988.
[28] N. Metropolis and S. Ulam, "The Monte Carlo Method," J. Am. Statistical Assoc., vol. 44, no. 247, pp. 335341, 1949.
[29] P. Davis and P. Rabinowitz, Methods of Numerical Integration. Dover, 1984.
[30] A. Frank and A. Asuncion, "UCI Machine Learning Repository," http://archive.ics.uci.eduml, 2010.
[31] R. Finn, J. Mistry, J. Tate, P. Coggill, A. Heger, J. Pollington, O. Gavin, P. Gunesekaran, G. Ceric, K. Forslund, L. Holm, E. Sonnhammer, S. Eddy, and A. Bateman, "The Pfam Protein Families Database," Nucleic Acids Research, vol. 38, no. Database Issue, pp. D211D222, 2010.
[32] F.J. Hickernell and H. Wozniakowski, "Integration and Approximation in Arbitrary Dimensions," Advances in Computational Math., vol. 12, no. 1, pp. 2558, 2000.
[33] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness. W. H. Freeman, 1979.
[34] W. Hoeffding, "Probability Inequalities for Sums of Bounded Random Variables," J. Am. Statistical Assoc., vol. 58, no. 301, pp. 1330, 1963.