Abstract

On social networks, investigating how the influence is propagated is crucial in understanding the network evolution and the social impact of different topics. In previous study, the influence propagation is either modeled based on the static network structure, or the infection between two connected users is recovered from some given event cascades. Unfortunately, existing solutions are incapable of identifying the user susceptibility delivered by user generated content. In this paper, we propose RegInfoIbp, a general regularized learning framework for modeling topic-aware influence propagation in dynamic network structures. Specifically, the observed time-sequential user topic preference and user adjacency information are factorized by the prior information reflected by a user-influential bipartite relation graph. The influence propagation is approximated with a nonparametric regularized Bayesian matrix factorization model with tractable polynomial complexity. and the influential users are identified by several sampling algorithms with slightly different approximation qualities. To further model dynamic temporal evolution, we construct Markov conditional probabilistic model on the compact latent feature representation. By integrating both topic and structure information into the regularized non-parametric probabilistic learning process, RegInfoIbp is more efficient and accurate in discovering the key factors in the content and influential users in dynamic network structure. Extensive experiments demonstrate that RegInfoIbp better adapts to real data, and achieves better approximation in influence propagation over existing approaches.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.