离群值
计算机科学
不相交集
分拆(数论)
数据挖掘
算法
k-最近邻算法
维数之咒
集合(抽象数据类型)
人工智能
数学
组合数学
程序设计语言
作者
Sridhar Ramaswamy,Rajeev Rastogi,Kyuseok Shim
出处
期刊:Sigmod Record
[Association for Computing Machinery]
日期:2000-05-16
卷期号:29 (2): 427-438
被引量:1081
标识
DOI:10.1145/335191.335437
摘要
In this paper, we propose a novel formulation for distance-based outliers that is based on the distance of a point from its k th nearest neighbor. We rank each point on the basis of its distance to its k th nearest neighbor and declare the top n points in this ranking to be outliers. In addition to developing relatively straightforward solutions to finding such outliers based on the classical nested-loop join and index join algorithms, we develop a highly efficient partition-based algorithm for mining outliers. This algorithm first partitions the input data set into disjoint subsets, and then prunes entire partitions as soon as it is determined that they cannot contain outliers. This results in substantial savings in computation. We present the results of an extensive experimental study on real-life and synthetic data sets. The results from a real-life NBA database highlight and reveal several expected and unexpected aspects of the database. The results from a study on synthetic data sets demonstrate that the partition-based algorithm scales well with respect to both data set size and data set dimensionality.
科研通智能强力驱动
Strongly Powered by AbleSci AI