A Novel Functional Network Based on Three-way Decision for Link Prediction in Signed Social Networks

Author(s):  
Qun Liu ◽  
Ying Chen ◽  
Gangqiang Zhang ◽  
Guoyin Wang
2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Saeed Reza Shahriary ◽  
Mohsen Shahriari ◽  
Rafidah MD Noor

In signed social networks, relationships among nodes are of the types positive (friendship) and negative (hostility). One absorbing issue in signed social networks is predicting sign of edges among people who are members of these networks. Other than edge sign prediction, one can define importance of people or nodes in networks via ranking algorithms. There exist few ranking algorithms for signed graphs; also few studies have shown role of ranking in link prediction problem. Hence, we were motivated to investigate ranking algorithms availed for signed graphs and their effect on sign prediction problem. This paper makes the contribution of using community detection approach for ranking algorithms in signed graphs. Therefore, community detection which is another active area of research in social networks is also investigated in this paper. Community detection algorithms try to find groups of nodes in which they share common properties like similarity. We were able to devise three community-based ranking algorithms which are suitable for signed graphs, and also we evaluated these ranking algorithms via sign prediction problem. These ranking algorithms were tested on three large-scale datasets: Epinions, Slashdot, and Wikipedia. We indicated that, in some cases, these ranking algorithms outperform previous works because their prediction accuracies are better.


Entropy ◽  
2015 ◽  
Vol 17 (4) ◽  
pp. 2140-2169 ◽  
Author(s):  
Feng Liu ◽  
Bingquan Liu ◽  
Chengjie Sun ◽  
Ming Liu ◽  
Xiaolong Wang

2018 ◽  
Vol 49 (2) ◽  
pp. 703-722 ◽  
Author(s):  
Shensheng Gu ◽  
Ling Chen ◽  
Bin Li ◽  
Wei Liu ◽  
Bolun Chen

2019 ◽  
Vol 23 (22) ◽  
pp. 12123-12138 ◽  
Author(s):  
Nancy Girdhar ◽  
Sonajharia Minz ◽  
K. K. Bharadwaj

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Huaizhen Kou ◽  
Fan Wang ◽  
Chao Lv ◽  
Zhaoan Dong ◽  
Wanli Huang ◽  
...  

With the development of mobile Internet, more and more individuals and institutions tend to express their views on certain things (such as software and music) on social platforms. In some online social network services, users are allowed to label users with similar interests as “trust” to get the information they want and use “distrust” to label users with opposite interests to avoid browsing content they do not want to see. The networks containing such trust relationships and distrust relationships are named signed social networks (SSNs), and some real-world complex systems can be also modeled with signed networks. However, the sparse social relationships seriously hinder the expansion of users’ social circle in social networks. In order to solve this problem, researchers have done a lot of research on link prediction. Although these studies have been proved to be effective in the unsigned social network, the prediction of trust and distrust in SSN has not achieved good results. In addition, the existing link prediction research does not consider the needs of user privacy protection, so most of them do not add privacy protection measures. To solve these problems, we propose a trust-based missing link prediction method (TMLP). First, we use the simhash method to create a hash index for each user. Then, we calculate the Hamming distance between the two users to determine whether they can establish a new social relationship. Finally, we use the fuzzy computing model to determine the type of their new social relationship (e.g., trust or distrust). In the paper, we gradually explain our method through a case study and prove our method’s feasibility.


Sign in / Sign up

Export Citation Format

Share Document