Onion-Peeling Outlier Detection in 2-D data Sets

  • Harsh A
  • E. J
  • Wei P
N/ACitations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

Copyright © 2018, arXiv, All rights reserved. Outlier Detection is a critical and cardinal research task due its array of applications in variety of domains ranging from data mining, clustering, statistical analysis, fraud detection, network intrusion detection and diagnosis of diseases etc. Over the last few decades, distance-based outlier detection algorithms have gained significant reputation as a viable alternative to the more traditional statistical approaches due to their scalable, non-parametric and simple implementation. In this paper, we present a modified onion peeling (Convex hull) genetic algorithm to detect outliers in a Gaussian 2-D point data set. We present three different scenarios of outlier detection using a) Euclidean Distance Metric b) Standardized Euclidean Distance Metric and c) Mahalanobis Distance Metric. Finally, we analyze the performance and evaluate the results.

Cite

CITATION STYLE

APA

Harsh, A., E., J., & Wei, P. (2016). Onion-Peeling Outlier Detection in 2-D data Sets. International Journal of Computer Applications, 139(3), 26–31. https://doi.org/10.5120/ijca2016909122

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free