Density Personalized Group Query

Summary: DCSGQ: a Density-Customized Social Group Query allowing per-user configurable neighborhood density (tightness or sparseness), generalizing dense-subgraph/group queries. NP-hard/inapproximable; propose IP baseline, FSGSel-RR (relax), FSGSel-TD (FPT w/ guarantee) and a hybrid; outperforms prior methods on large graphs. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 13504
Venue: VLDB
Year: 2023
Pagerank: 5.093636e-05
Overall Rank: 11,502 | 21.09%
DOI: 10.14778/3574245.3574249

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Chih-Ya Shen (National Tsing Hua University)
2. Shao-Heng Ko (Academia Sinica)
3. Guang-Siang Lee (Academia Sinica)
4. Wang-Chien Lee (Pennsylvania State University)
5. De-Nian Yang (Academia Sinica)

BibTeX Citation

@article{shen_vldb23,
        title = {{Density Personalized Group Query}},
        author = {Shen, Chih-Ya and Ko, Shao-Heng and Lee, Guang-Siang and Lee, Wang-Chien and Yang, De-Nian},
        journal = {PVLDB},
        series = {{VLDB} '23},
        volume = {16},
        number = {4},
        pages = {615--628},
        doi = {10.14778/3574245.3574249},
        url = {https://doi.org/10.14778/3574245.3574249},
        year = {2023}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 15 of 15 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
269	3-HOP: A High-Compression Indexing Scheme for Reachability Query	2009	SIGMOD	0.00022786599
982	Influential Community Search in Large Networks	2015	VLDB	0.0001283311
1,069	Truss-based Community Search: a Truss-equivalence Based Indexing Approach	2017	VLDB	0.00012323497
1,113	Approximate Closest Community Search in Networks	2016	VLDB	0.00012124571
1,647	Effective and Efficient Community Search over Large Heterogeneous Information Networks	2020	VLDB	0.00010125633
2,024	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	9.2907829e-05
2,035	RapidMatch: A Holistic Approach to Subgraph Query Processing	2021	VLDB	9.2787188e-05
2,190	Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching	2021	SIGMOD	8.9804702e-05
3,737	Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs	2020	SIGMOD	7.1609645e-05
4,008	When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks	2017	VLDB	6.9619668e-05
5,149	An Optimal and Progressive Approach to Online Search of Top-K Influential Communities	2018	VLDB	6.3459884e-05
6,179	Densely Connected User Community and Location Cluster Search in Location-Based Social Networks	2020	SIGMOD	5.9496108e-05
6,251	The Flexible Socio Spatial Group Queries	2019	VLDB	5.9415675e-05
7,006	Topic-based Community Search over Spatial-Social Networks	2020	VLDB	5.726836e-05
9,110	On Social-Temporal Group Query with Acquaintance Constraint	2011	VLDB	5.3221578e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	3,737	Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs	2020	SIGMOD
2	4,554	Anchored Densest Subgraph	2022	SIGMOD
3	2,024	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB
4	4,903	A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery	2022	SIGMOD
5	10,363	Efficient and Scalable Directed Densest Subgraph Discovery	2026	SIGMOD
6	6,179	Densely Connected User Community and Location Cluster Search in Location-Based Social Networks	2020	SIGMOD
7	5,491	DMCS : Density Modularity based Community Search	2022	SIGMOD
8	9,696	An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery	2024	SIGMOD
9	10,226	Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance	2026	SIGMOD
10	6,251	The Flexible Socio Spatial Group Queries	2019	VLDB