TY - GEN
T1 - Dynamic Social Networks Generator Based on Modularity
T2 - 2nd International Conference on Data Intelligence and Security, ICDIS 2019
AU - Duan, Binyao
AU - Luo, Wenjian
AU - Jiang, Hao
AU - Ni, Li
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/6
Y1 - 2019/6
N2 - Continuous change is one of the key features of social networks, and the analysis and mining of dynamic social networks are of significant value. However, it is not easy to obtain real-world dynamic social networks. Thus, the artificial generation of dynamic social networks is very valuable. The dynamic social network generators that exist thus far usually generate social networks with specific operations, such as edge/node add/delete and community merge/split. In this paper, we describe the design of a dynamic social network generator based on modularity, called DSNG-M. DSNG-M initially takes a static social network and by flipping edges generates time-evolving social networks with the expected modularity, where the expected modularity at each time step is calculated based on the community structure of the original static social network. Thus, the generated networks and the original network have a common intrinsic structure, while the connections between nodes vary in the evolutionary process. We conducted experiments to analyze the change in the network characteristics of the generated social networks, such as the number of edges, degrees of nodes, and average distances between nodes. Experiments were also conducted to verify that the aggregation of multioral social networks can reflect the community structure of the original social network and to analyze the effects of the generator's parameter on the time cost.
AB - Continuous change is one of the key features of social networks, and the analysis and mining of dynamic social networks are of significant value. However, it is not easy to obtain real-world dynamic social networks. Thus, the artificial generation of dynamic social networks is very valuable. The dynamic social network generators that exist thus far usually generate social networks with specific operations, such as edge/node add/delete and community merge/split. In this paper, we describe the design of a dynamic social network generator based on modularity, called DSNG-M. DSNG-M initially takes a static social network and by flipping edges generates time-evolving social networks with the expected modularity, where the expected modularity at each time step is calculated based on the community structure of the original static social network. Thus, the generated networks and the original network have a common intrinsic structure, while the connections between nodes vary in the evolutionary process. We conducted experiments to analyze the change in the network characteristics of the generated social networks, such as the number of edges, degrees of nodes, and average distances between nodes. Experiments were also conducted to verify that the aggregation of multioral social networks can reflect the community structure of the original social network and to analyze the effects of the generator's parameter on the time cost.
KW - Social network
KW - benchmark
KW - dynamic social network
KW - modularity
UR - https://www.scopus.com/pages/publications/85074188800
U2 - 10.1109/ICDIS.2019.00032
DO - 10.1109/ICDIS.2019.00032
M3 - 会议稿件
AN - SCOPUS:85074188800
T3 - Proceedings - 2019 2nd International Conference on Data Intelligence and Security, ICDIS 2019
SP - 167
EP - 173
BT - Proceedings - 2019 2nd International Conference on Data Intelligence and Security, ICDIS 2019
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 28 June 2019 through 30 June 2019
ER -