Learning to Correlate Accounts Across Online Social Networks: An Embedding-Based Approach

2020 ◽  
Vol 32 (3) ◽  
pp. 714-729
Author(s):  
Fan Zhou ◽  
Kunpeng Zhang ◽  
Shuying Xie ◽  
Xucheng Luo

Cross-site account correlation correlates users who have multiple accounts but the same identity across online social networks (OSNs). Being able to identify cross-site users is important for a variety of applications in social networks, security, and electronic commerce, such as social link prediction and cross-domain recommendation. Because of either heterogeneous characteristics of platforms or some unobserved but intrinsic individual factors, the same individuals are likely to behave differently across OSNs, which accordingly causes many challenges for correlating accounts. Traditionally, account correlation is measured by analyzing user-generated content, such as writing style, rules of naming user accounts, or some existing metadata (e.g., account profile, account historical activities). Accounts can be correlated by de-anonymizing user behaviors, which is sometimes infeasible since such data are not often available. In this work, we propose a method, called ACCount eMbedding (ACCM), to go beyond text data and leverage semantics of network structures, a possibility that has not been well explored so far. ACCM aims to correlate accounts with high accuracy by exploiting the semantic information among accounts through random walks. It models and understands latent representations of accounts using an embedding framework similar to sequences of words in natural language models. It also learns a transformation matrix to project node representations into a common dimensional space for comparison. With evaluations on both real-world and synthetic data sets, we empirically demonstrate that ACCM provides performance improvement compared with several state-of-the-art baselines in correlating user accounts between OSNs.

Author(s):  
Afrand Agah ◽  
Mehran Asadi

This article introduces a new method to discover the role of influential people in online social networks and presents an algorithm that recognizes influential users to reach a target in the network, in order to provide a strategic advantage for organizations to direct the scope of their digital marketing strategies. Social links among friends play an important role in dictating their behavior in online social networks, these social links determine the flow of information in form of wall posts via shares, likes, re-tweets, mentions, etc., which determines the influence of a node. This article initially identities the correlated nodes in large data sets using customized divide-and-conquer algorithm and then measures the influence of each of these nodes using a linear function. Furthermore, the empirical results show that users who have the highest influence are those whose total number of friends are closer to the total number of friends of each node divided by the total number of nodes in the network.


Author(s):  
Afrand Agah ◽  
Mehran Asadi

This article introduces a new method to discover the role of influential people in online social networks and presents an algorithm that recognizes influential users to reach a target in the network, in order to provide a strategic advantage for organizations to direct the scope of their digital marketing strategies. Social links among friends play an important role in dictating their behavior in online social networks, these social links determine the flow of information in form of wall posts via shares, likes, re-tweets, mentions, etc., which determines the influence of a node. This article initially identities the correlated nodes in large data sets using customized divide-and-conquer algorithm and then measures the influence of each of these nodes using a linear function. Furthermore, the empirical results show that users who have the highest influence are those whose total number of friends are closer to the total number of friends of each node divided by the total number of nodes in the network.


Symmetry ◽  
2018 ◽  
Vol 10 (11) ◽  
pp. 654 ◽  
Author(s):  
Jebran Khan ◽  
Sungchang Lee

In this paper, we propose a new scale-free social networks (SNs) evolution model that is based on homophily combined with preferential attachments. Our model enables the SN researchers to generate SN synthetic data for the evaluation of multi-facet SN models that are dependent on users’ attributes and similarities. Homophily is one of the key factors for interactive relationship formation in SN. The synthetic graph generated by our model is scale-invariant and has symmetric relationships. The model is dynamic and sustainable to changes in input parameters, such as number of nodes and nodes’ attributes, by conserving its structural properties. Simulation and evaluation of models for large-scale SN applications need large datasets. One way to get SN data is to generate synthetic data by using SN evolution models. Various SN evolution models are proposed to approximate the real-life SN graphs in previous research. These models are based on SN structural properties such as preferential attachment. The data generated by these models is suitable to evaluate SN models that are structure dependent but not suitable to evaluate models which depend on the SN users’ attributes and similarities. In our proposed model, users’ attributes and similarities are utilized to synthesize SN graphs. We evaluated the resultant synthetic graph by analyzing its structural properties. In addition, we validated our model by comparing its measures with the publicly available real-life SN datasets and previous SN evolution models. Simulation results show our resultant graph to be a close representation of real-life SN graphs with users’ attributes.


2013 ◽  
Vol 10 (10) ◽  
pp. 2136-2145 ◽  
Author(s):  
Guangyuan Wang ◽  
Hua Wang ◽  
Xiaohui Tao ◽  
Ji Zhang ◽  
Guohun Zhu

Online social network has developed significantly in recent years. Most of current research has utilized the property of online social network to spread information and ideas. Motivated by the applications of dominating set in social networks (such as e-learning), a variation of the dominating set called positive influence dominating set (PIDS) has been studied in the literature. The existing research for PIDS problem do not take into consideration the attributes, directions and degrees of personal influence. However, these factors are very important for selecting a better PIDS. For example, in a real-life e-learning community, the attributes and the degrees of their influence between a tutor and a student are different; the relationship between two e-learning users is asymmetrical. Hence, comprehensive, deep investigation of user’s properties become an emerging and urgent issue. The focus of this study is on the degree and direction between e-learners’ influence. A novel dominating set model called weighted positive influence dominating set (WPIDS), and two selection algorithms for the WPIDS problem have been proposed. Experiments using synthetic data sets demonstrate that the proposed model and algorithms are more reasonable and effective than those of the positive influence dominating set (PIDS) without considering the key factors of weight, direction and so on.


2017 ◽  
Vol 10 (2) ◽  
pp. 39 ◽  
Author(s):  
Mohammad Malli ◽  
Nadine Said ◽  
Ahmad Fadlallah

Profiling users in Online Social Networks (OSNs) is of great benefit in multiple domains (e.g., marketing, sociology, and forensics). In this paper, we propose a new model for rating user’s profile (i.e., low, medium, high, and advanced) in an OSN community by embedding it into clusters located at predefined range of radius in a low-dimensional Cartesian space. The orthogonal coordinates of the profile are estimated using Principle Component Analysis (PCA) applied on a vector of metrics formulated as a set of attributes of interest (i.e., qualitative and quantitative) mined from the user’s profile to characterize his/her level of participation and behavior in the community. The experimentations are conducted on 3000 simulated profiles of three OSNs (Facebook, Twitter and Instagram) by embedding them in three cartesian spaces of three corresponding communities (Religion, Political and Lifestyle).  The results show that we are able to estimate accurately the profile rates by reducing the vector of metrics to a low-dimensional space whittle down to 3-D space.


Author(s):  
Aldo Hernandez-Suarez ◽  
Gabriel Sanchez-Perez ◽  
Karina Toscano-Medina ◽  
Hector Perez-Meana ◽  
Jose Portillo-Portillo ◽  
...  

In recent years, online social networks have received important consideration in spatial modelling fields given the critical information that can be extracted from them for events in real time; one of the most latent issues is that regarding various natural disasters such as earthquakes. Although it is possible to retrieve data from these social networks with embedded geographic information provided by GPS, in many cases this is not possible. An alternative solution is to reconstruct specific locations using probabilistic language models, more specifically those based on Name Entity Recognition (NER), which extracts names from a user’s description about an event occurring in a specific place (e.g., a collapsed building on a specific avenue). In this work, we present a methodology to use twitter as a social sensor system for disasters. The methodology scores NER locations with a kernel density estimation function for different subtopics originating from a natural disaster and that maps them into a geographic space is proposed. The proposed methodology is evaluated with tweets related to the 2017 earthquake in Mexico.


2018 ◽  
Vol 12 (4) ◽  
pp. 1-29 ◽  
Author(s):  
Qingyuan Gong ◽  
Yang Chen ◽  
Jiyao Hu ◽  
Qiang Cao ◽  
Pan Hui ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document