Clustering Objects on a Spatial Network
Summary: Clustering objects on edges of a spatial network using shortest-path distance, not Euclidean. Introduces partitioning, density-based, and hierarchical variants; evaluated on road networks; scalable, effective at identifying network-aware clusters. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Man Lung Yiu (University of Hong Kong)
- 2. Nikos Mamoulis (University of Hong Kong)
BibTeX Citation
@inproceedings{yiu_sigmod04,
title = {{Clustering Objects on a Spatial Network}},
author = {Yiu, Man Lung and Mamoulis, Nikos},
series = {{SIGMOD} '04},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/1007568.1007619},
url = {https://dl.acm.org/doi/10.1145/1007568.1007619},
year = {2004}
}
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,327 | Capacity Constrained Assignment in Spatial Databases | 2008 | SIGMOD | 8.7476945e-05 |
| 4,651 | Density-based Place Clustering in Geo-Social Networks | 2014 | SIGMOD | 6.585234e-05 |
| 9,632 | Fast Network K-function-based Spatial Analysis | 2022 | VLDB | 5.2434488e-05 |
| 11,697 | Fast Augmentation Algorithms for Network Kernel Density Visualization | 2021 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 31 | BIRCH: An Efficient Data Clustering Method for Very Large Databases | 1996 | SIGMOD | 0.00050347119 |
| 88 | Efficient and Effective Clustering Methods for Spatial Data Mining | 1994 | VLDB | 0.00035240327 |
| 291 | OPTICS: Ordering Points To Identify the Clustering Structure | 1999 | SIGMOD | 0.00022264197 |
| 351 | CURE: An Efficient Clustering Algorithm for Large Databases | 1998 | SIGMOD | 0.00020424271 |
| 449 | Query Processing in Spatial Network Databases | 2003 | VLDB | 0.0001826404 |
| 7,023 | C2P: Clustering based on Closest Pairs | 2001 | VLDB | 5.7242118e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,796 | The Impact of Global Clustering on Spatial Database Systems | 1994 | VLDB |
| 2 | 2,629 | Distance Indexing on Road Networks | 2006 | VLDB |
| 3 | 3,637 | Roads, Codes, and Spatiotemporal Queries | 2004 | PODS |
| 4 | 5,208 | Efficient Shortest Path Counting on Large Road Networks | 2022 | VLDB |
| 5 | 9,111 | Efficient Algorithms for Finding Optimal Meeting Point on Road Networks | 2011 | VLDB |
| 6 | 949 | Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation | 2012 | VLDB |
| 7 | 4,651 | Density-based Place Clustering in Geo-Social Networks | 2014 | SIGMOD |
| 8 | 665 | Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases | 2004 | VLDB |
| 9 | 5,112 | Fast Large-Scale Trajectory Clustering | 2020 | VLDB |
| 10 | 433 | Scalable Network Distance Browsing in Spatial Databases | 2008 | SIGMOD |