On Analyzing Graphs with Motif-Paths
Summary: Motif-paths, concatenations of motif instances, offer high-order structure for graph analysis beyond traditional edge-based approaches. The work applies motif-paths to link prediction, local clustering, and node ranking, and introduces a defragmentation method to connect previously disconnected motif-paths, with experiments on real graphs showing improved effectiveness. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Xiaodong Li
- 2. Reynold Cheng
- 3. Kevin Chen-Chuan Chang
- 4. Caihua Shan
- 5. Chenhao Ma
- 6. Hongtai Cao
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,575 | Finding Locally Densest Subgraphs: A Convex Programming Approach | 2022 | VLDB | 6.9528126e-05 |
| 5,265 | A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery | 2022 | SIGMOD | 5.5972878e-05 |
| 6,719 | DeepTEA: Effective and Efficient Online Time-dependent Trajectory Outlier Detection | 2022 | VLDB | 4.9504873e-05 |
| 8,809 | Efficient Maximal Motif-Clique Enumeration over Large Heterogeneous Information Networks | 2024 | VLDB | 4.4443756e-05 |
| 11,015 | ZeroEA: A Zero-Training Entity Alignment Framework via Pre-Trained Language Model | 2024 | VLDB | 4.1945683e-05 |
| 11,140 | MOSER: Scalable Network Motif Discovery using Serial Test | 2024 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 283 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00029041257 |
| 370 | Online Search of Overlapping Communities | 2013 | SIGMOD | 0.00025415479 |
| 1,740 | A General Framework for Estimating Graphlet Statistics via Random Walk | 2017 | VLDB | 0.0001071792 |
| 1,844 | Effective Community Search over Large Spatial Graphs | 2017 | VLDB | 0.00010341077 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,747 | Mining Significant Graph Patterns by Leap Search | 2008 | SIGMOD | 0.00010691242 |
| 4,716 | Mining Graph Patterns Efficiently via Randomized Summaries | 2009 | VLDB | 5.9755569e-05 |
| 3,410 | Motivo: fast motif counting via succinct color coding and adaptive sampling | 2019 | VLDB | 7.1253867e-05 |
| 203 | Graph Indexing: A Frequent Structure-based Approach | 2004 | SIGMOD | 0.00034889335 |
| 11,565 | Simulation-based Approximate Graph Pattern Matching | 2020 | SIGMOD | 4.1945683e-05 |
| 4,089 | On Dense Pattern Mining in Graph Streams [Extended Abstract] | 2010 | VLDB | 6.4587806e-05 |
| 4,946 | Querying Graph Patterns | 2011 | PODS | 5.8149362e-05 |
| 506 | On Graph Query Optimization in Large Networks | 2010 | VLDB | 0.00021475362 |
| 7,614 | Mining Attribute-structure Correlated Patterns in Large Attributed Graphs | 2012 | VLDB | 4.6947636e-05 |
| 5,518 | Hypergraph Motifs: Concepts, Algorithms, and Discoveries | 2020 | VLDB | 5.4621935e-05 |