A Content-Based Approach for User Profile Modeling and Matching on Social Networks

Author(s):  
Thanh Van Le ◽  
Trong Nghia Truong ◽  
Tran Vu Pham
Author(s):  
Amanda Cox ◽  
Yeslam Al-Saggaf ◽  
Kate McLean

Social networking users are presented with a plethora of profile and privacy settings; most of which are left defaulted. As a result, there is little understanding of the fields that make up the user profile, the privacy settings available to safeguard the user, and the ramifications of not changing the same. Concerns relating to the unprecedented quantities of Personally Identifiable Information being stored need to be addressed. By employing a risk matrix to a social media profile, a user could be alerted to the potential dangers of the information being contained within the profile. By adapting this tool, the risks to the individual user of a social media profile will be minimised.


IEEE Access ◽  
2017 ◽  
Vol 5 ◽  
pp. 12031-12040 ◽  
Author(s):  
Jiangtao Ma ◽  
Yaqiong Qiao ◽  
Guangwu Hu ◽  
Yongzhong Huang ◽  
Meng Wang ◽  
...  

Author(s):  
Suriya Murugan ◽  
Anandakumar H.

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.


IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 152429-152442
Author(s):  
Lidong Wang ◽  
Keyong Hu ◽  
Yun Zhang ◽  
Shihua Cao

2019 ◽  
Vol 68 (2) ◽  
pp. 43-57
Author(s):  
Michał Zabielski ◽  
Zbigniew Tarapata ◽  
Rafał Kasprzyk

The paper presents a method, based on graph and network theory, which allows to detect cloned user profiles on Online Social Networks. Moreover, an idea of similarity containers, which gives an opportunity to incorporate importance and context of data into a model, was introduced. The presented solutions were adapted to the idea of simulation environment, which will allow to detect a profile cloning process before that activity will be completely performed by an attacker. Keywords: Online Social Networks, user profile cloning, violation of privacy on the web.


Author(s):  
Suriya Murugan ◽  
Anandakumar H.

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.


2015 ◽  
Vol 18 (6) ◽  
pp. 586-610 ◽  
Author(s):  
Peilin Yang ◽  
Hongning Wang ◽  
Hui Fang ◽  
Deng Cai

Sign in / Sign up

Export Citation Format

Share Document