Identifying the social-balanced densest subgraph from signed social networks
- Authors
- Hao, Fei; Park, Doo-Soon; Pei, Zheng; Lee, HwaMin; Jeong, Young-Sik
- Issue Date
- Jul-2016
- Publisher
- Kluwer Academic Publishers
- Keywords
- Densest subgraph; Signed social network; FCA; SBDS
- Citation
- Journal of Supercomputing, v.72, no.7, pp 2782 - 2795
- Pages
- 14
- Journal Title
- Journal of Supercomputing
- Volume
- 72
- Number
- 7
- Start Page
- 2782
- End Page
- 2795
- URI
- https://scholarworks.bwise.kr/sch/handle/2021.sw.sch/8977
- DOI
- 10.1007/s11227-015-1606-6
- ISSN
- 0920-8542
1573-0484
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > Department of Computer Software Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/sch/handle/2021.sw.sch/8977)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.