Reducing distance computations for distance-based outliers

•The paper introduces the FastSolvingSet algorithm to discover outliers.•This algorithm computes the distance based outliers with no approximation.•The experiments outline that a large amount of distance computations is saved.•FastSolvingSet is suitable to be used in parallel/distributed scenarios....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Expert systems with applications Jg. 147; S. 113215
Hauptverfasser: Angiulli, Fabrizio, Basta, Stefano, Lodi, Stefano, Sartori, Claudio
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Elsevier Ltd 01.06.2020
Elsevier BV
Schlagworte:
Algorithms
Data analysis
Distance-based outliers
Fraud
Intrusion
Molecular biology
Optimization
Outlier detection
Outliers (statistics)
Parallel and distributed algorithms
Parallel and distributed algorithms
Outlier detection
Distance-based outliers
ISSN:0957-4174, 1873-6793
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•The paper introduces the FastSolvingSet algorithm to discover outliers.•This algorithm computes the distance based outliers with no approximation.•The experiments outline that a large amount of distance computations is saved.•FastSolvingSet is suitable to be used in parallel/distributed scenarios. The mining task of outlier detection is essential in many expert and intelligent systems exploited in a wide range of applications, from intrusion detection to molecular biology. In some of such applications the ability to process large amounts of data in a very short time can be critical, for instance in intrusion and fraud detection. This paper explores a solution for the optimisation of an exact, unsupervised outlier detection method by avoiding unnecessary computations, and therefore reducing the running time and making the method usable also in settings where response times are crucial. In particular, we enhance the SolvingSet-based approach by using a mechanism that exploits the knowledge learned during the algorithm execution and avoids a large amount of distance computations. We demonstrate the strength of the proposed solution, named FastSolvingSet, through both theoretical and experimental analysis.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0957-4174
1873-6793
DOI:10.1016/j.eswa.2020.113215