Finding Theme Communities from Database Networks
Summary: Theme communities are cohesive subgraphs in database networks where a common pattern is frequent across vertex-associated databases. To tackle #P-hard counting, TCFI prunes infeasible patterns and TC-Tree indexes and enables sub-second retrieval of hundreds of millions of theme communities, as shown by extensive experiments and a case study. (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. Lingyang Chu
- 2. Zhefeng Wang
- 3. Jian Pei
- 4. Yanyan Zhang
- 5. Yu Yang
- 6. Enhong Chen
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 36 | Fast Algorithms for Mining Association Rules | 1994 | VLDB | 0.00076114894 |
| 106 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.00048373761 |
| 182 | Mining Frequent Patterns without Candidate Generation | 2000 | SIGMOD | 0.00036955562 |
| 284 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00029014359 |
| 313 | Graph Clustering Based on Structural/Attribute Similarities | 2009 | VLDB | 0.0002809849 |
| 1,645 | Attribute-Driven Community Search | 2017 | VLDB | 0.00011027616 |
| 2,685 | Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms | 2016 | SIGMOD | 8.314724e-05 |
| 11,968 | ALID: Scalable Dominant Cluster Detection | 2015 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next