.png){kind=icon}
返回
PFCA: An influence-based parallel fuzzy clustering algorithm for large complex networks
.png){kind=icon}
PRE
AI
DOI：10.1111/exsy.12295.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Clustering helps in understanding the patterns present in networks and thus helps in getting useful insights. In real-world complex networks, analysing the structure of the network plays a vital role in clustering. Most of the existing clustering algorithms identify disjoint clusters, which do not consider the structure of the network. Moreover, the clustering results do not provide consistency and precision. This paper presents an efficient parallel fuzzy clustering algorithm named PFCA for large complex networks using Hadoop and Pregel (parallel processing framework for large graphs). The proposed algorithm first selects the candidate cluster heads on the basis of their influence in the network and then determines the number of clusters by analysing the graph structure using PageRank algorithm. The proposed algorithm identifies both disjoint and fuzzy clusters efficiently and finds membership of only those vertices, which are the part of more than one cluster. The performance is validated on 6 real-life networks having up to billions of connections. The experimental results show that the proposed algorithm scales up linearly with the increase in size of network. It is also shown that the proposed algorithm is efficient and has high precision in comparison with the other state-of-art fuzzy clustering algorithms in terms of F score and modularity.
Keyword:
big data
complex networks
fuzzy clustering
PageRank
Pregel
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.3
论文数:
2.6K
被引数:
3.8K
机构
暂无机构信息
引用论文
MapReduce-based fuzzy c-means clustering algorithm: implementation and scalability基于MapReduce的模糊c均值聚类算法: 实现与可扩展性
PREAI
分享收藏OClustR: A new graph-based algorithm for overlapping clusteringOsclustr: 一种新的基于图的重叠聚类算法.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏
查看更多内容