Fast Algorithms for Outlier Detection
Fawaz A.M. Masoud, Moh'd B. Al- Zoubi, Imad Salah & Ali Al-Dahoud
Journal of Computer Science, Volume 4, Issue 2, pp. 129–132 · doi.org/10.3844/jcssp.2008.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.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2008 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
Masoud, F. A., Al- Zoubi, M. B., Salah, I. & Al-Dahoud, A. (2008). Fast Algorithms for Outlier Detection. Journal of Computer Science, 4(2), 129–132. https://doi.org/10.3844/jcssp.2008.129.132
- Licence
- © Science Publications
- Issue
- Volume 4, Issue 2
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record