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...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of parallel and distributed computing Ročník 132; číslo C; s. 363 - 382
Hlavní autori:	Ekanayake, Saliya, Cadena, Jose, Wickramasinghe, Udayanga, Vullikanti, Anil
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	United States Elsevier Inc 01.10.2019 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!