首页> 美国卫生研究院文献>Frontiers in Neuroinformatics >A Monte Carlo Evaluation of Weighted Community Detection Algorithms
【2h】

A Monte Carlo Evaluation of Weighted Community Detection Algorithms

机译:加权社区检测算法的蒙特卡洛评估

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

The past decade has been marked with a proliferation of community detection algorithms that aim to organize nodes (e.g., individuals, brain regions, variables) into modular structures that indicate subgroups, clusters, or communities. Motivated by the emergence of big data across many fields of inquiry, these methodological developments have primarily focused on the detection of communities of nodes from matrices that are very large. However, it remains unknown if the algorithms can reliably detect communities in smaller graph sizes (i.e., 1000 nodes and fewer) which are commonly used in brain research. More importantly, these algorithms have predominantly been tested only on binary or sparse count matrices and it remains unclear the degree to which the algorithms can recover community structure for different types of matrices, such as the often used cross-correlation matrices representing functional connectivity across predefined brain regions. Of the publicly available approaches for weighted graphs that can detect communities in graph sizes of at least 1000, prior research has demonstrated that Newman's spectral approach (i.e., Leading Eigenvalue), Walktrap, Fast Modularity, the Louvain method (i.e., multilevel community method), Label Propagation, and Infomap all recover communities exceptionally well in certain circumstances. The purpose of the present Monte Carlo simulation study is to test these methods across a large number of conditions, including varied graph sizes and types of matrix (sparse count, correlation, and reflected Euclidean distance), to identify which algorithm is optimal for specific types of data matrices. The results indicate that when the data are in the form of sparse count networks (such as those seen in diffusion tensor imaging), Label Propagation and Walktrap surfaced as the most reliable methods for community detection. For dense, weighted networks such as correlation matrices capturing functional connectivity, Walktrap consistently outperformed the other approaches for recovering communities.
机译:在过去的十年中,社区检测算法不断涌现,其目的是将节点(例如,个体,大脑区域,变量)组织为表示亚组,集群或社区的模块化结构。由于跨多个查询领域的大数据的出现,这些方法的发展主要集中于从非常大的矩阵中检测节点的社区。但是,该算法是否能够可靠地检测出大脑研究中常用的较小图形尺寸(即1000个节点以下)的社区,仍然未知。更重要的是,这些算法主要仅在二进制或稀疏计数矩阵上进行了测试,目前尚不清楚算法在何种程度上可以恢复不同类型矩阵的社区结构,例如经常使用的互相关矩阵表示跨预定义的功能连接脑区。在可用于检测图大小至少为1000的社区的加权图的公开可用方法中,先前的研究表明,纽曼的频谱方法(即Leading Eigenvalue),Walktrap,快速模块化,Louvain方法(即多级社区方法) ,标签传播和Infomap在某些情况下都能很好地恢复社区。当前蒙特卡洛模拟研究的目的是在多种条件下测试这些方法,包括变化的图形尺寸和矩阵类型(稀疏计数,相关性和反射的欧几里得距离),以确定哪种算法最适合特定类型数据矩阵。结果表明,当数据采用稀疏计数网络的形式时(例如在扩散张量成像中看到的那些),标签传播和Walktrap成为了最可靠的社区检测方法。对于密集的加权网络(例如捕获功能连接的相关矩阵),Walktrap始终优于其他方法来恢复社区。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号