MapReduce approach to relational influence propagation in complex networks

3Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The relational label propagation problem for large data sets using MapReduce programming model was considered in the paper. The method we propose estimates class probability in relational domain in the networks. The method was examined on large real telecommunication data set. The results indicated that it could be used successfully to classify networks’ nodes and, thanks to that, new offerings or tariffs might be proposed to customers who belong to other providers. Moreover, basic properties of relational label propagation were examined and reported.

Cite

CITATION STYLE

APA

Kajdanowicz, T., Indyk, W., & Kazienko, P. (2014). MapReduce approach to relational influence propagation in complex networks. Pattern Analysis and Applications, 17(4), 739–746. https://doi.org/10.1007/s10044-012-0294-6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free