.png){kind=icon}
返回
Applying Anomaly Pattern Score for Outlier Detection
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2895094.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Outlier detection is an important sub-field of data mining and studied intensively by researchers in the past decades. For neighborhood-based outlier detection methods like KNN and LOF, different settings in the number of neighbors (indicated by a parameter k) would greatly affect the model's performance. Thereby, there are some recent studies which focus on identifying the optimal value of k by analyzing the global or local structure of the dataset. But, we argue that neighborhood-based outlier detection model could obtain an improvement in performance without parameter tuning. In this paper, from a novel angle of view, we adopt a uniform sampling strategy to generate a series of local proximity graphs and propose a new adaptive outlier detection model named anomaly pattern score which does not rely on the k tuning. In addition, the theoretical analysis of the effectiveness of the proposed model is conducted as well. The extensive experiments on both synthetic and real-world datasets show that the proposed model outperforms the state-of-the-art algorithms on most datasets.
Keyword:
Adaptive outlier detection
adaptive anomaly detection
neighborhood-based model
Markov random walk
local proximity graph
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容