SCAN++: Efficient Algorithm for Finding Clusters, Hubs and Outliers on Large-scale Graphs
Summary: SCAN++ accelerates SCAN’s joint discovery of clusters, hubs, and outliers in large graphs using DTAR, a two-hop reachability structure that prunes and shares density evaluations. It preserves SCAN’s exact results while substantially reducing runtime. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Hiroaki Shiokawa (Nippon Telegraph and Telephone Software Innovation Center; University of Tsukuba)
- 2. Yasuhiro Fujiwara (Nippon Telegraph and Telephone Software Innovation Center)
- 3. Makoto Onizuka (Osaka University)
BibTeX Citation
@article{shiokawa_vldb15,
title = {{SCAN++: Efficient Algorithm for Finding Clusters, Hubs and Outliers on Large-scale Graphs}},
author = {Shiokawa, Hiroaki and Fujiwara, Yasuhiro and Onizuka, Makoto},
journal = {PVLDB},
series = {{VLDB} '15},
volume = {8},
number = {11},
doi = {10.14778/2809974.2809980},
url = {https://doi.org/10.14778/2809974.2809980},
year = {2015}
}Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,482 | Efficient Structural Graph Clustering: An Index-Based Approach | 2018 | VLDB | 8.5183361e-05 |
| 4,358 | Parallel Index-Based Structural Graph Clustering and Its Approximation | 2021 | SIGMOD | 6.7459836e-05 |
| 4,423 | Dynamic Structural Clustering on Graphs | 2021 | SIGMOD | 6.7107949e-05 |
| 7,141 | Effective Indexing for Dynamic Structural Graph Clustering | 2022 | VLDB | 5.6920203e-05 |
| 9,444 | An Efficient Algorithm for Distance-based Structural Graph Clustering | 2023 | SIGMOD | 5.2675506e-05 |
| 10,567 | FB*: A Compact Index for Efficient and Exact Density-based Clustering | 2026 | VLDB | 5.093636e-05 |
| 11,992 | Scaling Locally Linear Embedding | 2017 | SIGMOD | 5.093636e-05 |
| 13,538 | Fast Algorithm for the Lasso based L1-Graph Construction | 2017 | VLDB | - |
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 |
|---|---|---|---|---|
| 3 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0012250108 |
| 102 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.00034255289 |
| 262 | On Triangulation-based Dense Neighborhood Graph Discovery | 2011 | VLDB | 0.00023084332 |
| 12,153 | Scaling Manifold Ranking Based Image Retrieval | 2015 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 364 | Graph Clustering Based on Structural/Attribute Similarities | 2009 | VLDB |
| 2 | 10,363 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD |
| 3 | 9,634 | Fast and Exact Outlier Detection in Metric Spaces: A Proximity Graph-based Approach | 2021 | SIGMOD |
| 4 | 9,690 | Searching and Detecting Structurally Similar Communities in Large Heterogeneous Information Networks | 2025 | VLDB |
| 5 | 3,511 | Scalable Discovery of Best Clusters on Large Graphs | 2010 | VLDB |
| 6 | 3,737 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD |
| 7 | 4,358 | Parallel Index-Based Structural Graph Clustering and Its Approximation | 2021 | SIGMOD |
| 8 | 7,141 | Effective Indexing for Dynamic Structural Graph Clustering | 2022 | VLDB |
| 9 | 2,482 | Efficient Structural Graph Clustering: An Index-Based Approach | 2018 | VLDB |
| 10 | 9,444 | An Efficient Algorithm for Distance-based Structural Graph Clustering | 2023 | SIGMOD |