Extremal optimization-based semi-supervised algorithm with conflict pairwise constraints for community detection

Lei Li, Mei Du, Guanfeng Liu, Xuegang Hu, Gongqing Wu
{"title":"Extremal optimization-based semi-supervised algorithm with conflict pairwise constraints for community detection","authors":"Lei Li, Mei Du, Guanfeng Liu, Xuegang Hu, Gongqing Wu","doi":"10.1109/ASONAM.2014.6921580","DOIUrl":null,"url":null,"abstract":"The research on community structure is a key to analyze the network functionality and topology, and thus it is significant to detect and analysis the community structure. During the abstract process from an actual system to a network, especially for a large-scale network, it is inevitable to have mistaken connections between nodes or have connection missing. In addition, in real applications, from time to time we can obtain prior information in the form of pairwise constraints between nodes besides topology information, although they may be inaccurate or conflicted. These noises in the network-related information will dramatically reduce the accuracy of community detection. Hence, in this paper, we introduce a dissimilarity index to determine the trustworthiness of pairwise constraints and settle the conflict of pairwise constraints. Then, focusing on the community detection with false connections or conflicted connections, we propose a pairwise constrained structure-enhanced extremal optimization-based semi-supervised algorithm (PCSEO-SS algorithm). Compared with existing semi-supervised community detection approaches, the experimental results executed on real networks and synthetic networks, show that PCSEO-SS can solve the problem of false connections or conflicted connections to some extent and detect the community structure more precisely.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASONAM.2014.6921580","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

The research on community structure is a key to analyze the network functionality and topology, and thus it is significant to detect and analysis the community structure. During the abstract process from an actual system to a network, especially for a large-scale network, it is inevitable to have mistaken connections between nodes or have connection missing. In addition, in real applications, from time to time we can obtain prior information in the form of pairwise constraints between nodes besides topology information, although they may be inaccurate or conflicted. These noises in the network-related information will dramatically reduce the accuracy of community detection. Hence, in this paper, we introduce a dissimilarity index to determine the trustworthiness of pairwise constraints and settle the conflict of pairwise constraints. Then, focusing on the community detection with false connections or conflicted connections, we propose a pairwise constrained structure-enhanced extremal optimization-based semi-supervised algorithm (PCSEO-SS algorithm). Compared with existing semi-supervised community detection approaches, the experimental results executed on real networks and synthetic networks, show that PCSEO-SS can solve the problem of false connections or conflicted connections to some extent and detect the community structure more precisely.
基于冲突对约束的极值优化半监督社区检测算法
社区结构的研究是分析网络功能和拓扑结构的关键,因此对社区结构的检测和分析具有重要意义。在从实际系统抽象到网络的过程中,特别是对于大型网络,不可避免地会出现节点之间连接错误或连接缺失的情况。此外,在实际应用中,除了拓扑信息外,我们还可以不时地以节点间成对约束的形式获得先验信息,尽管它们可能不准确或相互冲突。这些网络相关信息中的噪声会大大降低社区检测的准确性。因此,本文引入不相似度指标来确定配对约束的可信度,并解决配对约束的冲突问题。然后,针对存在假连接或冲突连接的社区检测问题,提出了一种基于配对约束结构增强的极限优化半监督算法(PCSEO-SS算法)。与现有的半监督社团检测方法相比,在真实网络和合成网络上的实验结果表明,PCSEO-SS能在一定程度上解决虚假连接或冲突连接的问题,更精确地检测社团结构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信