Estimating Clustering Coefficient via Random Walk on MapReduce

Clustering coefficient plays an important role in many real-world applications, such as social network analysis and community mining. However, it is expensive to compute exact clustering coefficient for large networks. In many real-world applications, estimating clustering coefficient via random wal...

Full description

Bibliographic Details

Published in:	2017 IEEE 23rd International Conference on Parallel and Distributed Systems (ICPADS) pp. 493 - 500
Main Authors:	Liao, Qun, Yang, Yulu
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.12.2017
Subjects:	Approximation algorithms Clustering algorithms clustering coefficient Control engineering distributed algorithm Distributed algorithms Distributed computing graph analysis MapReduce Merging random walk Social network services
ISSN:	1521-9097
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!