z-logo
open-access-imgOpen Access
Privacy measurement method using a graph structure on online social networks
Author(s) -
Li XueFeng,
Zhao Chensu,
Tian Keke
Publication year - 2021
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.2019-0495
Subject(s) - computer science , internet privacy , privacy software , privacy protection , information privacy , personally identifiable information , privacy policy , similarity (geometry) , the internet , literacy , social network (sociolinguistics) , graph , computer security , world wide web , social media , artificial intelligence , theoretical computer science , psychology , pedagogy , image (mathematics)
Recently, with an increase in Internet usage, users of online social networks (OSNs) have increased. Consequently, privacy leakage has become more serious. However, few studies have investigated the difference between privacy and actual behaviors. In particular, users' desire to change their privacy status is not supported by their privacy literacy. Presenting an accurate measurement of users' privacy status can cultivate the privacy literacy of users. However, the highly interactive nature of interpersonal communication on OSNs has promoted privacy to be viewed as a communal issue. As a large number of redundant users on social networks are unrelated to the user's privacy, existing algorithms are no longer applicable. To solve this problem, we propose a structural similarity measurement method suitable for the characteristics of social networks. The proposed method excludes redundant users and combines the attribute information to measure the privacy status of users. Using this approach, users can intuitively recognize their privacy status on OSNs. Experiments using real data show that our method can effectively and accurately help users improve their privacy disclosures.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here