Efficient and Effective Algorithms for Clustering Uncertain Graphs
Summary: Clustering graphs with edge uncertainty under k-median and k-center objectives, maximizing probability to cluster centers. Gives (1-1/e)-approx for k-median and OPT_ck-approx to k-center; practical optimizations; experiments show speed and quality gains. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Kai Han
- 2. Fei Gui
- 3. Xiaokui Xiao
- 4. Jing Tang
- 5. Yuntian He
- 6. Zongmai Cao
- 7. He Huang
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,171 | Butterfly Counting on Uncertain Bipartite Graphs | 2022 | VLDB | 6.3879236e-05 |
| 5,478 | MEGA: Multi-View Semi-Supervised Clustering of Hypergraphs | 2020 | VLDB | 5.4851612e-05 |
| 6,171 | Shortest Paths and Centrality in Uncertain Networks | 2021 | VLDB | 5.170101e-05 |
| 8,907 | Shortest Paths Discovery in Uncertain Networks via Transfer Learning | 2023 | SIGMOD | 4.427232e-05 |
| 9,135 | Sage: A System for Uncertain Network Analysis | 2022 | VLDB | 4.3888791e-05 |
| 11,259 | Scaling Up Structural Clustering to Large Probabilistic Graphs Using Lyapunov Central Limit Theorem | 2023 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 14 of 14 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,406 | Efficient k-Clique Count Estimation with Accuracy Guarantee | 2024 | VLDB | 4.3441378e-05 |
| 4,984 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD | 5.7867286e-05 |
| 10,923 | k-Clustering with Comparison and Distance Oracles | 2024 | PODS | 4.1945683e-05 |
| 6,171 | Shortest Paths and Centrality in Uncertain Networks | 2021 | VLDB | 5.170101e-05 |
| 6,019 | Uncertain Centroid based Partitional Clustering of Uncertain Data | 2012 | VLDB | 5.2415551e-05 |
| 1,162 | k-Nearest Neighbors in Uncertain Graphs | 2010 | VLDB | 0.0001358105 |
| 5,908 | Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach | 2022 | SIGMOD | 5.2773278e-05 |
| 4,179 | The Pursuit of a Good Possible World: Extracting Representative Instances of Uncertain Graphs | 2014 | SIGMOD | 6.3800553e-05 |
| 1,860 | Approximation Algorithms for Clustering Uncertain Data | 2008 | PODS | 0.0001028857 |
| 6,545 | Clustering Uncertain Graphs | 2018 | VLDB | 5.0193115e-05 |