The process of discovering interesting patterns in large, possibly huge, data sets is referred to as data mining, and can be performed in several flavours, known as “data mining functions.” Among these functions, outlier detection discovers observations which deviate substantially from the rest of the data, and has many important practical applications. Outlier detection in very large data sets is however computationally very demanding and currently requires high-performance computing facilities. We propose a family of parallel and distributed algorithms for graphic processing units (GPU) derived from two distance-based outlier detection algorithms: BruteForce and SolvingSet. The algorithms differ in the way they exploit the architecture and memory hierarchy of the GPU and guarantee significant improvements with respect to the CPU versions, both in terms of scalability and exploitation of parallelism. We provide a detailed discussion of their computational properties and measure performances with an extensive experimentation, comparing the several implementations and showing significant speedups.
GPU Strategies for Distance-based Outlier Detection / Angiulli, Fabrizio; Basta, S; Lodi, S; Sartori, C.. - In: IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS. - ISSN 1045-9219. - 27:11(2016), pp. 3256-3268.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
|Titolo:||GPU Strategies for Distance-based Outlier Detection|
|Data di pubblicazione:||2016|
|Citazione:||GPU Strategies for Distance-based Outlier Detection / Angiulli, Fabrizio; Basta, S; Lodi, S; Sartori, C.. - In: IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS. - ISSN 1045-9219. - 27:11(2016), pp. 3256-3268.|
|Appare nelle tipologie:||1.1 Articolo in rivista|