A topic community-based method for friend recommendation in large-scale online social networks

2016 ◽  
Vol 29 (6) ◽  
pp. e3924 ◽  
Author(s):  
Chaobo He ◽  
Hanchao Li ◽  
Xiang Fei ◽  
Atiao Yang ◽  
Yong Tang ◽  
...  
2019 ◽  
Vol 8 (9) ◽  
pp. 415
Author(s):  
Heba M. Wagih ◽  
Hoda M. O. Mokhtar ◽  
Samy S. Ghoniemy

Recently, social networks have shown huge potential in terms of collaborative web services and the study of peer influence as a result of the massive amount of data, datasets, and interrelations generated. These interrelations cannot guarantee the success of online social networks without ensuring the existence of trust between nodes. Detecting influential nodes improves collaborative filtering (CF) recommendations in which nodes with the highest influential capability are most likely to be the source of recommendations. Although CF-based recommendation systems are the most widely used approach for implementing recommender systems, this approach ignores the mutual trust between users. In this paper, a trust-based algorithm (TBA) is introduced to detect influential spreaders in social networks efficiently. In particular, the proposed TBA estimates the influence that each node has on the other connected nodes as well as on the whole network. Next, a Friend-of-Friend recommendation (FoF-SocialI) algorithm is addressed to detect the influence of social ties in the recommendation process. Finally, experimental results, performed on three large scale location-based social networks, namely, Brightkite, Gowalla, and Weeplaces, to test the efficiency of the proposed algorithm, are presented. The conducted experiments show a remarkable enhancement in predicting and recommending locations in various social networks.


Author(s):  
Kevin Ryczko ◽  
Adam Domurad ◽  
Nicholas Buhagiar ◽  
Isaac Tamblyn

2020 ◽  
Author(s):  
Kumaran P ◽  
Rajeswari Sridhar

Abstract Online social networks (OSNs) is a platform that plays an essential role in identifying misinformation like false rumors, insults, pranks, hoaxes, spear phishing and computational propaganda in a better way. Detection of misinformation finds its applications in areas such as law enforcement to pinpoint culprits who spread rumors to harm the society, targeted marketing in e-commerce to identify the user who originates dissatisfaction messages about products or services that harm an organizations reputation. The process of identifying and detecting misinformation is very crucial in complex social networks. As misinformation in social network is identified by designing and placing the monitors, computing the minimum number of monitors for detecting misinformation is a very trivial work in the complex social network. The proposed approach determines the top suspected sources of misinformation using a tweet polarity-based ranking system in tandem with sarcasm detection (both implicit and explicit sarcasm) with optimization approaches on large-scale incomplete network. The algorithm subsequently uses this determined feature to place the minimum set of monitors in the network for detecting misinformation. The proposed work focuses on the timely detection of misinformation by limiting the distance between the suspected sources and the monitors. The proposed work also determines the root cause of misinformation (provenance) by using a combination of network-based and content-based approaches. The proposed work is compared with the state-of-art work and has observed that the proposed algorithm produces better results than existing methods.


Sign in / Sign up

Export Citation Format

Share Document