Detecting local communities in complex network via the optimization of interaction relationship between node and community

The goal of local community detection algorithms is to explore the optimal community with a reference to a given node. Such algorithms typically include two primary processes: seed selection and community expansion. This study develops and tests a novel local community detection algorithm called OIR...

Full description

Bibliographic Details
Main Authors: Shenglong Wang, Jing Yang, Xiaoyu Ding, Meng Zhao
Format: Article
Language:English
Published: PeerJ Inc. 2023-05-01
Series:PeerJ Computer Science
Subjects:
Online Access:https://peerj.com/articles/cs-1386.pdf
_version_ 1797825277760372736
author Shenglong Wang
Jing Yang
Xiaoyu Ding
Meng Zhao
author_facet Shenglong Wang
Jing Yang
Xiaoyu Ding
Meng Zhao
author_sort Shenglong Wang
collection DOAJ
description The goal of local community detection algorithms is to explore the optimal community with a reference to a given node. Such algorithms typically include two primary processes: seed selection and community expansion. This study develops and tests a novel local community detection algorithm called OIRLCD that is based on the optimization of interaction relationships between nodes and the community. First, we introduce an improved seed selection method to solve the seed deviation problem. Second, this study uses a series of similarity indices to measure the interaction relationship between nodes and community. Third, this study uses a series of algorithms based on different similarity indices, and designs experiments to reveal the role of the similarity index in algorithms based on relationship optimization. The proposed algorithm was compared with five existing local community algorithms in both real-world networks and artificial networks. Experimental results show that the optimization of interaction relationship algorithms based on node similarity can detect communities accurately and efficiently. In addition, a good similarity index can highlight the advantages of the proposed algorithm based on interaction optimization.
first_indexed 2024-03-13T10:51:39Z
format Article
id doaj.art-d36b242153a14cca924a865dd481884f
institution Directory Open Access Journal
issn 2376-5992
language English
last_indexed 2024-03-13T10:51:39Z
publishDate 2023-05-01
publisher PeerJ Inc.
record_format Article
series PeerJ Computer Science
spelling doaj.art-d36b242153a14cca924a865dd481884f2023-05-17T15:05:20ZengPeerJ Inc.PeerJ Computer Science2376-59922023-05-019e138610.7717/peerj-cs.1386Detecting local communities in complex network via the optimization of interaction relationship between node and communityShenglong Wang0Jing Yang1Xiaoyu Ding2Meng Zhao3College of Computer Science and Technology, Harbin Engineering University, Harbin, ChinaCollege of Computer Science and Technology, Harbin Engineering University, Harbin, ChinaChongqing University of Posts and Telecommunications, Chongqing, ChinaCollege of Computer Science and Technology, Harbin Engineering University, Harbin, ChinaThe goal of local community detection algorithms is to explore the optimal community with a reference to a given node. Such algorithms typically include two primary processes: seed selection and community expansion. This study develops and tests a novel local community detection algorithm called OIRLCD that is based on the optimization of interaction relationships between nodes and the community. First, we introduce an improved seed selection method to solve the seed deviation problem. Second, this study uses a series of similarity indices to measure the interaction relationship between nodes and community. Third, this study uses a series of algorithms based on different similarity indices, and designs experiments to reveal the role of the similarity index in algorithms based on relationship optimization. The proposed algorithm was compared with five existing local community algorithms in both real-world networks and artificial networks. Experimental results show that the optimization of interaction relationship algorithms based on node similarity can detect communities accurately and efficiently. In addition, a good similarity index can highlight the advantages of the proposed algorithm based on interaction optimization.https://peerj.com/articles/cs-1386.pdfComplex networksLocal community detectionInteraction relationship between nodes and communityNode similarity indexLocal centrality
spellingShingle Shenglong Wang
Jing Yang
Xiaoyu Ding
Meng Zhao
Detecting local communities in complex network via the optimization of interaction relationship between node and community
PeerJ Computer Science
Complex networks
Local community detection
Interaction relationship between nodes and community
Node similarity index
Local centrality
title Detecting local communities in complex network via the optimization of interaction relationship between node and community
title_full Detecting local communities in complex network via the optimization of interaction relationship between node and community
title_fullStr Detecting local communities in complex network via the optimization of interaction relationship between node and community
title_full_unstemmed Detecting local communities in complex network via the optimization of interaction relationship between node and community
title_short Detecting local communities in complex network via the optimization of interaction relationship between node and community
title_sort detecting local communities in complex network via the optimization of interaction relationship between node and community
topic Complex networks
Local community detection
Interaction relationship between nodes and community
Node similarity index
Local centrality
url https://peerj.com/articles/cs-1386.pdf
work_keys_str_mv AT shenglongwang detectinglocalcommunitiesincomplexnetworkviatheoptimizationofinteractionrelationshipbetweennodeandcommunity
AT jingyang detectinglocalcommunitiesincomplexnetworkviatheoptimizationofinteractionrelationshipbetweennodeandcommunity
AT xiaoyuding detectinglocalcommunitiesincomplexnetworkviatheoptimizationofinteractionrelationshipbetweennodeandcommunity
AT mengzhao detectinglocalcommunitiesincomplexnetworkviatheoptimizationofinteractionrelationshipbetweennodeandcommunity