Node-attributed Spatial Graph Partitioning
Node-attributed Spatial Graph Partitioning
复制标题
节点属性空间图划分
DOI:
10.1145/3397536.3422198
复制
发表时间:
2020
期刊:
影响因子:
--
通讯作者:
Yang, KwangSoo
中科院分区:
文献类型:
--
作者:
Bereznyi, Daniel;Qutbuddin, Ahmad;Her, YoungGu;Yang, KwangSoo
Given a spatial graph and a set of node attributes, the Node-attributed Spatial Graph Partitioning (NSGP) problem partitions a node-attributed spatial graph into k homogeneous sub-graphs that minimize both the total RMSErank1 and edge-cuts while meeting a size constraint on the sub-graphs. RMSErank1 is the Root Mean Square Error between a matrix and its rank-one decomposition. The NSGP problem is important for many societal applications such as identifying homogeneous communities in a spatial graph and detecting interrelated patterns in traffic accidents. This problem is NP-hard; it is computationally challenging because of the large size of spatial graphs and the constraint that the sub-graphs must be homogeneous, i.e. similar in terms of node attributes. This paper proposes a novel approach for finding a set of homogeneous sub-graphs that can minimize both the total RMSErank1 and edge-cuts while meeting the size constraint. Experiments and a case study using U.S. Census datasets and HP#6 watershed network datasets demonstrate that the proposed approach partitions a spatial graph into a set of homogeneous sub-graphs and reduces the computational cost.
DOI:
--
发表时间:
2015
期刊:
影响因子:
--
作者:
P. Tan;M. Steinbach;Vipin Kumar
通讯作者:
Vipin Kumar
DOI:
10.1007/978-1-4302-0248-6_11
发表时间:
2019-04
期刊:
Scalable Comput. Pract. Exp.
影响因子:
--
作者:
Chet Langin
通讯作者:
Chet Langin
DOI:
--
发表时间:
2016
期刊:
影响因子:
--
作者:
H. Rathjens;K. Bieger;I. Chaubey;J. Arnold;P. Allen;R. Srinivasan;D. Bosch;M. Volk
通讯作者:
M. Volk