arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1605.00519stat.MLcs.LG
收藏

基于灵敏度的线性时间离群值检测

Linear-time Outlier Detection via Sensitivity

ETH Zurich(苏黎世联邦理工学院)

Mario Lucic, Olivier Bachem, Andreas Krause

摘要:

离群值在现代数据集中无处不在。基于距离的技术是一种流行的非参数离群值检测方法,因为它们不需要对数据生成分布进行先验假设,并且易于实现。将这些技术扩展到大规模数据集而不牺牲准确性是一项具有挑战性的任务。我们提出了一种新的算法的基础上的直觉,离群值有显着的影响质量的分歧为基础的聚类解决方案。我们提出了敏感性-最坏情况下的数据点的聚类目标的影响-作为离群值的度量。然后,我们证明了影响,(非平凡的)上界的灵敏度,可以通过一个简单的线性时间算法计算。为了扩展到单个机器之外,我们提出了一种通信高效的分布式算法。在广泛的实验评估中,我们证明了所提出的方法的有效性,并建立统计意义。特别是,它优于最流行的基于距离的方法,同时快了几个数量级。

英文摘要:

Outliers are ubiquitous in modern data sets. Distance-based techniques are a popular non-parametric approach to outlier detection as they require no prior assumptions on the data generating distribution and are simple to implement. Scaling these techniques to massive data sets without sacrificing accuracy is a challenging task. We propose a novel algorithm based on the intuition that outliers have a significant influence on the quality of divergence-based clustering solutions. We propose sensitivity - the worst-case impact of a data point on the clustering objective - as a measure of outlierness. We then prove that influence, a (non-trivial) upper-bound on the sensitivity, can be computed by a simple linear time algorithm. To scale beyond a single machine, we propose a communication efficient distributed algorithm. In an extensive experimental evaluation, we demonstrate the effectiveness and establish the statistical significance of the proposed approach. In particular, it outperforms the most popular distance-based approaches while being several orders of magnitude faster.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑