A note on accelerating the local outlier factor method on one-dimensional data
- Authors
- Kang, C.
- Issue Date
- Jun-2020
- Publisher
- ICIC International
- Keywords
- Accelerated algorithm; Local outlier factor; One-dimensional data
- Citation
- ICIC Express Letters, v.14, no.6, pp.571 - 575
- Journal Title
- ICIC Express Letters
- Volume
- 14
- Number
- 6
- Start Page
- 571
- End Page
- 575
- URI
- http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/38619
- DOI
- 10.24507/icicel.14.06.571
- ISSN
- 1881-803X
- Abstract
- The local outlier factor (LOF) method, which is proposed by Breunig et al. (2000), is one of the most common techniques to detect outliers or abnormal data points in a dataset. It compares the density of a data point with the densities of its k-nearest neighbors. This study presents an algorithm to perform LOF much faster than conventional methods, especially for one-dimensional data. Its worst-case time complex- ity is only O(nk), and space complexity is O(n). The performance is also computation- ally compared with the DMwR package, which implements Breunig et al. (2000) in R language. ICIC International © 2020.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > ETC > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.