scholarly journals Exploiting Two-Level Information Entropy across Social Networks for User Identification

2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Ling Xing ◽  
Kaikai Deng ◽  
Honghai Wu ◽  
Ping Xie ◽  
Mingchuan Zhang ◽  
...  
Keyword(s):  
Social Networks ◽  
Information Entropy ◽  
Online Social Networks ◽  
User Behavior ◽  
User Profile ◽  
Recall Rate ◽  
Entropy Method ◽  
Stable Marriage ◽  
User Identification ◽  
Level Information

As the popularity of online social networks has grown, more and more users now hold multiple virtual accounts at the same time. Under these circumstances, identifying multiple social accounts belonging to the same user across different social networks is of great importance for many applications, such as user recommendation, personalized services, and information fusion. In this paper, we mainly aggregate user profile information and user behavior information, then measures and analyzes the attributes contained in these two types of information to implement across social networks user identification. Moreover, as different user attributes have different effects on user identification, this paper therefore proposes a two-level information entropy-based weight assignment method (TIW) to weigh each attribute. Finally, we combine the scoring formula with the bidirectional stable marriage matching algorithm to achieve optimal user account matching and thereby obtain the final matching pairs. Experimental results demonstrate that the proposed two-level information entropy method yields excellent performance in terms of precision rate, recall rate, F -measure ( F 1 ), and area under curve (AUC).

scholarly journals Exploiting User Friendship Networks for User Identification across Social Networks

Symmetry ◽  
2022 ◽  
Vol 14 (1) ◽  
pp. 110
Author(s):  
Yating Qu ◽  
Ling Xing ◽  
Huahong Ma ◽  
Honghai Wu ◽  
Kun Zhang ◽  
...  
Keyword(s):  
Social Networks ◽  
Recommendation System ◽  
User Behavior ◽  
Comprehensive Evaluation ◽  
Behavior Pattern ◽  
Recall Rate ◽  
Friendship Networks ◽  
User Identification ◽  
Identification Process ◽  
Gradient Descent Algorithm

Identifying offline entities corresponding to multiple virtual accounts of users across social networks is crucial for the development of related fields, such as user recommendation system, network security, and user behavior pattern analysis. The data generated by users on multiple social networks has similarities. Thus, the concept of symmetry can be used to analyze user-generated information for user identification. In this paper, we propose a friendship networks-based user identification across social networks algorithm (FNUI), which performs the similarity of multi-hop neighbor nodes of a user to characterize the information redundancy in the friend networks fully. Subsequently, a gradient descent algorithm is used to optimize the contribution of the user’s multi-hop nodes in the user identification process. Ultimately, user identification is achieved in conjunction with the Gale–Shapley matching algorithm. Experimental results show that compared with baselines, such as friend relationship-based user identification (FRUI) and friendship learning-based user identification (FBI): (1) The contribution of single-hop neighbor nodes in the user identification process is higher than other multi-hop neighbor nodes; (2) The redundancy of information contained in multi-hop neighbor nodes has a more significant impact on user identification; (3) The precision rate, recall rate, comprehensive evaluation index (F1), and area under curve (AUC) of user identification have been improved.

User identification across online social networks in practice: Pitfalls and solutions

2016 ◽  
Vol 44 (3) ◽  
pp. 377-391 ◽  
Author(s):  
Azadeh Esfandyari ◽  
Matteo Zignani ◽  
Sabrina Gaito ◽  
Gian Paolo Rossi
Keyword(s):  
Social Networks ◽  
Online Social Networks ◽  
Full Range ◽  
Application Programming Interface ◽  
User Identification ◽  
Application Programming ◽  
Test Sets ◽  
Set Up ◽  
Different Levels ◽  
Programming Interface

To take advantage of the full range of services that online social networks (OSNs) offer, people commonly open several accounts on diverse OSNs where they leave lots of different types of profile information. The integration of these pieces of information from various sources can be achieved by identifying individuals across social networks. In this article, we address the problem of user identification by treating it as a classification task. Relying on common public attributes available through the official application programming interface (API) of social networks, we propose different methods for building negative instances that go beyond usual random selection so as to investigate the effectiveness of each method in training the classifier. Two test sets with different levels of discrimination are set up to evaluate the robustness of our different classifiers. The effectiveness of the approach is measured in real conditions by matching profiles gathered from Google+, Facebook and Twitter.

scholarly journals Balancing User Profile and Social Network Structure for Anchor Link Inferring Across Multiple Online Social Networks

IEEE Access ◽  
2017 ◽  
Vol 5 ◽  
pp. 12031-12040 ◽  
Author(s):  
Jiangtao Ma ◽  
Yaqiong Qiao ◽  
Guangwu Hu ◽  
Yongzhong Huang ◽  
Meng Wang ◽  
...  
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Network Structure ◽  
Online Social Networks ◽  
User Profile ◽  
Social Network Structure

Privacy Information Leakage Prevention in Cognitive Social Mining Applications

2019 ◽  
pp. 188-212
Author(s):  
Suriya Murugan ◽  
Anandakumar H.
Keyword(s):  
Social Networks ◽  
Social Relations ◽  
Private Information ◽  
Online Social Networks ◽  
Information Leakage ◽  
User Profile ◽  
User Privacy ◽  
Sensitive Data ◽  
Data Set ◽  
Secure Information

Online social networks, such as Facebook are increasingly used by many users and these networks allow people to publish and share their data to their friends. The problem is user privacy information can be inferred via social relations. This chapter makes a study and performs research on managing those confidential information leakages which is a challenging issue in social networks. It is possible to use learning methods on user released data to predict private information. Since the main goal is to distribute social network data while preventing sensitive data disclosure, it can be achieved through sanitization techniques. Then the effectiveness of those techniques is explored, and the methods of collective inference are used to discover sensitive attributes of the user profile data set. Hence, sanitization methods can be used efficiently to decrease the accuracy of both local and relational classifiers and allow secure information sharing by maintaining user privacy.

scholarly journals A heuristics for HTTP traffic identification in measuring user dissimilarity

2020 ◽  
Vol 2 (1-4) ◽  
pp. 17-28
Author(s):  
Adeyemi R. Ikuesan ◽  
Mazleena Salleh ◽  
Hein S. Venter ◽  
Shukor Abd Razak ◽  
Steven M. Furnell
Keyword(s):  
User Behavior ◽  
Recall Rate ◽  
Learning System ◽  
The Internet ◽  
Complex Nature ◽  
Web Traffic ◽  
User Identification ◽  
E Learning ◽  
Research Findings ◽  
Unit Of Measurement

AbstractThe prevalence of HTTP web traffic on the Internet has long transcended the layer 7 classification, to layers such as layer 5 of the OSI model stack. This coupled with the integration-diversity of other layers and application layer protocols has made identification of user-initiated HTTP web traffic complex, thus increasing user anonymity on the Internet. This study reveals that, with the current complex nature of Internet and HTTP traffic, browser complexity, dynamic web programming structure, the surge in network delay, and unstable user behavior in network interaction, user-initiated requests can be accurately determined. The study utilizes HTTP request method of GET filtering, to develop a heuristic algorithm to identify user-initiated requests. The algorithm was experimentally tested on a group of users, to ascertain the certainty of identifying user-initiated requests. The result demonstrates that user-initiated HTTP requests can be reliably identified with a recall rate at 0.94 and F-measure at 0.969. Additionally, this study extends the paradigm of user identification based on the intrinsic characteristics of users, exhibited in network traffic. The application of these research findings finds relevance in user identification for insider investigation, e-commerce, and e-learning system as well as in network planning and management. Further, the findings from the study are relevant in web usage mining, where user-initiated action comprises the fundamental unit of measurement.

Sign in / Sign up

Export Citation Format

Share Document