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á bibliografie

Vydáno v:	Journal of parallel and distributed computing Ročník 132; číslo C; s. 363 - 382
Hlavní autoři:	Ekanayake, Saliya, Cadena, Jose, Wickramasinghe, Udayanga, Vullikanti, Anil
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	United States Elsevier Inc 01.10.2019 Elsevier
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!