scholarly journals A Social Interaction Activity based Time-Varying User Vectorization Method for Online Social Networks

Author(s):  
Tianyi Hao ◽  
Longbo Huang

In this paper, we consider the problem of user modeling in online social networks, and propose a social interaction activity based user vectorization framework, called the time-varying user vectorization (Tuv), to infer and make use of important user features. Tuv is designed based on a novel combination of word2vec, negative sampling and a smoothing technique for model training. It jointly handles multi-format user data and computes user representing vectors, by taking into consideration user feature variation, self-similarity and pairwise interactions among users. The framework enables us to extract hidden user properties and to produce user vectors. We conduct extensive experiments based on a real-world dataset, which show that Tuv significantly outperforms several state-of-the-art user vectorization methods.

2021 ◽  
Vol 13 (3) ◽  
pp. 76
Author(s):  
Quintino Francesco Lotito ◽  
Davide Zanella ◽  
Paolo Casari

The pervasiveness of online social networks has reshaped the way people access information. Online social networks make it common for users to inform themselves online and share news among their peers, but also favor the spreading of both reliable and fake news alike. Because fake news may have a profound impact on the society at large, realistically simulating their spreading process helps evaluate the most effective countermeasures to adopt. It is customary to model the spreading of fake news via the same epidemic models used for common diseases; however, these models often miss concepts and dynamics that are peculiar to fake news spreading. In this paper, we fill this gap by enriching typical epidemic models for fake news spreading with network topologies and dynamics that are typical of realistic social networks. Specifically, we introduce agents with the role of influencers and bots in the model and consider the effects of dynamical network access patterns, time-varying engagement, and different degrees of trust in the sources of circulating information. These factors concur with making the simulations more realistic. Among other results, we show that influencers that share fake news help the spreading process reach nodes that would otherwise remain unaffected. Moreover, we emphasize that bots dramatically speed up the spreading process and that time-varying engagement and network access change the effectiveness of fake news spreading.


Author(s):  
Cameron Taylor ◽  
Alexander V. Mantzaris ◽  
Ivan Garibay

Polarization in online social networks has gathered a significant amount of attention in the research community and in the public sphere due to stark disagreements with millions of participants in topics surrounding politics, climate, the economy and other areas where an agreement is required. There are multiple approaches to investigating the scenarios in which polarization occurs and given that polarization is not a new phenomenon but that its virality may be supported by the low cost and latency messaging offered by online social media platforms; an investigation into the intrinsic dynamics of online opinion evolution is presented for complete networks. Extending a model which utilizes the Binary Voter Model (BVM) to examine the effect of the degree of freedom for selecting contacts based upon homophily, simulations show that different opinions are reinforced for a period of time when users have a greater range of choice for association. The facility of discussion threads and groups formed upon common views further delays the rate in which a consensus can form between all members of the network. This can temporarily incubate members from interacting with those who can present an alternative opinion where a voter model would then proceed to produce a homogeneous opinion based upon pairwise interactions.


2021 ◽  
Vol 11 (20) ◽  
pp. 9487
Author(s):  
Mohammed Al-Sarem ◽  
Faisal Saeed ◽  
Zeyad Ghaleb Al-Mekhlafi ◽  
Badiea Abdulkarem Mohammed ◽  
Mohammed Hadwan ◽  
...  

The widespread usage of social media has led to the increasing popularity of online advertisements, which have been accompanied by a disturbing spread of clickbait headlines. Clickbait dissatisfies users because the article content does not match their expectation. Detecting clickbait posts in online social networks is an important task to fight this issue. Clickbait posts use phrases that are mainly posted to attract a user’s attention in order to click onto a specific fake link/website. That means clickbait headlines utilize misleading titles, which could carry hidden important information from the target website. It is very difficult to recognize these clickbait headlines manually. Therefore, there is a need for an intelligent method to detect clickbait and fake advertisements on social networks. Several machine learning methods have been applied for this detection purpose. However, the obtained performance (accuracy) only reached 87% and still needs to be improved. In addition, most of the existing studies were conducted on English headlines and contents. Few studies focused specifically on detecting clickbait headlines in Arabic. Therefore, this study constructed the first Arabic clickbait headline news dataset and presents an improved multiple feature-based approach for detecting clickbait news on social networks in Arabic language. The proposed approach includes three main phases: data collection, data preparation, and machine learning model training and testing phases. The collected dataset included 54,893 Arabic news items from Twitter (after pre-processing). Among these news items, 23,981 were clickbait news (43.69%) and 30,912 were legitimate news (56.31%). This dataset was pre-processed and then the most important features were selected using the ANOVA F-test. Several machine learning (ML) methods were then applied with hyper-parameter tuning methods to ensure finding the optimal settings. Finally, the ML models were evaluated, and the overall performance is reported in this paper. The experimental results show that the Support Vector Machine (SVM) with the top 10% of ANOVA F-test features (user-based features (UFs) and content-based features (CFs)) obtained the best performance and achieved 92.16% of detection accuracy.


Author(s):  
Andrew Laghos

The purpose of this chapter is to investigate Multimedia Social Networks and e-Learning, and the relevant research in these areas. Multimedia Social Networks in e-Learning is an important and evolving study area, since an understanding of the technologies involved as well as an understanding of how the students communicate in online social networks are necessary in order to accurately analyze them. The chapter begins by introducing Multimedia Social Networks and Online Communities. Following this, the key players of e-Learning in Multimedia Social Networks are presented, including a discussion of the different roles that the students take. Furthermore, Social Interaction research is presented concentrating on such important areas as factors that influence social interaction, peer support, student-centered learning, collaboration, and the effect of interaction on learning. The last section of the chapter deals with the various methods and frameworks for analyzing multimedia social networks in e-Learning communities.


Author(s):  
Neelu khare ◽  
Kumaran U.

The tremendous growth of social networking systems enables the active participation of a wide variety of users. This has led to an increased probability of security and privacy concerns. In order to solve the issue, the article defines a secure and privacy-preserving approach to protect user data across Cloud-based online social networks. The proposed approach models social networks as a directed graph, such that a user can share sensitive information with other users only if there exists a directed edge from one user to another. The connectivity between data users data is efficiently shared using an attribute-based encryption (ABE) with different data access levels. The proposed ABE technique makes use of a trapdoor function to re-encrypt the data without the use of proxy re-encryption techniques. Experimental evaluation states that the proposed approach provides comparatively better results than the existing techniques.


2019 ◽  
Vol 2019 ◽  
pp. 1-16
Author(s):  
Zhiyuan Li ◽  
Junlei Bi ◽  
Carlos Borrego

Recently, content dissemination has become more and more important for opportunistic social networks. The challenges of opportunistic content dissemination result from random movement of nodes and uncertain positions of a destination, which seriously affect the efficiency of content dissemination. In this paper, we firstly construct time-varying interest communities based on the temporal and spatial regularities of users. Next, we design a content dissemination algorithm on the basis of time-varying interest communities. Our proposed content dissemination algorithm can run in O(nlog⁡n) time. Finally, the comparisons between the proposed content dissemination algorithm and state-of-the-art content dissemination algorithms show that our proposed content dissemination algorithm can (a) keep high query success rate, (b) reduce the average query latency, (c) reduce the hop count of a query, and (d) maintain low system overhead.


Sign in / Sign up

Export Citation Format

Share Document