scholarly journals Intelligent Link Prediction Management Based on Community Discovery and User Behavior Preference in Online Social Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Jun Ge ◽  
Lei-lei Shi ◽  
Lu Liu ◽  
Hongwei Shi ◽  
John Panneerselvam
Keyword(s):  
Social Networks ◽  
Community Detection ◽  
Network Structure ◽  
Online Social Networks ◽  
Link Prediction ◽  
User Behavior ◽  
Detection Algorithm ◽  
Factors Affecting ◽  
Friend Recommendation ◽  
Dynamic Community Detection

Link prediction in online social networks intends to predict users who are yet to establish their network of friends, with the motivation of offering friend recommendation based on the current network structure and the attributes of nodes. However, many existing link prediction methods do not consider important information such as community characteristics, text information, and growth mechanism. In this paper, we propose an intelligent data management mechanism based on relationship strength according to the characteristics of social networks for achieving a reliable prediction in online social networks. Secondly, by considering the network structure attributes and interest preference of users as important factors affecting the link prediction process in online social networks, we propose further improvements in the prediction process by designing a friend recommendation model with a novel incorporation of the relationship information and interest preference characteristics of users into the community detection algorithm. Finally, extensive experiments conducted on a Twitter dataset demonstrate the effectiveness of our proposed models in both dynamic community detection and link prediction.

scholarly journals Geographical Structural Features of the WeChat Social Networks

2020 ◽  
Vol 9 (5) ◽  
pp. 290
Author(s):  
Chuan Ai ◽  
Bin Chen ◽  
Hailiang Chen ◽  
Weihui Dai ◽  
Xiaogang Qiu
Keyword(s):  
Social Networks ◽  
Communication Networks ◽  
Community Detection ◽  
Online Social Networks ◽  
Statistical Models ◽  
Interaction Analysis ◽  
Structural Features ◽  
Detection Algorithm ◽  
Detection Methods ◽  
Characteristics Analysis

Recently, spatial interaction analysis of online social networks has become a big concern. Early studies of geographical characteristics analysis and community detection in online social networks have shown that nodes within the same community might gather together geographically. However, the method of community detection is based on the idea that there are more links within the community than that connect nodes in different communities, and there is no analysis to explain the phenomenon. The statistical models for network analysis usually investigate the characteristics of a network based on the probability theory. This paper analyzes a series of statistical models and selects the MDND model to classify links and nodes in social networks. The model can achieve the same performance as the community detection algorithm when analyzing the structure in the online social network. The construction assumption of the model explains the reasons for the geographically aggregating of nodes in the same community to a degree. The research provides new ideas and methods for nodes classification and geographic characteristics analysis of online social networks and mobile communication networks and makes up for the shortcomings of community detection methods that do not explain the principle of network generation. A natural progression of this work is to geographically analyze the characteristics of social networks and provide assistance for advertising delivery and Internet management.

A Coevolution Model of Network Structure and User Behavior: The Case of Content Generation in Online Social Networks

2019 ◽  
Vol 30 (1) ◽  
pp. 117-132
Author(s):  
Prasanta Bhattacharya ◽  
Tuan Q. Phan ◽  
Xue Bai ◽  
Edoardo M. Airoldi
Keyword(s):  
Social Networks ◽  
Network Structure ◽  
Online Social Networks ◽  
User Behavior ◽  
Content Generation

scholarly journals A Novel Similarity Measure of Link Prediction in Multi-Layer Social Networks Based on Reliable Paths

2021 ◽  
Author(s):  
Amin Rezaeipanah
Keyword(s):  
Social Networks ◽  
Similarity Measure ◽  
Network Structure ◽  
Online Social Networks ◽  
Link Prediction ◽  
Similarity Measures ◽  
Single Layer ◽  
Superior Performance ◽  
Local Similarity ◽  
Topological Features

Abstract Online social networks are an integral element of modern societies and significantly influence the formation and consolidation of social relationships. In fact, these networks are multi-layered so that there may be multiple links between a user’ on different social networks. In this paper, the link prediction problem for the same user in a two-layer social network is examined, where we consider Twitter and Foursquare networks. Here, information related to the two-layer communication is used to predict links in the Foursquare network. Link prediction aims to discover spurious links or predict the emergence of future links from the current network structure. There are many algorithms for link prediction in unweighted networks, however only a few have been developed for weighted networks. Based on the extraction of topological features from the network structure and the use of reliable paths between users, we developed a novel similarity measure for link prediction. Reliable paths have been proposed to develop unweight local similarity measures to weighted measures. Using these measures, both the existence of links and their weight can be predicted. Empirical analysis shows that the proposed similarity measure achieves superior performance to existing approaches and can more accurately predict future relationships. In addition, the proposed method has better results compared to single-layer networks. Experiments show that the proposed similarity measure has an advantage precision of 1.8% over the Katz and FriendLink measures.

scholarly journals Follow Me Too: Determinants of Transitive Tie Formation on Twitter

2020 ◽  
Vol 6 (3) ◽  
pp. 205630512093924
Author(s):  
Parul Malik ◽  
Seungyoon Lee
Keyword(s):  
Social Networks ◽  
Information Sharing ◽  
Network Structure ◽  
Online Social Networks ◽  
Strong Predictor ◽  
Key Factors ◽  
Factors Affecting ◽  
Strength Of Ties ◽  
Longitudinal Dataset

Transitivity, defined as the tendency for node A to be connected to node B given that A is connected to node X and X is connected to B, has been found to be a strong predictor of tie formation in various types of social networks. As transitive ties can influence information sharing, diffusion, and attitudes toward messages, understanding the motivations and mechanisms behind transitive tie formation in online social networks (OSNs) is important. Using a large longitudinal dataset from a popular OSN, Twitter, we examine the factors affecting transitivity. Results show that the strength of ties, activity like the number of tweets, and most importantly, the number of common connections are key factors affecting transitive tie formation. Theoretical implications regarding the evolution of network structure and polarization of views as well as practical suggestions for organizations aiming to accumulate followers for information sharing are discussed.

Complex network structure extraction based on community relevance

2020 ◽  
Vol 31 (04) ◽  
pp. 2050062
Author(s):  
Jingyi Ding ◽  
Licheng Jiao ◽  
Jianshe Wu ◽  
Fang Liu
Keyword(s):  
Computational Complexity ◽  
Community Detection ◽  
Network Structure ◽  
Link Prediction ◽  
Detection Algorithm ◽  
Node Degree ◽  
Network Function ◽  
Detection Algorithms ◽  
New Perspective ◽  
Community Detection Algorithm

One way to understand the network function and analyze the network structure is to find the communities of the network accurately. Now, there are many works about designing algorithms for community detection. Most community detection algorithms are based on modularity optimization. However, these methods not only have disadvantages in computational complexity, but also have the problem of resolution restriction. Designing a community detection algorithm that is fast and effective remains a challenge in the field. We attempt to solve the community detection problem in a new perspective in this paper, believing that the assumption used to solve the link prediction problem is useful for the problem of community detection. By using the similarity between modules of the network, we propose a new method to extract the community structure in this paper. Our algorithm consists of three steps. First, we initialize a community partition based on the distribution of the node degree; second, we calculate the similarity between different communities, where the similarity is the index to describe the closeness of the different communities. We assume that the much closer the two different communities are, the greater the likelihood of being divided together; finally, merge the pairs of communities which has the highest similarity value as possible as we can and stop when the condition is not satisfied. Because the convergence of our algorithm is very fast in the process of merging, we find that our method has advantages both in the computational complexity and in the accuracy when compared with other six classical algorithms. Moreover, we design a new measure to describe how difficulty the network division is.

scholarly journals A Novel Emerging Topic Identification and Evolution Discovery Method on Time-Evolving and Heterogeneous Online Social Networks

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Xiaoyan Xu ◽  
Wei Lv ◽  
Beibei Zhang ◽  
Shuaipeng Zhou ◽  
Wei Wei ◽  
...  
Keyword(s):  
Social Networks ◽  
Community Detection ◽  
Online Social Networks ◽  
Detection Method ◽  
Local Network ◽  
Evolution Law ◽  
Dynamic Community Detection ◽  
Heterogeneous Social Networks ◽  
Propagation Network ◽  
Dynamic Community

With the fast development of web 2.0, information generation and propagation among online users become deeply interweaved. How to effectively and immediately discover the new emerging topic and further how to uncover its evolution law are still wide open and urgently needed by both research and practical fields. This paper proposed a novel early emerging topic detection and its evolution law identification framework based on dynamic community detection method on time-evolving and scalable heterogeneous social networks. The framework is composed of three major steps. Firstly, a time-evolving and scalable complex network denoted as KeyGraph is built up by deeply analyzing the text features of all kinds of data crawled from heterogeneous online social network platforms; secondly, a novel dynamic community detection method is proposed by which the new emerging topic is detected on the modeled time-evolving and scalable KeyGraph network; thirdly, a unified directional topic propagation network modeled by a great number of short texts including microblogs and news titles is set up, and the topic evolution law of the previously detected early emerging topic is identified by fully utilizing local network variations and modularity optimization of the “time-evolving” and directional topic propagation network. Our method is proved to yield preferable results on both a huge amount of computer-generated test data and a great amount of real online network data crawled from mainstream heterogeneous social networks.

scholarly journals Product Recommendation based on Sybil and Trusted Votes in Social Networks

2019 ◽  
Vol 8 (3) ◽  
pp. 5434-5440
Keyword(s):  
Social Networks ◽  
Community Detection ◽  
Online Social Networks ◽  
Social Behaviour ◽  
Social World ◽  
Detection Algorithm ◽  
Information Gathering ◽  
Online Environment ◽  
The Social ◽  
Community Detection Algorithm

Networks is a platform which is easily accessible by normal users worldwide. Online Social Networks facilitates users online to get registered with ease of speed and create their own accounts to communicate with the social world for information gathering. This platform allows everyone to get registered online irrespective of their social behaviour. Users here are creating duplicate accounts that is creating Sybil in the network. By this Sybil online Social Networks are suffering for different kinds of Sybil attacks online. In social networks user’s feedback and preferences play an important role in suggesting friends online or recommending products online. When collecting the feedback or preferences of any product online both Sybil user’s and real user’s data is considered as we are not differentiating the Sybil user or real user. From this products, recommended online will not have an efficient rating which would divert the buyers online. To over this problem we propose Sybil Community Detection Algorithm (SCD) and TrustRank Algorithm that bifurcates real user votes and Sybil users votes to fetch the efficient products online thus build secure online environment.

Sign in / Sign up

Export Citation Format

Share Document