Influence maximisation in social networks: A target-oriented estimation

2018 ◽  
Vol 44 (5) ◽  
pp. 671-682 ◽  
Author(s):  
Yun-Yong Ko ◽  
Dong-Kyu Chae ◽  
Sang-Wook Kim

Influence maximisation (IM) is the problem of finding a set of k-seed nodes that could maximize the amount of influence spread in a social network. In this article, we point out that the existing methods are taking the source-oriented estimation (SOE), which is the main reason of their failure in accurately estimating the amount of potential influence spread of an individual node. We propose a novel target-oriented estimation (TOE) that understands information diffusion more accurately as well as remedies the drawback of the existing methods. Our extensive experiments on four real-world datasets demonstrate that our proposed method outperforms the existing methods consistently with respect to the quality of the selected seed set.

2021 ◽  
Author(s):  
Syeda Nadia Firdaus

Social network is a hot topic of interest for researchers in the field of computer science in recent years. These social networks such as Facebook, Twitter, Instagram play an important role in information diffusion. Social network data are created by its users. Users’ online activities and behavior have been studied in various past research efforts in order to get a better understanding on how information is diffused on social networks. In this study, we focus on Twitter and we explore the impact of user behavior on their retweet activity. To represent a user’s behavior for predicting their retweet decision, we introduce 10-dimentional emotion and 35-dimensional personality related features. We consider the difference of a user being an author and a retweeter in terms of their behaviors, and propose a machine learning based retweet prediction model considering this difference. We also propose two approaches for matrix factorization retweet prediction model which learns the latent relation between users and tweets to predict the user’s retweet decision. In the experiment, we have tested our proposed models. We find that models based on user behavior related features provide good improvement (3% - 6% in terms of F1- score) over baseline models. By only considering user’s behavior as a retweeter, the data processing time is reduced while the prediction accuracy is comparable to the case when both retweeting and posting behaviors are considered. In the proposed matrix factorization models, we include tweet features into the basic factorization model through newly defined regularization terms and improve the performance by 3% - 4% in terms of F1-score. Finally, we compare the performance of machine learning and matrix factorization models for retweet prediction and find that none of the models is superior to the other in all occasions. Therefore, different models should be used depending on how prediction results will be used. Machine learning model is preferable when a model’s performance quality is important such as for tweet re-ranking and tweet recommendation. Matrix factorization is a preferred option when model’s positive retweet prediction capability is more important such as for marketing campaign and finding potential retweeters.


2021 ◽  
Author(s):  
Syeda Nadia Firdaus

Social network is a hot topic of interest for researchers in the field of computer science in recent years. These social networks such as Facebook, Twitter, Instagram play an important role in information diffusion. Social network data are created by its users. Users’ online activities and behavior have been studied in various past research efforts in order to get a better understanding on how information is diffused on social networks. In this study, we focus on Twitter and we explore the impact of user behavior on their retweet activity. To represent a user’s behavior for predicting their retweet decision, we introduce 10-dimentional emotion and 35-dimensional personality related features. We consider the difference of a user being an author and a retweeter in terms of their behaviors, and propose a machine learning based retweet prediction model considering this difference. We also propose two approaches for matrix factorization retweet prediction model which learns the latent relation between users and tweets to predict the user’s retweet decision. In the experiment, we have tested our proposed models. We find that models based on user behavior related features provide good improvement (3% - 6% in terms of F1- score) over baseline models. By only considering user’s behavior as a retweeter, the data processing time is reduced while the prediction accuracy is comparable to the case when both retweeting and posting behaviors are considered. In the proposed matrix factorization models, we include tweet features into the basic factorization model through newly defined regularization terms and improve the performance by 3% - 4% in terms of F1-score. Finally, we compare the performance of machine learning and matrix factorization models for retweet prediction and find that none of the models is superior to the other in all occasions. Therefore, different models should be used depending on how prediction results will be used. Machine learning model is preferable when a model’s performance quality is important such as for tweet re-ranking and tweet recommendation. Matrix factorization is a preferred option when model’s positive retweet prediction capability is more important such as for marketing campaign and finding potential retweeters.


2021 ◽  
Vol 27 (7) ◽  
pp. 667-692
Author(s):  
Lamia Berkani ◽  
Lylia Betit ◽  
Louiza Belarif

Clustering-based approaches have been demonstrated to be efficient and scalable to large-scale data sets. However, clustering-based recommender systems suffer from relatively low accuracy and coverage. To address these issues, we propose in this article an optimized multiview clustering approach for the recommendation of items in social networks. First, the selection of the initial medoids is optimized using the Bees Swarm optimization algorithm (BSO) in order to generate better partitions (i.e. refining the quality of medoids according to the objective function). Then, the multiview clustering (MV) is applied, where users are iteratively clustered from the views of both rating patterns and social information (i.e. friendships and trust). Finally, a framework is proposed for testing the different alternatives, namely: (1) the standard recommendation algorithms; (2) the clustering-based and the optimized clustering-based recommendation algorithms using BSO; and (3) the MV and the optimized MV (BSO-MV) algorithms. Experimental results conducted on two real-world datasets demonstrate the effectiveness of the proposed BSO-MV algorithm in terms of improving accuracy, as it outperforms the existing related approaches and baselines.


2020 ◽  
Vol 17 (12) ◽  
pp. 5224-5228
Author(s):  
Indraah Kolandaisamy ◽  
Raenu Kolandaisamy

In the era of technology advancement and COVID-19 outbreak period, all physical classes have been converted to online classes through social network platforms. Having online classes through social networks are actually very comfortable and flexible for students as they can have their classes at various places. This paper is focuses on the relationship between usages of social network and the quality of education during COVID-19 outbreak.


2009 ◽  
pp. 1521-1546
Author(s):  
Hugo Liu ◽  
Pattie Maes ◽  
Glorianna Davenport

Popular online social networks such as Friendster and MySpace do more than simply reveal the superficial structure of social connectedness—the rich meanings bottled within social network profiles themselves imply deeper patterns of culture and taste. If these latent semantic fabrics of taste could be harvested formally, the resultant resource would afford completely novel ways for representing and reasoning about web users and people in general. This paper narrates the theory and technique of such a feat—the natural language text of 100,000 social network profiles were captured, mapped into a diverse ontology of music, books, films, foods, etc., and machine learning was applied to infer a semantic fabric of taste. Taste fabrics bring us closer to improvisational manipulations of meaning, and afford us at least three semantic functions—the creation of semantically flexible user representations, cross-domain taste-based recommendation, and the computation of taste-similarity between people— whose use cases are demonstrated within the context of three applications—the InterestMap, Ambient Semantics, and IdentityMirror. Finally, we evaluate the quality of the taste fabrics, and distill from this research reusable methodologies and techniques of consequence to the semantic mining and Semantic Web communities.


Author(s):  
Ruchi Mittal ◽  
M.P.S Bhatia

Nowadays, social media is one of the popular modes of interaction and information diffusion. It is commonly found that the main source of information diffusion is done by some entities and such entities are also called as influencers. An influencer is an entity or individual who has the ability to influence others because of his/her relationship or connection with his/her audience. In this article, we propose a methodology to classify influencers from multi-layer social networks. A multi-layer social network is the same as a single layer social network depict that it includes multiple properties of a node and modeled them into multiple layers. The proposed methodology is a fusion of machine learning techniques (SVM, neural networks and so on) with centrality measures. We demonstrate the proposed algorithm on some real-life networks to validate the effectiveness of the approach in multi-layer systems.


2019 ◽  
Vol 2019 ◽  
pp. 1-16
Author(s):  
Yunpeng Gao ◽  
Nan Zhang

Social Internet of Things (SIoT) integrates social network schemes into Internet of Things (IoT), which provides opportunities for IoT objects to form social communities. Existing social network models have been adopted by SIoT paradigm. The wide distribution of IoT objects and openness of social networks, however, make it more challenging to preserve privacy of IoT users. In this paper, we present a novel framework that preserves privacy against inference attacks on social network data through ranked retrieval models. We propose PVS, a privacy-preserving framework that involves the design of polymorphic value sets and ranking functions. PVS enables polymorphism of private attributes by allowing them to respond to different queries in different ways. We begin this work by identifying two classes of adversaries, authenticity-ignorant adversary, and authenticity-knowledgeable adversary, based on their knowledge of the distribution of private attributes. Next, we define the measurement functions of utility loss and propose PVSV and PVST that preserve privacy against authenticity-ignorant and authenticity-knowledgeable adversaries, respectively. We take into account the utility loss of query results in the design of PVSV and PVST. Finally, we show that PVSV and PVST meet the privacy guarantee with acceptable utility loss in extensive experiments over real-world datasets.


2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Kefei Cheng ◽  
Xiaoyong Guo ◽  
Xiaotong Cui ◽  
Fengchi Shan

The recommendation algorithm can break the restriction of the topological structure of social networks, enhance the communication power of information (positive or negative) on social networks, and guide the information transmission way of the news in social networks to a certain extent. In order to solve the problem of data sparsity in news recommendation for social networks, this paper proposes a deep learning-based recommendation algorithm in social network (DLRASN). First, the algorithm is used to process behavioral data in a serializable way when users in the same social network browse information. Then, global variables are introduced to optimize the encoding way of the central sequence of Skip-gram, in which way online users’ browsing behavior habits can be learned. Finally, the information that the target users’ have interests in can be calculated by the similarity formula and the information is recommended in social networks. Experimental results show that the proposed algorithm can improve the recommendation accuracy.


2018 ◽  
Vol 7 (4.5) ◽  
pp. 518 ◽  
Author(s):  
Krishna Das ◽  
Smriti Kumar Sinha

In this short paper, network structural measure called centrality measure based mathematical approach is used for detection of malicious nodes in twitter social network. One of the objectives in analysing social networks is to detect malicious nodes which show anomaly behaviours in social networks. There are different approaches for anomaly detection in social networks such as opinion mining methods, behavioural methods, network structural approach etc. Centrality measure, a graph theoretical method related to social network structure, can be used to categorize a node either as popular and influential or as non-influential and anomalous node. Using this approach, we have analyzed twitter social network to remove anomalous nodes from the nodes-edges twitter data set. Thus removal of these kinds of nodes which are not important for information diffusion in the social network, makes the social network clean & speedy in fast information propagation.   


2016 ◽  
Vol 46 (2) ◽  
pp. 250-272 ◽  
Author(s):  
Hai Liang ◽  
King-wa Fu

It remains controversial whether community structures in social networks are beneficial or not for information diffusion. This study examined the relationships among four core concepts in social network analysis—network redundancy, information redundancy, ego-alter similarity, and tie strength—and their impacts on information diffusion. By using more than 6,500 representative ego networks containing nearly 1 million following relationships from Twitter, the current study found that (1) network redundancy is positively associated with the probability of being retweeted even when competing variables are controlled for; (2) network redundancy is positively associated with information redundancy, which in turn decreases the probability of being retweeted; and (3) the inclusion of both ego-alter similarity and tie strength can attenuate the impact of network redundancy on the probability of being retweeted.


Sign in / Sign up

Export Citation Format

Share Document