返回
A parallel fuzzy clustering algorithm for large graphs using Pregel
DOI:10.1016/j.eswa.2017.02.005.png)
摘要
En 中文
Large graphs are scale free and ubiquitous having irregular relationships. Clustering is used to find existent similar patterns in graphs and thus help in getting useful insights. In real-world, nodes may belong to more than one cluster thus, it is essential to analyze fuzzy cluster membership of nodes. Traditional centralized fuzzy clustering algorithms incur high communication cost and produce poor quality of clusters when used for large graphs. Thus, scalable solutions are obligatory to handle huge amount of data in less computational time with minimum disk access. In this paper, we proposed a parallel fuzzy clustering algorithm named 'PGFC' for handling scalable graph data. It will be advantageous from the viewpoint of expert systems to develop a clustering algorithm that can assure scalability along with better quality of clusters for handling large graphs.The algorithm is parallelized using bulk synchronous parallel (BSP) based Pregel model. The cluster centers are initialized using degree centrality measure, resulting in lesser number of iterations. The performance of PGFC is compared with other state of art clustering algorithms using synthetic graphs and real world networks. The experimental results reveal that the proposed PGFC scales up linearly to handle large graphs and produces better quality of clusters when compared to other graph clustering counterparts. (C) 2017 Elsevier Ltd. All rights reserved.
Keyword:
Clustering
Graphs
Big data mining
Fuzzy C-Mean
Pregel
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
暂无机构信息
引用论文
MapReduce-based fuzzy c-means clustering algorithm: implementation and scalability基于MapReduce的模糊c均值聚类算法: 实现与可扩展性
Improvements to the relational fuzzy c-means clustering algorithm关系模糊c均值聚类算法的改进
PATTERN RECOGNITION
IF7.6

