Name
Abstract | ||
|---|---|---|
Many graphs in real-world applications, such as telecommunications networks, social-interaction graphs and co-authorship graphs, contain temporal information. However, existing graph mining algorithms fail to exploit these temporal information and the resulting subgraph patterns do not contain any temporal attribute. In this paper, we study the problem of mining a set of diversified temporal subgraph patterns from a temporal graph, where each subgraph is associated with the time interval that the pattern spans. This problem motivates important applications such as finding social trends in social networks, or detecting temporal hotspots in telecommunications networks. We propose a divide-and-conquer algorithm along with effective pruning techniques, and our approach runs 2 to 3 orders of magnitude faster than a baseline algorithm and obtains high-quality temporal subgraph patterns in real temporal graphs. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1145/2939672.2939848 | KDD |
Field | DocType | Citations |
Data mining,Telecommunications network,Social network,Computer science,Induced subgraph isomorphism problem,Distance-hereditary graph,Exploit,Artificial intelligence,Factor-critical graph,Machine learning,Degeneracy (graph theory),Subgraph isomorphism problem | Conference | 7 |
PageRank | References | Authors |
0.42 | 26 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yi Yang | 1 | 43 | 6.50 |
| Da Yan | 2 | 387 | 34.45 |
| Huanhuan Wu | 3 | 122 | 5.55 |
| James Cheng | 4 | 2044 | 101.89 |
| Shuigeng Zhou | 5 | 2089 | 207.00 |
| John C.S. Lui | 6 | 7 | 0.42 |