An efficient algorithm for distributed density-based outlier detection on big data

doi:10.1016/j.neucom.2015.05.135

Return

An efficient algorithm for distributed density-based outlier detection on big data

2016-03-01

PRE

DOI：10.1016/j.neucom.2015.05.135

Original

Original request for help

Save

Abstract

En 中文

The outlier detection is a popular issue in the area of data management and multimedia analysis, and it can be used in many applications such as detection of noisy images, credit card fraud detection, network intrusion detection. The density-based outlier is an important definition of outlier, whose target is to compute a Local Outlier Factor (LOF) for each tuple in a data set to represent the degree of this tuple to be an outlier. It shows several significant advantages comparing with other existing definitions. This paper focuses on the problem of distributed density-based outlier detection for large-scale data. First, we propose a Gird-Based Partition algorithm (GBP) as a data preparation method. GBP first splits the data set into several grids, and then allocates these grids to the datanodes in a distributed environment. Second, we propose a Distributed LOF Computing method (DLC) for detecting density-based outliers in parallel, which only needs a small amount of network communications. At last, the efficiency and effectiveness of the proposed approaches are verified through a series of simulation experiments. (C) 2015 Elsevier B.V. All rights reserved.

Keywords:

Density-based outlier

Local outlier factor

Distributed algorithm

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.