Community discovery by propagating local and global information based on the MapReduce model

Explore this paper's citation graph

Summary

Three strategies, namely, localizing propagation of affinity messages, relaxing self-exemplar constraints, and hierarchical processing, are employed in the algorithm to achieve reasonable time and space complexities in social networks.

Type
article
Published
2015-12-01
Cited by
70
References
51

Keywords

Computer science, SPARK (programming language), Centrality, Cluster analysis, Big data

References

Cited by

Related papers