
›› 2015, Vol. 30 ›› Issue (6): 12331248.doi: 10.1007/s1139001515960
Special Issue: Data Management and Data Mining
• Special Section on Networking and Distributed Computing for Big Data • Previous Articles Next Articles
XiTe Wang(王习特), Student Member, CCF, Member, ACM, DeRong Shen(申德荣), Senior Member, CCF, Member, ACM, IEEE, Mei Bai(白梅), TieZheng Nie(聂铁铮), Member, CCF, ACM, Yue Kou(寇月), Member, CCF, ACM, Ge Yu(于戈), Fellow, CCF, Member, ACM, IEEE
[1] Hawkins D M. Identification of Outliers. Springer, 1980. [2] Barnett V, Lewis T. Outliers in Statistical Data.Wiley New York, 1994. [3] Rousseeuw P J, Leroy A M. Robust Regression and Outlier Detection. John Wiley & Sons, 2003. [4] Knorr E M, Ng R T. Algorithms for mining distancebased outliers in large datasets. In Proc. the 24th International Conference on Very Large Data Bases, August 1998, pp.392403. [5] Ramaswamy S, Rastogi R, Shim K. Efficient algorithms for mining outliers from large data sets. ACM SIGMOD Record, 2000, 29(2): 427438. [6] Angiulli F, Pizzuti C. Outlier mining in large highdimensional data sets. IEEE Transactions on Knowledge and Data Engineering, 2005, 17(2): 203215. [7] Angiulli F, Pizzuti C. Fast outlier detection in high dimensional spaces. In Proc. the 6th European Conference on Principles of Data Mining and Knowledge Discovery, August 2002, pp.1527. [8] Schubert E, Zimek A, Kriegel H P. Local outlier detection reconsidered: A generalized view on locality with applications to spatial, video, and network outlier detection. Data Mining and Knowledge Discovery, 2014, 28(1): 190237. [9] Shiokawa H, Fujiwara Y, Onizuka M. Scan++: Efficient algorithm for finding clusters, hubs and outliers on largescale graphs. Proceedings of the VLDB Endowment, 2015, 8(11): 11781189. [10] Aggarwal C C, Yu P S. Outlier detection for high dimensional data. ACM SIGMOD Record, 2001, 30(2): 3746. [11] Breunig M M, Kriegel H P, Ng R T, Sander J. LOF: Identifying densitybased local outliers. ACM SIGMOD Record, 2000, 29(2): 93104. [12] He Z, Xu X, Deng S. Discovering clusterbased local outliers. Pattern Recognition Letters, 2003, 24(9/10): 1641 1650. [13] Bay S D, Schwabacher M. Mining distancebased outliers in near linear time with randomization and a simple pruning rule. In Proc. the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 2003, pp.2938. [14] Angiulli F, Fassetti F. Very efficient mining of distancebased outliers. In Proc. the 16th ACM Conference on Information and Knowledge Management, November 2007, pp.791800. [15] Guttman A. Rtrees: A dynamic index structure for spatial searching. ACM SIGMOD Record, 1984, 14(2): 4757. [16] Ciaccia P, Patella M, Zezula P. Mtree: An efficient access method for similarity search in metric spaces. In Proc. the 23rd International Conference on Very Large Databases, August 1997, pp.426435. [17] Beyer K, Goldstein J, Ramakrishnan R, Shaft U. When is “nearest neighbor” meaningful? In Proc. the 7th International Conference on Database Theory, January 1999, pp.217235. [18] Wang B, Yang X C, Wang G R, Yu G. Outlier detection over sliding windows for probabilistic data streams. Journal of Computer Science and Technology, 2010, 25(3): 389400. [19] Cao K Y, Wang G R, Han D H, Ding G H, Wang A X, Shi L X. Continuous outlier monitoring on uncertain data streams. Journal of Computer Science and Technology, 2014, 29(3): 436448. [20] Gupta M, Gao J, Aggarwal C, Han J. Outlier detection for temporal data. Synthesis Lectures on Data Mining and Knowledge Discovery, 2014, 5(1): 1129. [21] Yan Y, Zhang J, Huang B, Sun X, Mu J, Zhang Z, Moscibroda T. Distributed outlier detection using compressive sensing. In Proc. the 2015 ACM SIGMOD International Conference on Management of Data, May 31June 04, 2015, pp.316. [22] Hung E, Cheung D W. Parallel mining of outliers in large database. Distributed and Parallel Databases, 2002, 12(1): 526. [23] Lozano E, Acuña E. Parallel algorithms for distancebased and densitybased outliers. In Proc. the 5th IEEE International Conference on Data Mining, November 2005, pp.729 732. [24] Angiulli F, Basta S, Lodi S, Sartori C. Distributed strategies for mining outliers in large data sets. IEEE Transactions on Knowledge and Data Engineering, 2013, 25(7): 15201532. [25] Jagadish H V, Ooi B C, Tan K, Yu C, Zhang R. iDistance: An adaptive B^{+}tree based indexing method for nearest neighbor search. ACM Transaction Database System, 2005, 30(2): 364397. [26] Ramsak F, Markl V, Fenk R, Zirkel M, Elhardt K, Bayer R. Integrating the UBtree into a database system kernel. In Proc. the 26th International Conference on Very Large Data Bases, September 2000, pp.263272. [27] O'Malley O. Terabyte sort on apache hadoop. http://sortbenchmark.org/YahooHadoop.pdf, October 2015. 
No related articles found! 

