Name
Abstract | ||
|---|---|---|
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 scale very well, or use techniques like color coding, which have a high memory overhead. In this paper, we develop a novel approach for parallelizing both these classes of problems, using an algebraic representation of subgraphs as monomials—this methodology involves detecting multilinear terms in multivariate polynomials. Our algorithms show good scaling over a large regime, and they run on networks with close to half one billion edges. The resulting parallel algorithm for trees is able to scale to subgraphs of size 18, which has not been done before, and it significantly outperforms the best prior color coding based method (FASCIA) by more than two orders of magnitude. Our algorithm for network scan statistics is the first such parallelization, and it is able to handle a broad class of scan statistics functions with the same approach. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.jpdc.2019.04.006 | Journal of Parallel and Distributed Computing |
Keywords | Field | DocType |
Subgraph isomorphism,Distributed graph algorithms,Graph scan statistics,Multilinear detection,Parameterized complexity | Color-coding,Anomaly detection,Parallel algorithm,Computer science,Parallel computing,Algorithm,Heuristics,Complex network,Scaling,Multilinear map,Encoding (memory) | Conference |
Volume | ISSN | Citations |
132 | 0743-7315 | 2 |
PageRank | References | Authors |
0.36 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Saliya Ekanayake | 1 | 90 | 9.34 |
| Jose Cadena | 2 | 98 | 7.53 |
| U. S. Wickramasinghe | 3 | 4 | 1.77 |
| Anil Kumar S. Vullikanti | 4 | 1135 | 98.30 |