《Table 2Parameters of benchmark networks》
提示：宽带有限、当前游客访问压缩模式
本系列图表出处文件名：随高清版一同展现
《A Community Detection Algorithm Based on Markov Random Walks Ants in Complex Network》
As the Fig.3 shows，the algorithm appears to perform well in practice.The proportion of correctly identified nodes is higher when mu 0.4.When mu=0.4，the community becomes an obstacle，and the NMI is only 0.892 1.When mu=0.5，the NMI is 0.716 9，and when mu=0.6，the NMI is 0.628 3.
| 图表编号 | XD0042858300 严禁用于非法目的 |
|---|---|
| 绘制时间 | 2019.02.01 |
| 作者 | 马健、樊建平、刘峰、李红辉 |
| 绘制单位 | School of Computer and Information Technology, Beijing Jiaotong University、School of Computer and Information Technology, Beijing Jiaotong University、School of Computer and Information Technology, Beijing Jiaotong University、School of Computer and Informa |
| 更多格式 | 高清、无水印（增值服务） |
