Indexed by:
Abstract:
To solve the problem that the existing clustering technology cannot adapt to the clustering problem of large-scale spatial network objects, an efficient method of clustering objects for spatial network was proposed in this paper, which can effectively reduce the time complexity and space complexity. First, blocks were clustered based on buckets for non-empty edges in the network. Then, the CB-graph was constructed, and finally the connected sub-graphs of the CB-graph was found, where each connected sub-graph was a cluster. The experimental results demonstrate that the proposed method has good efficiency and scalability while guaranteeing accuracy. © 2019, Editorial Department of Journal of Beijing University of Technology. All right reserved.
Keyword:
Reprint Author's Address:
Email:
Source :
Journal of Beijing University of Technology
ISSN: 0254-0037
Year: 2019
Issue: 6
Volume: 45
Page: 524-533
Cited Count:
WoS CC Cited Count: 0
SCOPUS Cited Count:
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 11
Affiliated Colleges: