返回
K-Means-based isolation forest
DOI:10.1016/j.knosys.2020.105659.png)
摘要
En 中文
The task of anomaly detection in data is one of the main challenges in data science because of the wide plethora of applications and despite a spectrum of available methods. Unfortunately, many of anomaly detection schemes are still imperfect i.e., they are not effective enough or act in a non-intuitive way or they are focused on a specific type of data. In this study, the classical method of Isolation Forest is thoroughly analyzed and augmented by bringing an innovative approach. This is k-Means-Based Isolation Forest that allows to build a search tree based on many branches in contrast to the only two considered in the original method. k-Means clustering is used to predict the number of divisions on each decision tree node. As supported through experimental studies, the proposed method works effectively for data coming from various application areas including intermodal transport and geographical, spatio-temporal data. In addition, it enables a user to intuitively determine the anomaly score for an individual record of the analyzed dataset. The advantage of the proposed method is that it is able to fit the data at the step of decision tree building. Moreover, it returns more intuitively appealing anomaly score values. (C) 2020 The Authors. Published by Elsevier B.V.
Keyword:
Anomaly detection
Isolation forest
K-Means
Search tree
Spatio-temporal datasets
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Electrothermal Model for Power LEDs Based on the Equivalent Resistance Concept for LED Driver Design基于LED驱动器设计的等效电阻概念的功率LED电热模型
A Flying Squirrel Search Optimization for MPPT Under Partial Shaded Photovoltaic System局部遮挡光伏系统MPPT的飞鼠搜索优化
Neural networks for event extraction from time series: a back propagation algorithm approach用于从时间序列中提取事件的神经网络: 反向传播算法方法


