Partitioning road networks using density peak graphs: Efficiency vs. accuracy

详细信息    查看全文

• 作者：Tarique Anwar^a ; ^c ; ^{tAnwar@swin.edu.au} ; Chengfei Liu^a ; ^{cliu@swin.edu.au} ; Hai L. Vu^a ; ^{hvu@swin.edu.au} ; Christopher Leckie^b ; ^c ; ^{caleckie@unimelb.edu.au}
• 关键词：Spatial partitioning ; Road networks ; Spectral clustering ; Density peak graph
• 刊名：Information Systems
• 出版年：2017
• 出版时间：March 2017
• 年：2017
• 卷：64
• 期：Complete
• 页码：22-40
• 全文大小：3397 K
• 卷排序：64

文摘

An effective as well as efficient road network partitioning framework using both density and spectral based clustering. A fast density-based road network partitioning method FaDPa (extended to FaDPa+) is developed. Using FaDPa, a spectral based method FaDSPa is developed for partitioning small as well as large road networks. The complete derivation to optimize the αα-Cut objective function (proposed in Anwar et al., EDBT 2014) is presented. Extensive experiments are conducted on real as well as synthetic datasets.