Layer-prioritized influence maximization in social networks

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Influence maximization, first proposed by Kempe, is the problem of finding seed nodes that maximizes the number of affected nodes. However, not only influenced number, but also influence layer is a crucial element which may play an important role in viral marketing. In this paper, we design a new framework, layer-prioritized influence maximization (LPIM), to address the problem of influence maximization with an emphasis on influence layer. The proposed framework is mainly composed of three parts: (1) graph clustering. (2) key node selection. (3) seed node detecting. We also demonstrate the effective and efficient of our proposed framework by experiments on large collaboration networks and complexity analysis respectively.

Cite

CITATION STYLE

APA

Zhang, Q., Wu, Y., & Xie, J. (2017). Layer-prioritized influence maximization in social networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10638 LNCS, pp. 631–638). Springer Verlag. https://doi.org/10.1007/978-3-319-70139-4_64

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