JCS Cover
Frequency: Monthly
ISSN: 1549-3636 (Print)
ISSN: 1552-6607 (Online)
Research Article Open Access

A Fast Distance-Based Algorithm to Detect Outliers

Moh’d Belal Al-Zoubi and Nadim Obeidv

Abstract

A fast distance-based algorithm for outlier detection will be proposed. It was found that the proposed algorithm reduced the number of distance calculations compared to the nested-loop algorithm. Test results were performed on different well-known data sets. The results showed that the proposed algorithm gave a reasonable amount of CPU time saving.

Journal of Computer Science
Volume 3 No. 12, 2007, 944-947

DOI: https://doi.org/10.3844/jcssp.2007.944.947

Submitted On: 26 February 2008 Published On: 31 December 2007

How to Cite: Al-Zoubi, M. B. & Obeidv, N. (2007). A Fast Distance-Based Algorithm to Detect Outliers . Journal of Computer Science, 3(12), 944-947. https://doi.org/10.3844/jcssp.2007.944.947

Open AccessCopyright: © 2007 Moh’d Belal Al-Zoubi and Nadim Obeidv. 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.

  • 3,173 Views
  • 3,038 Downloads
  • 0 Citations

Download

Keywords

  • Distance-based outliers
  • outlier detection
  • data mining