Density Biased Sampling with Locality Sensitive Hashing for Outlier Detection

被引:0
作者
Zhang, Xuyun [1 ]
Salehi, Mahsa [2 ]
Leckie, Christopher [3 ]
Luo, Yun [4 ]
He, Qiang [5 ]
Zhou, Rui [5 ]
Kotagiri, Rao [3 ]
机构
[1] Univ Auckland, Dept Elect & Comp Engn, Auckland, New Zealand
[2] Monash Univ, Fac Informat Technol, Melbourne, Vic, Australia
[3] Univ Melbourne, Dept Comp & Informat Syst, Melbourne, Vic, Australia
[4] Guizhou Univ, Fac Comp Sci & Technol, Guiyang, Peoples R China
[5] Swinburne Univ Technol, Sch Software & Elect Engn, Melbourne, Vic, Australia
来源
WEB INFORMATION SYSTEMS ENGINEERING, WISE 2018, PT II | 2018年 / 11234卷
关键词
Outlier/anomaly detection; Locality-Sensitive Hashing; Density biased sampling; Big data; Unsupervised learning;
D O I
10.1007/978-3-030-02925-8_19
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Outlier or anomaly detection is one of the major challenges in big data analytics since unusual but insightful patterns are often hidden in massive data sets such as sensing data and social networks. Sampling techniques have been a focus for outlier detection to address scalability on big data. The recent study has shown uniform random sampling with ensemble can boost outlier detection performance. However, uniform sampling assumes that all points are of equal importance, which usually fails to hold for outlier detection because some points are more sensitive to sampling than others. Thus, it is necessary and promising to utilise the density information of points to reflect their importance for sampling based detection. In this paper, we formally investigate density biased sampling for outlier detection, and propose a novel density biased sampling approach. To attain scalable density estimation, we use Locality Sensitive Hashing (LSH) for counting the nearest neighbours of a point. Extensive experiments on both synthetic and real-world data sets show that our approach significantly outperforms existing outlier detection methods based on uniform sampling.
引用
收藏
页码:269 / 284
页数:16
相关论文
共 29 条
[1]  
Aggarwal C.C, 2013, ACM SIGKDD Explor. Newsl, V14, P49, DOI DOI 10.1145/2481244.2481252
[2]  
Andoni A, 2006, ANN IEEE SYMP FOUND, P459
[3]  
Angiulli F., 2002, Principles of Data Mining and Knowledge Discovery. 6th European Conference, PKDD 2002. Proceedings (Lecture Notes in Artificial Intelligence Vol.2431), P15
[4]  
[Anonymous], 2008, P 14 ACM SIGKDD INT
[5]  
[Anonymous], 2006, Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, DOI 10.1145/1150402.1150501
[6]  
[Anonymous], 2011, P 20 ACM INT C INFOR
[7]  
[Anonymous], 2015, ACM SIGKDD explorations newsletter, DOI [DOI 10.1145/2830544.2830549, 10.1145/2830544.2830549]
[8]   LOF: Identifying density-based local outliers [J].
Breunig, MM ;
Kriegel, HP ;
Ng, RT ;
Sander, J .
SIGMOD RECORD, 2000, 29 (02) :93-104
[9]  
Dong W., 2008, P ACM C INF KNOWL MA, P669
[10]   An introduction to ROC analysis [J].
Fawcett, Tom .
PATTERN RECOGNITION LETTERS, 2006, 27 (08) :861-874