File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/GLOCOM.2014.7417301
- Scopus: eid_2-s2.0-84964882892
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Vulnerable friend identification: Who should you beware of most in online social networks?
Title | Vulnerable friend identification: Who should you beware of most in online social networks? |
---|---|
Authors | |
Keywords | Privacy information dissemination Vulnerable friend identification Unfriending strategy |
Issue Date | 2015 |
Citation | 2015 IEEE Global Communications Conference, GLOBECOM 2015, 2015 How to Cite? |
Abstract | © 2015 IEEE. Web users are immersed in their roles as information producers and propagation pushers. They are unaware of being potential threats to privacy-protection towards themselves and their friends. It is necessary to know who they should beware of most in their friend-networks once their privacy information is divulged inadvertently. In this paper, we aim to identify the vulnerable friend who maximizes the dissemination of privacy information. First we develop a Privacy Receiving-Disseminating (PRD) model to simulate the iterative course of privacy information dissemination within social graph. The subgraph constituted of those users who are involved in the dissemination, called Ultimate Circle of Disseminating (UCD), is then detected by an iterative algorithm. The contribution of each direct friend could be evaluated by comparing the disseminating intensities of detected UCDs before and after unfriending himself. The performance of our work has been validated empirically with the comparison of different unfriending strategies. |
Persistent Identifier | http://hdl.handle.net/10722/281450 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yang, Yunjuan | - |
dc.contributor.author | Tian, Ye | - |
dc.contributor.author | Ngai, Edith | - |
dc.contributor.author | Zhang, Lanshan | - |
dc.contributor.author | Teng, Yining | - |
dc.contributor.author | Wang, Wendong | - |
dc.date.accessioned | 2020-03-13T10:37:54Z | - |
dc.date.available | 2020-03-13T10:37:54Z | - |
dc.date.issued | 2015 | - |
dc.identifier.citation | 2015 IEEE Global Communications Conference, GLOBECOM 2015, 2015 | - |
dc.identifier.uri | http://hdl.handle.net/10722/281450 | - |
dc.description.abstract | © 2015 IEEE. Web users are immersed in their roles as information producers and propagation pushers. They are unaware of being potential threats to privacy-protection towards themselves and their friends. It is necessary to know who they should beware of most in their friend-networks once their privacy information is divulged inadvertently. In this paper, we aim to identify the vulnerable friend who maximizes the dissemination of privacy information. First we develop a Privacy Receiving-Disseminating (PRD) model to simulate the iterative course of privacy information dissemination within social graph. The subgraph constituted of those users who are involved in the dissemination, called Ultimate Circle of Disseminating (UCD), is then detected by an iterative algorithm. The contribution of each direct friend could be evaluated by comparing the disseminating intensities of detected UCDs before and after unfriending himself. The performance of our work has been validated empirically with the comparison of different unfriending strategies. | - |
dc.language | eng | - |
dc.relation.ispartof | 2015 IEEE Global Communications Conference, GLOBECOM 2015 | - |
dc.subject | Privacy information dissemination | - |
dc.subject | Vulnerable friend identification | - |
dc.subject | Unfriending strategy | - |
dc.title | Vulnerable friend identification: Who should you beware of most in online social networks? | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/GLOCOM.2014.7417301 | - |
dc.identifier.scopus | eid_2-s2.0-84964882892 | - |
dc.identifier.spage | null | - |
dc.identifier.epage | null | - |