首页> 外文会议>Emerging intelligent technologies in industry >Mining Hierarchical Communities from Complex Networks Using Distance-Based Similarity
【24h】

Mining Hierarchical Communities from Complex Networks Using Distance-Based Similarity

机译:使用基于距离的相似性从复杂网络中挖掘分层社区

获取原文
获取原文并翻译 | 示例

摘要

Community structure is one of the most important topological properties of complex networks, in which the intra-group links are very dense, but the inter-group links are quite sparse. Although there exists many works with regard to community mining, few of them studied the connections between the local distance among nodes and the global community structures of networks. In this work, we have studied their connection and established a corresponding heuristics depicting such a connection between local distance and community structure. On the basis of the heuristic, we have proposed a distance-based similarity measure as well as a novel community mining algorithm DSA. The DSA has been rigorously validated and tested against several benchmark networks. The experimental results show that the DSA is able to accurately discovery the potential communities with their hierarchical structures from real-world networks.
机译:社区结构是复杂网络最重要的拓扑特性之一,其中组内链接非常密集,但组间链接却很少。尽管关于社区挖掘的工作很多,但很少研究节点之间的局部距离与网络的全局社区结构之间的联系。在这项工作中,我们研究了它们之间的联系,并建立了相应的启发式方法,描述了本地距离与社区结构之间的这种联系。在启发式算法的基础上,我们提出了一种基于距离的相似性测度以及一种新颖的社区挖掘算法DSA。 DSA已针对多个基准网络进行了严格的验证和测试。实验结果表明,DSA能够从现实网络中准确发现潜在的社区及其分层结构。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号