COMMIT: A Scalable Approach to Mining Communication Motifs from Dynamic Networks
Summary: COMMIT scales mining of communication motifs in dynamic networks by turning evolving graphs into a sequence database and pruning the search. Up to 100x speedups vs baselines; motifs reveal recurring interaction patterns and social-network influence. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Saket Gurukar (Indian Institute of Technology Madras)
- 2. Sayan Ranu (Indian Institute of Technology Madras)
- 3. Balaraman Ravindran (Indian Institute of Technology Madras)
BibTeX Citation
@inproceedings{gurukar_sigmod15,
title = {{COMMIT: A Scalable Approach to Mining Communication Motifs from Dynamic Networks}},
author = {Gurukar, Saket and Ranu, Sayan and Ravindran, Balaraman},
series = {{SIGMOD} '15},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2733272.2737791},
url = {https://dl.acm.org/doi/10.1145/2733272.2737791},
year = {2015}
}Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,337 | Mining Bursting Core in Large Temporal Graphs | 2022 | VLDB | 7.5072753e-05 |
| 3,836 | On Querying Connected Components in Large Temporal Graphs | 2023 | SIGMOD | 7.0827068e-05 |
| 3,911 | Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs | 2024 | VLDB | 7.0240227e-05 |
| 6,866 | Towards Plug-and-Play Visual Graph Query Interfaces: Data-driven Selection of Canned Patterns for Large Networks | 2021 | VLDB | 5.7507099e-05 |
| 8,019 | Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks | 2024 | VLDB | 5.5062157e-05 |
| 8,206 | Mining Top-k Pairs of Correlated Subgraphs in a Large Network | 2020 | VLDB | 5.4666548e-05 |
| 8,365 | Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties | 2022 | SIGMOD | 5.44244e-05 |
| 9,916 | Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index | 2025 | VLDB | 5.1955087e-05 |
| 10,283 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,085 | GraMI: Frequent Subgraph and Pattern Mining in a Single Large Graph | 2014 | VLDB | 0.0001225302 |
| 1,115 | Comparing Stars: On Approximating Graph Edit Distance | 2009 | VLDB | 0.00012117375 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,690 | On Analyzing Graphs with Motif-Paths | 2021 | VLDB |
| 2 | 1,944 | Real-Time Twitter Recommendation: Online Motif Detection in Large Dynamic Graphs | 2014 | VLDB |
| 3 | 13,454 | Scalable Community Detection via Parallel Correlation Clustering | 2021 | VLDB |
| 4 | 8,206 | Mining Top-k Pairs of Correlated Subgraphs in a Large Network | 2020 | VLDB |
| 5 | 10,754 | Community Detection in Heterogeneous Information Networks Without Materialization | 2025 | SIGMOD |
| 6 | 10,941 | Effective and Efficient Community Search for Complex Network Semantics Capture: From Coarse-Grain to Fine-Grain | 2025 | VLDB |
| 7 | 2,580 | Community Detection in Social Networks: An In-depth Benchmarking Study with a Procedure-Oriented Framework | 2015 | VLDB |
| 8 | 4,236 | On Dense Pattern Mining in Graph Streams | 2010 | VLDB |
| 9 | 8,019 | Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks | 2024 | VLDB |
| 10 | 590 | Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis | 2013 | VLDB |