离群值
异常检测
核密度估计
计算机科学
数据挖掘
极值理论
核(代数)
带宽(计算)
人工智能
统计
数学
计算机网络
组合数学
估计员
作者
Sevvandi Kandanaarachchi,Rob Hyndman
标识
DOI:10.1080/10618600.2021.2000425
摘要
This article introduces lookout, a new approach to detect outliers using leave-one-out kernel density estimates and extreme value theory. Outlier detection methods that use kernel density estimates generally employ a user defined parameter to determine the bandwidth. Lookout uses persistent homology to construct a bandwidth suitable for outlier detection without any user input. We demonstrate the effectiveness of lookout on an extensive data repository by comparing its performance with other outlier detection methods based on extreme value theory. Furthermore, we introduce outlier persistence, a useful concept that explores the birth and the cessation of outliers with changing bandwidth and significance levels. The R package lookout implements this algorithm. Supplementary files for this article are available online.
科研通智能强力驱动
Strongly Powered by AbleSci AI