Onion-Peeling Outlier Detection in 2-D data Sets

by   Archit Harsh, et al.

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.


page 1

page 2

page 3

page 4


Fast and Exact Outlier Detection in Metric Spaces: A Proximity Graph-based Approach

Distance-based outlier detection is widely adopted in many fields, e.g.,...

Linear-time Outlier Detection via Sensitivity

Outliers are ubiquitous in modern data sets. Distance-based techniques a...

Outlier Detection using AI: A Survey

An outlier is an event or observation that is defined as an unusual acti...

Clarifying the Hubble constant tension with a Bayesian hierarchical model of the local distance ladder

Estimates of the Hubble constant, $H_0$, from the local distance ladder ...

IPOF: An Extremely and Excitingly Simple Outlier Detection Booster via Infinite Propagation

Outlier detection is one of the most popular and continuously rising top...

Kernel-based Outlier Detection using the Inverse Christoffel Function

Outlier detection methods have become increasingly relevant in recent ye...

Outlier Robust ICP for Minimizing Fractional RMSD

We describe a variation of the iterative closest point (ICP) algorithm f...