Identifying the social-balanced densest subgraph from signed social networks
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hao, Fei | - |
dc.contributor.author | Park, Doo-Soon | - |
dc.contributor.author | Pei, Zheng | - |
dc.contributor.author | Lee, HwaMin | - |
dc.contributor.author | Jeong, Young-Sik | - |
dc.date.accessioned | 2021-08-11T17:25:41Z | - |
dc.date.available | 2021-08-11T17:25:41Z | - |
dc.date.issued | 2016-07 | - |
dc.identifier.issn | 0920-8542 | - |
dc.identifier.issn | 1573-0484 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/sch/handle/2021.sw.sch/8977 | - |
dc.description.abstract | Identifying the dense subgraphs from large graphs is important and useful to various social media mining applications. Most of existing works focus on the densest subgraph problem in the unweighted and undirected represented social network which can maximize the average degree over all possible subgraphs. However, considering the frequent signed relationships occurred in real-life social network, this paper introduces the social-balanced densest subgraph problem in signed social network by incorporating the social balance theory. We obtain a novel problem formulation that is to identify the subset of vertices that can maximize the social-balanced density in signed social networks. Further, we propose an efficient approach for identifying the social-balanced densest subgraph based on formal concept analysis. The case study illustrates that our algorithm can efficiently identify the social-balanced densest subgraph for satisfying the specific application's requirements. | - |
dc.format.extent | 14 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Kluwer Academic Publishers | - |
dc.title | Identifying the social-balanced densest subgraph from signed social networks | - |
dc.type | Article | - |
dc.publisher.location | 네델란드 | - |
dc.identifier.doi | 10.1007/s11227-015-1606-6 | - |
dc.identifier.scopusid | 2-s2.0-84951954288 | - |
dc.identifier.wosid | 000379086300022 | - |
dc.identifier.bibliographicCitation | Journal of Supercomputing, v.72, no.7, pp 2782 - 2795 | - |
dc.citation.title | Journal of Supercomputing | - |
dc.citation.volume | 72 | - |
dc.citation.number | 7 | - |
dc.citation.startPage | 2782 | - |
dc.citation.endPage | 2795 | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | sci | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Hardware & Architecture | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.subject.keywordAuthor | Densest subgraph | - |
dc.subject.keywordAuthor | Signed social network | - |
dc.subject.keywordAuthor | FCA | - |
dc.subject.keywordAuthor | SBDS | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(31538) 22, Soonchunhyang-ro, Asan-si, Chungcheongnam-do, Republic of Korea+82-41-530-1114
COPYRIGHT 2021 by SOONCHUNHYANG 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.