Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

LSC-Mine: Algorithm for Mining Local Outliers

LSC-Mine: Algorithm for Mining Local Outliers
View Free PDF
Author(s): Malik Agyemang (University of Calgary, Canada)
Copyright: 2004
Pages: 4
Source title: Innovations Through Information Technology
Source Editor(s): Mehdi Khosrow-Pour, D.B.A. (Information Resources Management Association, USA)
DOI: 10.4018/978-1-59140-261-9.ch002
ISBN13: 9781616921255
EISBN13: 9781466665347


Data objects which differ significantly from the remaining data objects are referred to as outliers. Density-based algorithms for mining outliers are very effective in detecting all forms of outliers, where data objects with fewer neighbors are likely to be outliers than are those with more neighbors. However, existing density-based algorithms engage in huge repetitive computation and comparison for every object before the few outliers are detected. Expensive computations might make scalability of these techniques to important applications like quick fraud detection unfeasible. This paper proposes LSC-Mine algorithm based on the distance of an object and those of its knearest neighbors. In addition, data objects that are not possible outlier candidates are pruned which reduces the number of computations and comparisons in LOF technique resulting in an improved performance.

Body Bottom