Distributed discovery of frequent subgraphs of a network using MapReduce

DOI10.1007/S00607-015-0446-9MaRDI QIDQ889838zbMATH OpenOpenAlexFDO

Authors Saeed Shahrivari, Saeed Jalili

Publication date 9 November 2015

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00607-015-0446-9

zbMATH Keywords

distributed graph algorithmsfrequent subgraph discoveryMapReduce

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• A distributed approach for graph mining in massive networks
• Distributed top-k subgraph matching
• An efficient approach for mining frequent subgraphs
• FP-GraphMiner -- a fast frequent pattern mining algorithm for network graphs
• Mining frequent subgraphs in multigraphs

Cites work

• Colorful triangle counting and a \textsc{MapReduce} implementation
• Complete mining of frequent patterns from graphs: Mining graph data
• Counting triangles in massive graphs with MapReduce
• Engineering an efficient canonical labeling tool for large and sparse graphs
• The NP-completeness column

Cited in

(3)

• A distributed approach for graph mining in massive networks
• Distributed centrality analysis of social network data using MapReduce
• Distributed top-k subgraph matching

Describes a project that uses

Uses Software

• Hadoop
• gSpan
• FANMOD
• Kavosh
• bliss
• MapReduce
• Chord

This page was built for publication: Distributed discovery of frequent subgraphs of a network using MapReduce

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q889838)