Abstract
With the proliferation of mobile technology and IT development, people can use social network services anywhere and anytime. Among many social network mining problems, identifying cohesive subgraphs has attracted extensive attention from different fields due to its numerous applications. The most widely used among many cohesive subgraph models is k-core, because of its simple and intuitive structure. In this paper, we formulate (p,n)-core in signed networks by extending the k-core model. (p,n)-core is designed to guarantee sufficient internal positive edges and deficient internal negative edges. We formally prove that finding an exact (p,n)-core is NP-hard. Hence, we propose three efficient and effective algorithms to find a solution. We demonstrate the superiority of our proposed algorithms using real-world and synthetic networks.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
