A Community Detection Method to Counter the Semantic Noise of Complex Networks: Bridging a Topology and Semantic Subspace Transformation

Ying Li, Yong-Hong Tang, Junwei Cheng, Chaobo He, Feiyi Tang
{"title":"A Community Detection Method to Counter the Semantic Noise of Complex Networks: Bridging a Topology and Semantic Subspace Transformation","authors":"Ying Li, Yong-Hong Tang, Junwei Cheng, Chaobo He, Feiyi Tang","doi":"10.1109/MSMC.2023.3236163","DOIUrl":null,"url":null,"abstract":"Community detection of complex networks helps understand the network’s composition and explores the behavior characteristics among users. The methods based on nonnegative matrix factorization (NMF) for community detection have been widely studied and applied because of their flexibility and high interpretability. Nevertheless, accompanied by ideal assumptions, classic community detection methods face the following problems. First, they lead to a mismatch between communities, i.e., topology and semantic information. Second, they cannot overcome the effect of macroscopic semantic noise on methods. Finally, they cannot retain the nodes’ distance information in the high-dimensional topology space. Aiming at the these problems, this article proposes a community detection method with self-perception ability that solves the problem of macro semantic noise. The aforementioned issues are overcome by introducing the subspace transfer module and the generalized Laplacian self-perception module. We understand the network factors that affect the model’s performance through empirical observation. Extensive experiments on six representative methods on several benchmark datasets support our conclusion and demonstrate that our method outperforms the representative methods in many datasets.","PeriodicalId":516814,"journal":{"name":"IEEE Systems, Man, and Cybernetics Magazine","volume":"291 1","pages":"2-14"},"PeriodicalIF":0.0000,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Systems, Man, and Cybernetics Magazine","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MSMC.2023.3236163","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Community detection of complex networks helps understand the network’s composition and explores the behavior characteristics among users. The methods based on nonnegative matrix factorization (NMF) for community detection have been widely studied and applied because of their flexibility and high interpretability. Nevertheless, accompanied by ideal assumptions, classic community detection methods face the following problems. First, they lead to a mismatch between communities, i.e., topology and semantic information. Second, they cannot overcome the effect of macroscopic semantic noise on methods. Finally, they cannot retain the nodes’ distance information in the high-dimensional topology space. Aiming at the these problems, this article proposes a community detection method with self-perception ability that solves the problem of macro semantic noise. The aforementioned issues are overcome by introducing the subspace transfer module and the generalized Laplacian self-perception module. We understand the network factors that affect the model’s performance through empirical observation. Extensive experiments on six representative methods on several benchmark datasets support our conclusion and demonstrate that our method outperforms the representative methods in many datasets.
应对复杂网络语义噪音的社群检测方法:拓扑与语义子空间转换的桥梁
复杂网络的社群检测有助于了解网络的构成并探索用户之间的行为特征。基于非负矩阵因式分解(NMF)的社群检测方法因其灵活性和高可解释性而被广泛研究和应用。然而,伴随着理想假设,经典的社区检测方法面临着以下问题。首先,它们会导致社群(即拓扑和语义信息)之间的不匹配。其次,它们无法克服宏观语义噪声对方法的影响。最后,它们无法在高维拓扑空间中保留节点的距离信息。针对这些问题,本文提出了一种具有自我感知能力的社群检测方法,解决了宏观语义噪声的问题。通过引入子空间转移模块和广义拉普拉斯自感知模块,克服了上述问题。我们通过实证观察了解影响模型性能的网络因素。在多个基准数据集上对六种代表性方法进行的广泛实验支持了我们的结论,并证明我们的方法在许多数据集上都优于代表性方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信