ALID: Scalable Dominant Cluster Detection
Summary: ALID detects dense dominant clusters without materializing the quadratic affinity graph, using ROI-guided localized infection-immunization dynamics and candidate-infective search. It provides quality guarantees with complexity tied to cluster size and scales to 50M SIFT points via Spark parallelization. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Lingyang Chu (Chinese Academy of Sciences)
- 2. Shuhui Wang (Chinese Academy of Sciences)
- 3. Siyuan Liu (Carnegie Mellon University)
- 4. Qingming Huang (University of Chinese Academy of Sciences)
- 5. Jian Pei (Simon Fraser University)
BibTeX Citation
@article{chu_vldb15,
title = {{ALID: Scalable Dominant Cluster Detection}},
author = {Chu, Lingyang and Wang, Shuhui and Liu, Siyuan and Huang, Qingming and Pei, Jian},
journal = {PVLDB},
series = {{VLDB} '15},
volume = {8},
number = {8},
pages = {826--837},
doi = {10.14778/2757807.2757808},
url = {https://doi.org/10.14778/2757807.2757808},
year = {2015}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,946 | Online Density Bursting Subgraph Detection from Temporal Graphs | 2019 | VLDB | 7.8250028e-05 |
| 12,166 | Finding Theme Communities from Database Networks | 2019 | VLDB | 4.9793485e-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 |
|---|---|---|---|---|
| 988 | Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification | 2012 | VLDB | 0.00012660447 |
| 2,128 | Scalable K-Means++ | 2012 | VLDB | 8.9964096e-05 |
| 3,902 | CSV: Visualizing and Mining Cohesive Subgraphs | 2008 | SIGMOD | 6.9340634e-05 |
| 8,101 | PAnG - Finding Patterns in Annotation Graphs | 2012 | SIGMOD | 5.3942942e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,412 | Scaling Up k-Clique Densest Subgraph Detection | 2023 | SIGMOD |
| 2 | 4,923 | A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery | 2022 | SIGMOD |
| 3 | 4,184 | YADING: Fast Clustering of Large-Scale Time Series Data | 2015 | VLDB |
| 4 | 5,386 | PREDIcT: Towards Predicting the Runtime of Large Scale Iterative Analytics | 2013 | VLDB |
| 5 | 6,773 | GAIA: Graph Classification Using Evolutionary Computation | 2010 | SIGMOD |
| 6 | 10,562 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD |
| 7 | 11,321 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB |
| 8 | 9,963 | Fast and Space-Efficient Parallel Algorithms for Influence Maximization | 2024 | VLDB |
| 9 | 13,768 | Scalable Community Detection via Parallel Correlation Clustering | 2021 | VLDB |
| 10 | 3,574 | Scalable Discovery of Best Clusters on Large Graphs | 2010 | VLDB |