返回
A consensus graph clustering algorithm for directed networks
DOI:10.1016/j.eswa.2016.01.026.png)
摘要
En 中文
Finding groups of highly related vertices in undirected graphs has been widely investigated. Nevertheless, a very few strategies are specially designed for dealing with directed networks. In particular, strategies based on the maximization of the modularity adjusted to overcome the resolution limit for directed networks have not been developed. The analysis of the characteristics of the clusters produced by these approaches is highly important since among the most used strategies for detecting communities in directed networks are the modularity maximization-based algorithms for undirected graphs. Towards these remarks, in this paper we propose a consensus-based strategy, named CoNCLus, for providing partitions for directed networks guided by the adjusted modularity measure. In the computational experiments, we compared CoNCLus with benchmark strategies, including Infomap and OSLOM, by using hundreds of LFR networks. CoNCLus outperformed Infomap and was competitive with OSLOM even for graphs with high mixture index and small-sized clusters, to which modularity-based algorithms have limitations. CoNCLus outperformed all algorithms when considering the networks with the highest average and maximum in degrees among the networks used in the experiments. (C) 2016 Elsevier Ltd. All rights reserved.
Keyword:
Heuristic method
Community detection
Directed networks
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
Assessing simultaneous immobilization of lead and improvement of phosphorus availability through application of phosphorus-rich biochar in a contaminated soil: A pot experiment
Chemosphere
IF0
Using Seawater Reverse Osmosis (SWRO) desalting system for less environmental impacts in Qatar在卡塔尔使用海水反渗透 (SWRO) 脱盐系统减少环境影响
Desalination
IF0

