
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Fabrizio Angiulli, Clara Pizzuti, "Outlier Mining in Large HighDimensional Data Sets," IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 2, pp. 203215, February, 2005.  
BibTex  x  
@article{ 10.1109/TKDE.2005.31, author = {Fabrizio Angiulli and Clara Pizzuti}, title = {Outlier Mining in Large HighDimensional Data Sets}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {17}, number = {2}, issn = {10414347}, year = {2005}, pages = {203215}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2005.31}, 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  Outlier Mining in Large HighDimensional Data Sets IS  2 SN  10414347 SP203 EP215 EPD  203215 A1  Fabrizio Angiulli, A1  Clara Pizzuti, PY  2005 KW  Outlier mining KW  spacefilling curves. VL  17 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] C.C. Aggarwal and P.S. Yu, “Outlier Detection for High Dimensional Data,” Proc. ACM Int'l Conf. Managment of Data (SIGMOD '01), pp. 3746, 2001.
[2] F. Angiulli and C. Pizzuti, “Fast Outlier Detection in High Dimensional Spaces,” Proc. Int'l Conf. Principles of Data Mining and Knowledge Discovery (PKDD '02), pp. 1526, 2002.
[3] A. Arning, R. Aggarwal, and P. Raghavan, “A Linear Method for Deviation Detection in Large Databases,” Proc. Int'l Conf. Knowledge Discovery and Data Mining (KDD '96), pp. 164169, 1996.
[4] V. Barnett and T. Lewis, Outliers in Statistical Data. John Wiley & Sons, 1994.
[5] K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft, “When is ‘Nearest Neighbor’ Meaningful?” Proc. Int'l Conf. Database Theory (ICDT '99), pp. 217235, 1999.
[6] M.M. Breunig, H. Kriegel, R.T. Ng, and J. Sander, “LOF: Identifying DensityBased Local Outliers,” Proc. ACM Int'l Conf. Managment of Data (SIGMOD '00), pp. 93104, 2000.
[7] C.E. Brodley and M. Friedl, “Identifying and Eliminating Mislabeled Training Instances,” Proc. Nat'l Am. Conf. Artificial Intelligence (AAAI/IAAI '96), pp. 799805, 1996.
[8] A.R. Butz, “Alternative Algorithm for Hilbert's SpaceFilling Curve,” IEEE Trans. Computers, pp. 424426, Apr. 1971.
[9] T. Chan, “Approximate Nearest Neighbor Queries Revisited,” Proc. Ann. ACM Symp. Computational Geometry (SoCG '97), pp. 352358, 1997.
[10] C. Faloutsos, “Multiattribute Hashing Using Gray Codes,” Proc. ACM Int'l Conf. Managment of Data (SIGMOD '86), pp. 227238, 1986.
[11] C. Faloutsos and S. Roseman, “Fractals for Secondary Key Retrieval,” Proc. ACM Int'l Conf. Principles of Database Systems (PODS '89), pp. 247–252, 1989.
[12] J. Han and M. Kamber, Data Mining, Concepts and Techniques. San Francisco: Morgan Kaufmann, 2001.
[13] H.V. Jagadish, “Linear Clustering of Objects with Multiple Attributes,” Proc. ACM Int'l Conf. Managment of Data (SIGMOD '90), pp. 332342, 1990.
[14] W. Jin, A.K.H. Tung, and J. Han, “Mining Topn Local Outliers in Large Databases,” Proc. ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '01), pp. 293298, 2001.
[15] E. Knorr and R. Ng, “Algorithms for Mining DistanceBased Outliers in Large Datasets,” Proc. Int'l Conf. Very Large Databases (VLDB '98), pp. 392403, 1998.
[16] E. Knorr, R. Ng, and V. Tucakov, “DistanceBased Outlier: Algorithms and Applications,” VLDB J., vol. 8, nos. 34, pp. 237253, 2000.
[17] D.E. Knuth, The Art of Computer Programming, Vol. 3— Sorting and Searching. Reading, Mass.: AddisonWesley, 1973.
[18] J.K. Lawder, “Calculation of Mappings between One and $n$ Dimensional Values Using the Hilbert SpaceFilling Curve,” Research Report BBKCS0001, pp. 113, 2000.
[19] W. Lee, S.J. Stolfo, and K.W. Mok, “Mining Audit Data to Build Intrusion Detection Models,” Proc. Int'l Conf. Knowledge Discovery and Data Mining (KDD '98), pp. 6672, 1998.
[20] S. Liao, M. Lopez, and S. Leutenegger, “High Dimensional Similarity Search with Space Filling Curves,” Proc. Int'l Conf. Data Eng. (ICDE '01), pp. 615622, 2001.
[21] M. Lopez and S. Liao, “Finding $k$ ClosestPairs Efficiently for High Dimensional Data,” Proc. Canadian Conf. Computational Geometry (CCCG '00), pp. 197204, 2000.
[22] B. Moon, H.V. Jagadish, C. Faloutsos, and J.H. Saltz, “Analysis of the Clustering Properties of Hilbert SpaceFilling Curve,” IEEE Trans. Knowledge and Data Eng., vol. 13, no. 1, pp. 124141, Jan./Feb. 2001.
[23] D. Moore, Fast Hilbert Curve Generation, Sorting, and Range Queries, http://www.caam.rice.edu/~dougm/twiddleHilbert /, 2004.
[24] F.P. Preparata and M.I. Shamos, Computational Geometry An Introduction. New York: SpringerVerlag, 1985.
[25] S. Ramaswamy, R. Rastogi, and K. Shim, “Efficient Algorithms for Mining Outliers from Large Data Sets,” Proc. ACM Int'l Conf. Managment of Data (SIGMOD '00), pp. 427438, 2000.
[26] S. Rosset, U. Murad, E. Neumann, Y. Idan, and G. Pinkas, “Discovery of Fraud Rules for TelecommunicationsChallenges and Solutions,” Proc. Int'l Conf. Knowledge Discovery and Data Mining (KDD '99), pp. 409413, 1999.
[27] H. Sagan, Space Filling Curves. SpringerVerlag, 1994.
[28] J. Shepherd, X. Zhu, and N. Megiddo, “A Fast Indexing Method for Multidimensional Nearest Neighbor Search,” Proc. SPIE Conf. Storage and Retrieval for Image and Video Databases VII, pp. 350355, 1999.
[29] Z.R. Struzik and A. Siebes, “Outliers Detection and Localisation with Wavelet Based Multifractal Formalism,” technical report, CWI, Amsterdam, INSR0008, 2000.
[30] K. Yamanishi and J. Takeuchi, “Discovering Outlier Filtering Rules from Unlabeled Data,” Proc. Int'l Conf. Knowledge Discovery and Data Mining (KDD '01), pp. 389394, 2001.
[31] K. Yamanishi, J. Takeuchi, G. Williams, and P. Milne, “OnLine Unsupervised Learning Outlier Detection Using Finite Mixtures with Discounting Learning Algorithms,” Proc. Int'l Conf. Knowledge Discovery and Data Mining (KDD '00), pp. 250–254, 2000.
[32] D. Yu, G. Sheikholeslami, and A. Zhang, “Findout: Finding Outliers in Very Large Datasets,” Knowledge and Information Systems, vol. 4, no. 3, pp. 387412, 2002.