LOF
Markus M. Breunig, Hans‐Peter Kriegel, Raymond T. Ng et al. · ACM SIGMOD Record · 2000
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.
Cited by 5,189 works. doi:10.1145/335191.335388
Authors
References
- Exploratory Data Analysis
- A density-based algorithm for discovering clusters in large spatial Databases with Noise
- Computational Geometry--An Introduction.
- Efficient and Effective Clustering Methods for Spatial Data Mining
- BIRCH
- Outliers in Statistical Data
- OPTICS
- Identification of Outliers
- Automatic subspace clustering of high dimensional data for data mining applications
- The X-tree: An Index Structure for High-Dimensional Data Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.