Parallelization of Extracting Connected Subgraphs with Common Itemsets in Distributed Memory Environments

This paper proposes a parallel implementation of graph mining that extracts all connected subgraphs with common itemsets, of which the size is not less than a given threshold, from a graph and from itemsets associated with vertices of the graph, in distributed memory environments using the task-para...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of Information Processing 2017, Vol.25, pp.256-267
Hauptverfasser:	Okuno, Shingo, Hiraishi, Tasuku, Nakashima, Hiroshi, Yasugi, Masahiro, Sese, Jun
Format:	Artikel
Sprache:	eng
Schlagworte:	backtrack search Data mining Distributed memory distributed memory environments dynamic load balancing graph mining Graph theory Knowledge acquisition Locks Parallel processing Search algorithms task-parallel languages
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!