Algorithms for clustering data
Algorithms for clustering data
BIRCH: an efficient data clustering method for very large databases
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
CURE: an efficient clustering algorithm for large databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
OPTICS: ordering points to identify the clustering structure
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Data mining: concepts and techniques
Data mining: concepts and techniques
Introduction to Algorithms
A Framework for Generating Network-Based Moving Objects
Geoinformatica
Algorithms for Searching Massive Graphs
IEEE Transactions on Knowledge and Data Engineering
CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
HiTi Graph Model of Topographical Roadmaps in Navigation Systems
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
C2P: Clustering based on Closest Pairs
Proceedings of the 27th International Conference on Very Large Data Bases
Efficient and Effective Clustering Methods for Spatial Data Mining
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Aggregate Nearest Neighbor Queries in Road Networks
IEEE Transactions on Knowledge and Data Engineering
Density-based clustering of uncertain data
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Efficient and effective server-sided distributed clustering
Proceedings of the 14th ACM international conference on Information and knowledge management
Reverse Nearest Neighbors in Large Graphs
IEEE Transactions on Knowledge and Data Engineering
Capacity constrained assignment in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Continuous Clustering of Moving Objects in Spatial Networks
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II
Using clustering technique M-PAM in mobile network planning
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Optimal matching between spatial datasets under capacity constraints
ACM Transactions on Database Systems (TODS)
Effective density queries for moving objects in road networks
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Clustering moving objects in spatial networks
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
S-GRID: a versatile approach to efficient query processing in spatial networks
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Efficient successor retrieval operations for aggregate query processing on clustered road networks
Information Sciences: an International Journal
Spatio-temporal clustering of road network data
AICI'10 Proceedings of the 2010 international conference on Artificial intelligence and computational intelligence: Part I
STS: complex spatio-temporal sequence mining in flickr
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Direction-based surrounder queries for mobile recommendations
The VLDB Journal — The International Journal on Very Large Data Bases
Finding the most accessible locations: reverse path nearest neighbor query in road networks
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Mining outliers in spatial networks
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Probabilistic similarity join on uncertain data
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Ranking outliers using symmetric neighborhood relationship
PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Constrained shortest path computation
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
On trip planning queries in spatial databases
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Proceedings of the seventh ACM international workshop on Challenged networks
Dynamic k-means: a clustering technique for moving object trajectories
International Journal of Intelligent Information and Database Systems
Authentication of moving range queries
Proceedings of the 21st ACM international conference on Information and knowledge management
| Hi-index | 0.00 |
Clustering is one of the most important analysis tasks in spatial databases. We study the problem of clustering objects, which lie on edges of a large weighted spatial network. The distance between two objects is defined by their shortest path distance over the network. Past algorithms are based on the Euclidean distance and cannot be applied for this setting. We propose variants of partitioning, density-based, and hierarchical methods. Their effectiveness and efficiency is evaluated for collections of objects which appear on real road networks. The results show that our methods can correctly identify clusters and they are scalable for large problems.