基于粗糙集理论的改进密度峰聚类重叠社区检测

Yunfei Feng, Hongmei Chen
{"title":"基于粗糙集理论的改进密度峰聚类重叠社区检测","authors":"Yunfei Feng, Hongmei Chen","doi":"10.1109/ISKE47853.2019.9170407","DOIUrl":null,"url":null,"abstract":"Mining community structure from network data set is an important research task in machine learning. Overlapping community detection is more complex due to the ambiguous of nodes which may be partitioned to different communities simultaneously. In this paper, an improved density peaks clustering is proposed to overlapping community detection. The rough set theory based uncertain similarity between nodes is defined in dual-nucleus subspace by fully considering the topological structure. Different strategies are used in density peaks clustering to improve the efficiency and the performance of the community division. Furthermore, rough set theory is employed to describe the overlapping nodes and rough set theory based overlapping community detection algorithm is proposed. Experiments are carried out on real-world social networks and artificial networks. The experimental results show that RSDPCD is effective.","PeriodicalId":399084,"journal":{"name":"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An Improved Density Peaks Clustering based on Rough Set Theory for Overlapping Community Detection\",\"authors\":\"Yunfei Feng, Hongmei Chen\",\"doi\":\"10.1109/ISKE47853.2019.9170407\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mining community structure from network data set is an important research task in machine learning. Overlapping community detection is more complex due to the ambiguous of nodes which may be partitioned to different communities simultaneously. In this paper, an improved density peaks clustering is proposed to overlapping community detection. The rough set theory based uncertain similarity between nodes is defined in dual-nucleus subspace by fully considering the topological structure. Different strategies are used in density peaks clustering to improve the efficiency and the performance of the community division. Furthermore, rough set theory is employed to describe the overlapping nodes and rough set theory based overlapping community detection algorithm is proposed. Experiments are carried out on real-world social networks and artificial networks. The experimental results show that RSDPCD is effective.\",\"PeriodicalId\":399084,\"journal\":{\"name\":\"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISKE47853.2019.9170407\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISKE47853.2019.9170407","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

从网络数据集中挖掘社区结构是机器学习领域的一个重要研究课题。由于节点的模糊性,可能会同时被划分到不同的社区,使得重叠社区检测更加复杂。本文提出了一种改进的密度峰聚类方法用于重叠社团检测。在充分考虑拓扑结构的基础上,在双核子空间中定义了基于粗糙集理论的节点间不确定相似度。在密度峰聚类中采用了不同的策略来提高社区划分的效率和性能。利用粗糙集理论对重叠节点进行描述,提出了基于粗糙集理论的重叠社团检测算法。实验分别在现实社会网络和人工网络上进行。实验结果表明,RSDPCD是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Improved Density Peaks Clustering based on Rough Set Theory for Overlapping Community Detection
Mining community structure from network data set is an important research task in machine learning. Overlapping community detection is more complex due to the ambiguous of nodes which may be partitioned to different communities simultaneously. In this paper, an improved density peaks clustering is proposed to overlapping community detection. The rough set theory based uncertain similarity between nodes is defined in dual-nucleus subspace by fully considering the topological structure. Different strategies are used in density peaks clustering to improve the efficiency and the performance of the community division. Furthermore, rough set theory is employed to describe the overlapping nodes and rough set theory based overlapping community detection algorithm is proposed. Experiments are carried out on real-world social networks and artificial networks. The experimental results show that RSDPCD is effective.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Incremental Learning for Transductive SVMs ISKE 2019 Table of Contents Consensus: The Minimum Cost Model based Robust Optimization A Learned Clause Deletion Strategy Based on Distance Ratio Effects of Real Estate Regulation Policy of Beijing Based on Discrete Dependent Variables Model
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1