Unsupervised Graph Anomaly Detection Algorithms Implemented in Apache Spark


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

The graph anomaly detection problem occurs in many application areas and can be solved by spotting outliers in unstructured collections of multi-dimensional data points, which can be obtained by graph analysis algorithms. We implement the algorithm for the small community analysis and the approximate LOF algorithm based on Locality-Sensitive Hashing, apply the algorithms to a real world graph and evaluate scalability of the algorithms. We use Apache Spark as one of the most popular Big Data frameworks.

About the authors

A. Semenov

Scientific Research Centre for Electronic Computer Technology (NICEVT) JSC

Author for correspondence.
Email: semenov@nicevt.ru
Russian Federation, Varshavskoe sh. 125, Moscow, 117587

A. Mazeev

Scientific Research Centre for Electronic Computer Technology (NICEVT) JSC

Email: semenov@nicevt.ru
Russian Federation, Varshavskoe sh. 125, Moscow, 117587

D. Doropheev

Moscow Institute of Physics and Technology (State University)

Email: semenov@nicevt.ru
Russian Federation, Institutskii per. 9, Dolgoprudny, Moscow oblast, 141701

T. Yusubaliev

Quality Software Solutions Ltd.

Email: semenov@nicevt.ru
Russian Federation, Moscow


Copyright (c) 2018 Pleiades Publishing, Ltd.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies