A distributed approach for graph mining in massive networks

DOI10.1007/s10618-016-0466-xzbMath1411.68123OpenAlexW2415186390WikidataQ114827254 ScholiaQ114827254MaRDI QIDQ1741266

N. Talukder, Mohammed Javeed Zaki

Publication date: 3 May 2019

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10618-016-0466-x

zbMATH Keywords

high performance computingfrequent subgraph miningdistributed graph miningparallel graph miningsingle large graph

Mathematics Subject Classification ID

Related Items (4)

Testing for Equivalence of Network Distribution Using Subgraph Counts ⋮ Counting frequent patterns in large labeled graphs: a hypergraph-based approach ⋮ Mining frequent subgraphs in multigraphs ⋮ A Detailed Study of the Distributed Rough Set Based Locality Sensitive Hashing Feature Selection Technique

Uses Software

• gSpan

Cites Work

• Distributed discovery of frequent subgraphs of a network using MapReduce
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• The Complexity of Mining Maximal Frequent Subgraphs

This page was built for publication: A distributed approach for graph mining in massive networks