Partitioning road networks using density peak graphs: Efficiency vs. accuracy
Open Access
- 5 October 2016
- journal article
- research article
- Published by Elsevier BV in Information Systems
- Vol. 64, 22-40
- https://doi.org/10.1016/j.is.2016.09.006
Abstract
No abstract availableKeywords
Funding Information
- Australian Reasearch Council (ARC) Discovery Project (DP140103499)
- ARC Future Fellowship (FT120100723)
- Australian Government
- Australian Research Council
This publication has 30 references indexed in Scilit:
- A network partitioning methodology for distributed traffic management applicationsTransportmetrica A: Transport Science, 2013
- An incremental algorithm for clustering spatial data streams: exploring temporal localityKnowledge and Information Systems, 2013
- MNTG: An Extensible Web-Based Traffic GeneratorLecture Notes in Computer Science, 2013
- On the spatial partitioning of urban transportation networksTransportation Research Part B: Methodological, 2012
- SBV-Cut: Vertex-cut based graph partitioning using structural balance verticesData & Knowledge Engineering, 2012
- Clustering and aggregating clues of trajectories for mining trajectory patterns and routesThe VLDB Journal, 2011
- Density‐based clusteringWIREs Data Mining and Knowledge Discovery, 2011
- Distributed Spatial Clustering in Sensor NetworksLecture Notes in Computer Science, 2006
- A Spectral Clustering Approach To Finding Communities in GraphsPublished by Society for Industrial & Applied Mathematics (SIAM) ,2005
- Normalized cuts and image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000