MIDAS: Multilinear detection at scale

We focus on two classes of problems in graph mining: (1) finding trees and (2) anomaly detection in complex networks using scan statistics. These are fundamental problems in a broad class of applications. Most of the parallel algorithms for such problems are either based on heuristics, which do not...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of parallel and distributed computing Jg. 132; H. C; S. 363 - 382
Hauptverfasser:	Ekanayake, Saliya, Cadena, Jose, Wickramasinghe, Udayanga, Vullikanti, Anil
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	United States Elsevier Inc 01.10.2019 Elsevier
Schlagworte:	Distributed graph algorithms Graph scan statistics Multilinear detection Parameterized complexity Subgraph isomorphism Subgraph isomorphism Distributed graph algorithms Graph scan statistics Parameterized complexity Multilinear detection
ISSN:	0743-7315, 1096-0848
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!