Fast Algorithms for Outlier Detection
Fawaz A.M. Masoud, Moh'd B. Al- Zoubi, Imad Salah and Ali Al-Dahoud
DOI : 10.3844/jcssp.2008.129.132
Journal of Computer Science
Volume 4, Issue 2
Pages 129-132
Abstract
Finding fast algorithms to detect outliers (as unusual objects) by their distance to neighboring objects is a big desire. Two algorithms were proposed to detect outliers quickly. The first was based on the Partial Distance (PD) algorithm and the second was an improved version of the PD algorithm. It was found that the proposed algorithms reduced the number of distance calculations compared to the nested-loop method.
Copyright
© 2008 Fawaz A.M. Masoud, Moh'd B. Al- Zoubi, Imad Salah and Ali Al-Dahoud. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
