File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

김정훈

Kim, Junghoon
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

OCSM : Finding overlapping cohesive subgraphs with minimum degree

Author(s)
Kim, JunghoonLim, SungsuKim, Jungeun
Issued Date
2022-08
DOI
10.1016/j.ins.2022.06.020
URI
https://scholarworks.unist.ac.kr/handle/201301/59277
Citation
INFORMATION SCIENCES, v.607, pp.585 - 602
Abstract
Cohesive subgraph discovery in a network is one of the fundamental problems and investigated for several decades. In this paper, we propose the Overlapping Cohesive Subgraphs with Minimum degree (OCSM) problem which combines three key concepts for OCSM: (i) edge-based overlapping, (ii) the minimum degree constraint, and (iii) the graph density. To the best of our knowledge, this is the first work to identify overlapping cohesive subgraphs with the minimum degree by incorporating the graph density. Since the OCSM problem is NP-hard, we propose two algorithms: an advanced peeling algorithm and a seed-based expansion algorithm. Finally, we show the experimental study with real-world networks to demonstrate the effectiveness and efficiency of our proposed algorithms.
Publisher
ELSEVIER SCIENCE INC
ISSN
0020-0255
Keyword (Author)
Cohesive subgraph discoverySocial network analysisMinimum degree
Keyword
K-CORE DECOMPOSITIONCOMMUNITY DETECTIONMODULARITYENGAGEMENTNETWORKS

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.