Modeling Large-Scale Dynamic Social Networks via Node Embeddings

2019 ◽  
Vol 31 (10) ◽  
pp. 1994-2007 ◽  
Author(s):  
Aakas Zhiyuli ◽  
Xun Liang ◽  
Yanfang Chen ◽  
Xiaoyong Du
Keyword(s):  
Social Networks ◽  
Large Scale ◽  
Dynamic Social Networks ◽  
Node Embeddings

Large-scale dynamic social data representation for structure feature learning

2020 ◽  
Vol 39 (4) ◽  
pp. 5253-5262
Author(s):  
Xiaoxian Zhang ◽  
Jianpei Zhang ◽  
Jing Yang
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Large Scale ◽  
Dynamic Change ◽  
Feature Learning ◽  
Data Representation ◽  
Feature Representation ◽  
Small Scale ◽  
Dynamic Feature ◽  
Dynamic Social Networks

The problems caused by network dimension disasters and computational complexity have become an important issue to be solved in the field of social network research. The existing methods for network feature learning are mostly based on static and small-scale assumptions, and there is no modified learning for the unique attributes of social networks. Therefore, existing learning methods cannot adapt to the dynamic and large-scale of current social networks. Even super large scale and other features. This paper mainly studies the feature representation learning of large-scale dynamic social network structure. In this paper, the positive and negative damping sampling of network nodes in different classes is carried out, and the dynamic feature learning method for newly added nodes is constructed, which makes the model feasible for the extraction of structural features of large-scale social networks in the process of dynamic change. The obtained node feature representation has better dynamic robustness. By selecting the real datasets of three large-scale dynamic social networks and the experiments of dynamic link prediction in social networks, it is found that DNPS has achieved a large performance improvement over the benchmark model in terms of prediction accuracy and time efficiency. When the α value is around 0.7, the model effect is optimal.

Crowd attraction-driven community evolution on social network

2021 ◽  
pp. 2250009
Author(s):  
Fuzhong Nian ◽  
Li Luo ◽  
Xuelong Yu
Keyword(s):  
Social Networks ◽  
Community Structure ◽  
Social Network ◽  
Large Scale ◽  
Detection Algorithm ◽  
Information Propagation ◽  
Evolution Analysis ◽  
Dynamic Social Networks ◽  
Community Evolution ◽  
Community Detection Algorithm

The evolution analysis of community structure of social network will help us understand the composition of social organizations and the evolution of society better. In order to discover the community structure and the regularity of community evolution in large-scale social networks, this paper analyzes the formation process and influencing factors of communities, and proposes a community evolution analysis method of crowd attraction driven. This method uses the traditional community division method to divide the basic community, and introduces the theory of information propagation into complex network to simulate the information propagation of dynamic social networks. Then defines seed node, the activity of basic community and crowd attraction to research the influence of groups on individuals in social networks. Finally, making basic communities as fixed groups in the network and proposing community detection algorithm based on crowd attraction. Experimental results show that the scheme can effectively detect and identify the community structure in large-scale social networks.

scholarly journals Stacked Community Prediction: A Distributed Stacking-Based Community Extraction Methodology for Large Scale Social Networks

2021 ◽  
Vol 5 (1) ◽  
pp. 14
Author(s):  
Christos Makris ◽  
Georgios Pispirigos
Keyword(s):  
Social Networks ◽  
Graph Partitioning ◽  
Large Scale ◽  
Real Life ◽  
Information Networks ◽  
Digital Marketing ◽  
Partitioning Problems ◽  
Iterative Solutions ◽  
Community Extraction ◽  
Stability And Accuracy

Nowadays, due to the extensive use of information networks in a broad range of fields, e.g., bio-informatics, sociology, digital marketing, computer science, etc., graph theory applications have attracted significant scientific interest. Due to its apparent abstraction, community detection has become one of the most thoroughly studied graph partitioning problems. However, the existing algorithms principally propose iterative solutions of high polynomial order that repetitively require exhaustive analysis. These methods can undoubtedly be considered resource-wise overdemanding, unscalable, and inapplicable in big data graphs, such as today’s social networks. In this article, a novel, near-linear, and highly scalable community prediction methodology is introduced. Specifically, using a distributed, stacking-based model, which is built on plain network topology characteristics of bootstrap sampled subgraphs, the underlined community hierarchy of any given social network is efficiently extracted in spite of its size and density. The effectiveness of the proposed methodology has diligently been examined on numerous real-life social networks and proven superior to various similar approaches in terms of performance, stability, and accuracy.

scholarly journals Influenza epidemic model using dynamic social networks of individuals with cognition maps

MethodsX ◽  
2020 ◽  
Vol 7 ◽  
pp. 101030
Author(s):  
Leonardo López ◽  
Maximiliano Fernández ◽  
Leonardo Giovanini
Keyword(s):  
Social Networks ◽  
Epidemic Model ◽  
Influenza Epidemic ◽  
Dynamic Social Networks

Evolutionary Community Discovery in Dynamic Social Networks via Resistance Distance

2020 ◽  
pp. 114536
Author(s):  
Weimin Li ◽  
Heng Zhu ◽  
Shaohua Li ◽  
Hao Wang ◽  
Hongning Dai ◽  
...  
Keyword(s):  
Social Networks ◽  
Resistance Distance ◽  
Community Discovery ◽  
Dynamic Social Networks
Sign in / Sign up

Export Citation Format

Share Document