.png){kind=icon}
返回
Reducing distance computations for distance-based outliers
.png){kind=icon}
OA
AI
DOI：10.1016/j.eswa.2020.113215.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The mining task of outlier detection is essential in many expert and intelligent systems exploited in a wide range of applications, from intrusion detection to molecular biology. In some of such applications the ability to process large amounts of data in a very short time can be critical, for instance in intrusion and fraud detection. This paper explores a solution for the optimisation of an exact, unsupervised outlier detection method by avoiding unnecessary computations, and therefore reducing the running time and making the method usable also in settings where response times are crucial. In particular, we enhance the SolvingSet-based approach by using a mechanism that exploits the knowledge learned during the algorithm execution and avoids a large amount of distance computations. We demonstrate the strength of the proposed solution, named FastSolvingSet, through both theoretical and experimental analysis. (C) 2020 Elsevier Ltd. All rights reserved.
Keyword:
Distance-based outliers
Outlier detection
Parallel and distributed algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
查看更多机构
引用论文
.png){kind=icon}
没有更多内容