Link prediction in dynamic social networks by integrating different types of information

2014 ◽  
Vol 42 (4) ◽  
pp. 738-750 ◽  
Author(s):  
Nahla Mohamed Ahmed Ibrahim ◽  
Ling Chen
2016 ◽  
Vol 43 (5) ◽  
pp. 683-695 ◽  
Author(s):  
Chuanming Yu ◽  
Xiaoli Zhao ◽  
Lu An ◽  
Xia Lin

With the rapid development of the Internet, the computational analysis of social networks has grown to be a salient issue. Various research analyses social network topics, and a considerable amount of attention has been devoted to the issue of link prediction. Link prediction aims to predict the interactions that might occur between two entities in the network. To this aim, this study proposed a novel path and node combined approach and constructed a methodology for measuring node similarities. The method was illustrated with five real datasets obtained from different types of social networks. An extensive comparison of the proposed method against existing link prediction algorithms was performed to demonstrate that the path and node combined approach achieved much higher mean average precision (MAP) and area under the curve (AUC) values than those that only consider common nodes (e.g. Common Neighbours and Adamic/Adar) or paths (e.g. Random Walk with Restart and FriendLink). The results imply that two nodes are more likely to establish a link if they have more common neighbours of lower degrees. The weight of the path connecting two nodes is inversely proportional to the product of degrees of nodes on the pathway. The combination of node and topological features can substantially improve the performance of similarity-based link prediction, compared with node-dependent and path-dependent approaches. The experiments also demonstrate that the path-dependent approaches outperform the node-dependent appraoches. This indicates that topological features of networks may contribute more to improving performance than node features.


Symmetry ◽  
2020 ◽  
Vol 12 (1) ◽  
pp. 100
Author(s):  
Xinyu Huang ◽  
Dongming Chen ◽  
Tao Ren

Social network analysis is a multidisciplinary study covering informatics, mathematics, sociology, management, psychology, etc. Link prediction, as one of the fundamental studies with a variety of applications, has attracted increasing focus from scientific society. Traditional research based on graph theory has made numerous achievements, whereas suffering from incapability of dealing with dynamic behaviors and low predicting accuracy. Aiming at addressing the problem, this paper employs a diagonally symmetrical supra-adjacency matrix to represent the dynamic social networks, and proposes a temporal links prediction framework combining with an improved gravity model. Extensive experiments on several real-world datasets verified the superiority on competitors, which benefits recommending friends in social networks. It is of remarkable significance in revealing the evolutions in temporal networks and promoting considerable commercial interest for social applications.


Author(s):  
Emily Erikson

This chapter identifies how organizational context affects individual behavior and the propensity to incorporate information from peers into important operational decisions. The identification of this relationship illuminates, in turn, the larger question of how—or the mechanisms by which—decentralization contributed to the pattern of innovation found in the English Company. The analysis focuses on evaluating the relative importance of different types of information in leading captains to choose trade in one port over another, including formal orders given by the Company, a personal history of contact with ports, and information transmitted via social networks from ship to ship. The results show that social networks were an important source of information for captains when deciding which port to travel to next.


2016 ◽  
Vol 28 (10) ◽  
pp. 2765-2777 ◽  
Author(s):  
Linhong Zhu ◽  
Dong Guo ◽  
Junming Yin ◽  
Greg Ver Steeg ◽  
Aram Galstyan

2014 ◽  
Vol 5 (5) ◽  
pp. 750-764 ◽  
Author(s):  
Catherine A. Bliss ◽  
Morgan R. Frank ◽  
Christopher M. Danforth ◽  
Peter Sheridan Dodds

Sign in / Sign up

Export Citation Format

Share Document