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,387 | Mining Bursting Core in Large Temporal Graphs | 2022 | VLDB | 7.3346183e-05 |
| 3,902 | Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs | 2024 | VLDB | 6.9179865e-05 |
| 3,928 | On Querying Connected Components in Large Temporal Graphs | 2023 | SIGMOD | 6.9013791e-05 |
| 7,000 | Towards Plug-and-Play Visual Graph Query Interfaces: Data-driven Selection of Canned Patterns for Large Networks | 2021 | VLDB | 5.6080933e-05 |
| 8,187 | Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks | 2024 | VLDB | 5.3652509e-05 |
| 8,358 | Mining Top-k Pairs of Correlated Subgraphs in a Large Network | 2020 | VLDB | 5.3314609e-05 |
| 8,563 | Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties | 2022 | SIGMOD | 5.3002237e-05 |
| 10,141 | Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index | 2025 | VLDB | 5.0597449e-05 |
| 10,572 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD | 4.9605343e-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,031 | GraMI: Frequent Subgraph and Pattern Mining in a Single Large Graph | 2014 | VLDB | 0.00012379698 |
| 1,136 | Comparing Stars: On Approximating Graph Edit Distance | 2009 | VLDB | 0.00011857445 |
Previous
Page 1 / 1
Next