Robust Local Community Detection: On Free Rider Effect and Its Elimination
Summary: Systematic analysis of metrics exposes free rider effects; a query-biased node weighting suppresses irrelevant subgraphs. Defines query-biased density, formulates QDC, analyzes its complexity, and offers efficient algorithms with extensive experiments. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yubao Wu (Case Western Reserve University)
- 2. Ruoming Jin (Kent State University)
- 3. Jing Li (Case Western Reserve University)
- 4. Xiang Zhang (Case Western Reserve University)
BibTeX Citation
@article{wu_vldb15,
title = {{Robust Local Community Detection: On Free Rider Effect and Its Elimination}},
author = {Wu, Yubao and Jin, Ruoming and Li, Jing and Zhang, Xiang},
journal = {PVLDB},
series = {{VLDB} '15},
volume = {8},
number = {7},
pages = {798--809},
doi = {10.14778/2752939.2752944},
url = {https://doi.org/10.14778/2752939.2752944},
year = {2015}
}
Incoming Citations (Sorted by Pagerank)
Showing 26 of 26 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 184 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00026100147 |
| 284 | Online Search of Overlapping Communities | 2013 | SIGMOD | 0.00022208562 |
| 285 | Local Search of Communities in Large Graphs | 2014 | SIGMOD | 0.00022150572 |
| 561 | Densest Subgraph in Streaming and MapReduce | 2012 | VLDB | 0.00016396211 |
| 1,604 | Fast and Unified Local Search for Random Walk Based K-Nearest-Neighbor Query in Large Graphs | 2014 | SIGMOD | 0.00010095949 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,915 | Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs | 2024 | VLDB |
| 2 | 1,414 | Effective Community Search over Large Spatial Graphs | 2017 | VLDB |
| 3 | 1,007 | Influential Community Search in Large Networks | 2015 | VLDB |
| 4 | 1,129 | Approximate Closest Community Search in Networks | 2016 | VLDB |
| 5 | 4,358 | Anchored Densest Subgraph | 2022 | SIGMOD |
| 6 | 184 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD |
| 7 | 2,601 | Community Detection in Social Networks: An In-depth Benchmarking Study with a Procedure-Oriented Framework | 2015 | VLDB |
| 8 | 6,542 | On Density-based Local Community Search | 2024 | PODS |
| 9 | 5,547 | Reliable Community Search in Dynamic Networks | 2022 | VLDB |
| 10 | 285 | Local Search of Communities in Large Graphs | 2014 | SIGMOD |