是否有图中社区检测算法的实现? [英] Are there implementations of algorithms for community detection in graphs?

问题描述

我正在寻找社区检测算法的实现，例如 Girvan-Newman 算法 (2002).我访问了该领域的几位研究人员(Newman、Santo 等)的网站，但找不到任何代码.我想有人发布了这些算法的实现(甚至可能是工具包?)，但我似乎找不到.

I am looking for implementations of community detection algorithms, such as the Girvan-Newman algorithm (2002). I have visited the websites of several researchers in this field (Newman, Santo, etc.) but was unable to find any code. I imagine someone out there published implementations of these algorithms (maybe even a toolkit?), but I can't seem to find it.

推荐答案

社区检测算法有时是库的一部分(例如 JUNG 对于 java) 或工具(请参阅 Gephi).当作者发布新方法时，他们有时会提供他们的代码.例如，Louvain 和 Infomap 方法.

Community detection algorithms are sometimes part of a library (such as JUNG for java) or a tool (see Gephi). When authors publish a new method, they do sometimes make their code available. For example, the Louvain and Infomap methods.

旁注:Girvan-Newman 算法有时仍会使用，但大部分已被更快、更准确的方法所取代.为了更好地概述该主题，我推荐社区检测算法:比较分析或更长的图表中的社区检测(103 页).

Side note: Girvan-Newman algorithm is sometimes still used, but it has mostly been replaced by faster and more accurate methods. For a good overview of the topic, I recommend Community detection algorithms: a comparative analysis or the longer Community detection in graphs (103 pages).

这篇关于是否有图中社区检测算法的实现?的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！