Network Topology Overlapping Group Detection Based on h-Core Pruning

Qi Zhang, Y. Liu, Yu-Sheng Cai
{"title":"Network Topology Overlapping Group Detection Based on h-Core Pruning","authors":"Qi Zhang, Y. Liu, Yu-Sheng Cai","doi":"10.1109/ICSP51882.2021.9408816","DOIUrl":null,"url":null,"abstract":"The network group detection has a large number of application researches and has achieved certain results in network security, IP entity location and load balancing. However, due to the large scale of the network topology graph and the large number of terminal nodes, most of the existing overlapping group detection algorithms are relatively complex, and the data size that can be processed is limited, and cannot be directly applied to the network topology. This paper proposes a network topology overlapping group detection algorithm based on h-core pruning. This algorithm decomposes the network into smaller strong connected components, reduces the interference of noisy nodes to overlapping group discovery, and more efficiently detect the largest k-plex group on the target network. A large number of experiments show that the method in this paper is effective. Compared with the full-enum algorithm, our method increases the network size that can be handled by the largest k-plex group by two orders of magnitude, and can detect overlapping groups in the network topology more efficiently.","PeriodicalId":117159,"journal":{"name":"2021 6th International Conference on Intelligent Computing and Signal Processing (ICSP)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 6th International Conference on Intelligent Computing and Signal Processing (ICSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSP51882.2021.9408816","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The network group detection has a large number of application researches and has achieved certain results in network security, IP entity location and load balancing. However, due to the large scale of the network topology graph and the large number of terminal nodes, most of the existing overlapping group detection algorithms are relatively complex, and the data size that can be processed is limited, and cannot be directly applied to the network topology. This paper proposes a network topology overlapping group detection algorithm based on h-core pruning. This algorithm decomposes the network into smaller strong connected components, reduces the interference of noisy nodes to overlapping group discovery, and more efficiently detect the largest k-plex group on the target network. A large number of experiments show that the method in this paper is effective. Compared with the full-enum algorithm, our method increases the network size that can be handled by the largest k-plex group by two orders of magnitude, and can detect overlapping groups in the network topology more efficiently.
基于h核剪枝的网络拓扑重叠组检测
网络组检测在网络安全、IP实体定位和负载均衡等方面进行了大量的应用研究,取得了一定的成果。然而,由于网络拓扑图规模大,终端节点数量多,现有的重叠组检测算法大多比较复杂,可处理的数据量有限,无法直接应用于网络拓扑。提出了一种基于h核剪枝的网络拓扑重叠组检测算法。该算法将网络分解为更小的强连通分量,减少了噪声节点对重叠群发现的干扰,更有效地检测到目标网络上最大的k-plex群。大量实验表明,本文方法是有效的。与全枚举算法相比,我们的方法将最大k-plex群可处理的网络大小提高了两个数量级,并且可以更有效地检测网络拓扑中的重叠组。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信