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...

Celý popis

Podrobná bibliografia

Vydané v:	2017 IEEE 23rd International Conference on Parallel and Distributed Systems (ICPADS) s. 493 - 500
Hlavní autori:	Liao, Qun, Yang, Yulu
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.12.2017
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!