How to Protect Ourselves From Overlapping Community Detection in Social Networks
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Liu, Dong | - |
dc.contributor.author | Yang, Guoliang | - |
dc.contributor.author | Wang, Yanwei | - |
dc.contributor.author | Jin, Hu | - |
dc.contributor.author | Chen, Enhong | - |
dc.date.accessioned | 2022-12-20T05:54:10Z | - |
dc.date.available | 2022-12-20T05:54:10Z | - |
dc.date.issued | 2022-02 | - |
dc.identifier.issn | 2332-7790 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/111382 | - |
dc.description.abstract | In recent years, overlapping community detection algorithms have been paid more and more attention, which not only reveal the real social relations, but also expose the possible communication channels between communities. Those individuals (or people) in the overlapping area are very important to the communities that can promote communication between two or more communities. On the other hand, from the privacy perspective, some people may not want to be found out in the overlapping areas. With this in mind, we raise a question "Can individuals modify their relationships to avoid the community discovery algorithms locating them into overlapping areas?" If this problem could be solved, these people may not need to worry about being disturbed. In particular, we first give three heuristic hiding strategies, i.e., Random Hiding(RH), Based Degree Hiding(DH) and Betweenness Hiding(BH), as comparison, utilizing the randomly the node, information of node degree and node betweenness centrality, respectively. And then, we propose a novel hiding algorithm by exploiting the importance degree of nodes in communities based on which the corresponding social connections are added or deleted called name BIH. Through extensive experiments, we show the effectiveness of the proposed algorithm in moving out a target node from overlapped areas. | - |
dc.format.extent | 11 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.title | How to Protect Ourselves From Overlapping Community Detection in Social Networks | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/TBDATA.2022.3152431 | - |
dc.identifier.scopusid | 2-s2.0-85125291913 | - |
dc.identifier.wosid | 000822369300001 | - |
dc.identifier.bibliographicCitation | IEEE Transactions on Big Data, v.8, no.4, pp 894 - 904 | - |
dc.citation.title | IEEE Transactions on Big Data | - |
dc.citation.volume | 8 | - |
dc.citation.number | 4 | - |
dc.citation.startPage | 894 | - |
dc.citation.endPage | 904 | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.subject.keywordPlus | COMPLEX NETWORKS | - |
dc.subject.keywordPlus | PERTURBATION | - |
dc.subject.keywordPlus | ATTACK | - |
dc.subject.keywordAuthor | Detection algorithms | - |
dc.subject.keywordAuthor | Social networking (online) | - |
dc.subject.keywordAuthor | Privacy | - |
dc.subject.keywordAuthor | Image edge detection | - |
dc.subject.keywordAuthor | Complex networks | - |
dc.subject.keywordAuthor | Big Data | - |
dc.subject.keywordAuthor | Optimization | - |
dc.subject.keywordAuthor | Overlapping community detection | - |
dc.subject.keywordAuthor | community deception | - |
dc.subject.keywordAuthor | hiding | - |
dc.subject.keywordAuthor | privacy protection | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/9716832 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.