| 一种基于粗糙集的社区结构发现算法 |
| |
| 引用本文： | 朱文强,伏玉琛.一种基于粗糙集的社区结构发现算法[J].计算机工程,2011,37(14):41-43. |
| |
| 作者姓名： | 朱文强 伏玉琛 |
| |
| 作者单位： | 1. 苏州大学计算机科学与技术学院,江苏苏州,215006
2. 苏州大学计算机科学与技术学院,江苏苏州,215006;江苏省现代企业信息化应用支撑软件工程技术研发中心,江苏苏州,215104 |
| |
| 基金项目： | 国家自然科学基金资助项目，江苏省现代企业信息化应用支撑软件工程技术研发中心开放基金资助项目 |
| |
| 摘 要： | 提出一种基于粗糙集的社区结构发现算法。将信息中心度作为衡量节点之间关联度的标准，在处理社区间边界节点时引入粗糙集中的上下近似集概念。将网络中的各个节点划分到社区中，从而将复杂网络划分成k个社区，k值由算法自动选定，并通过模块度确定理想的社区结构。在Zachary Karate Club模型和College Football Network模型上进行验证，实验结果表明，该算法的准确率较高。
|
| 关 键 词： | 社区结构 节点关联度 粗糙集 上近似集 下近似集 |
| 收稿时间： | 2010-12-24 |
Community Structure Detection Algorithm Based on Rough Set |
| |
| ZHU Wen-qiang,FU Yu-chen.Community Structure Detection Algorithm Based on Rough Set[J].Computer Engineering,2011,37(14):41-43. |
| |
| Authors: | ZHU Wen-qiang FU Yu-chen |
| |
| Affiliation: | 1,2(1.School of Computer Science & Technology,Soochow University Suzhou,215006,China;2.Jiangsu Province Support Software Engineering R&D Center for Modern Information Technology Application in Enterprise,Suzhou 215104,China) |
| |
| Abstract: | This paper proposes a new detection algorithm based on rough set.It uses information centrality as a measure of correlation between nodes.While dealing with the boundary nodes between communities,it uses upper and lower approximations subsets so as to better simulate the real world,then it clusters nodes to certain community and identify the network to k communities,identifies the ideally community structure according to modularity,besides the k value need not to be prior given.The algorithm is tested on two network dataset named Zachary Karate Club and College Football.and experimental result shows it has high accuracy rate. |
| |
| Keywords: | community structure node relevance degree rough set upper approximations lower approximations |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
