LOF
Top Cited Papers
- 16 May 2000
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 29 (2) , 93-104
- https://doi.org/10.1145/342009.335388
Abstract
For many KDD applications, such as detecting criminal activities in E-commerce, finding the rare instances or the outliers, can be more interesting than finding the common patterns. Existing work in outlier detection regards being an outlier as a binary property. In this paper, we contend that for many scenarios, it is more meaningful to assign to each object a degree of being an outlier. This degree is called the local outlier factor (LOF) of an object. It is local in that the degree depends on how isolated the object is with respect to the surrounding neighborhood. We give a detailed formal analysis showing that LOF enjoys many desirable properties. Using real-world datasets, we demonstrate that LOF can be used to find outliers which appear to be meaningful, but can otherwise not be identified with existing approaches. Finally, a careful performance evaluation of our algorithm confirms we show that our approach of finding local outliers can be practical.Keywords
This publication has 7 references indexed in Scilit:
- Efficient algorithms for mining outliers from large data setsPublished by Association for Computing Machinery (ACM) ,2000
- OPTICSPublished by Association for Computing Machinery (ACM) ,1999
- Automatic subspace clustering of high dimensional data for data mining applicationsPublished by Association for Computing Machinery (ACM) ,1998
- Adaptive Fraud DetectionData Mining and Knowledge Discovery, 1997
- Computing depth contours of bivariate point cloudsComputational Statistics & Data Analysis, 1996
- BIRCHPublished by Association for Computing Machinery (ACM) ,1996
- Identification of OutliersPublished by Springer Nature ,1980