Sign inSubmit

Journal of Computer Science

ISSN 1549-3636 (print)eISSN 1552-6607 (online) Open access
Sign up for alertsSubmit manuscript
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
ArticleMetrics
Research Article · Free to read · Published 31 December 2007

A Fast Distance-Based Algorithm to Detect Outliers

Moh’d Belal Al-Zoubi & Nadim Obeidv

Journal of Computer Science, Volume 3, Issue 12, pp. 944–947 · doi.org/10.3844/jcssp.2007.944.947

6,732 accesses5,126 downloads0 citations (Crossref)Metrics
Cite Check for updates

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.

Licence and reuse

Free to read. This article carries the publisher’s copyright, as printed on it: © 2007 Science Publications. It is free to read; ask us before reusing it.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

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

Licence
© Science Publications
Issue
Volume 3, Issue 12
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
A Fast Distance-Based Algorithm to Detect OutliersJournal of Computer Science · Volume 3, Issue 12 · pp. 944–947 · © Science PublicationsDownload