Next Article in Journal
Evaluating Forwarding Protocols in Opportunistic Networks: Trends, Advances, Challenges and Best Practices
Previous Article in Journal
Guidelines towards Information-Driven Mobility Management
Article Menu
Issue 5 (May) cover image

Export Article

Open AccessArticle

Substitute Seed Nodes Mining Algorithms for Influence Maximization in Multi-Social Networks

Department of Computer Science, Fuzhou Polytechnic, Fuzhou 350108, Fujian, China
College of Mathematics and Informatics, Fujian Normal University, Fuzhou 350007, Fujian, China
Author to whom correspondence should be addressed.
Future Internet 2019, 11(5), 112;
Received: 15 March 2019 / Revised: 10 April 2019 / Accepted: 5 May 2019 / Published: 10 May 2019
(This article belongs to the Section Techno-Social Smart Systems)
PDF [2220 KB, uploaded 27 May 2019]


Due to the growing interconnections of social networks, the problem of influence maximization has been extended from a single social network to multiple social networks. However, a critical challenge of influence maximization in multi-social networks is that some initial seed nodes may be unable to be active, which obviously leads to a low performance of influence spreading. Therefore, finding substitute nodes for mitigating the influence loss of uncooperative nodes is extremely helpful in influence maximization. In this paper, we propose three substitute mining algorithms for influence maximization in multi-social networks, namely for the Greedy-based substitute mining algorithm, pre-selected-based substitute mining algorithm, and similar-users-based substitute mining algorithm. The simulation results demonstrate that the existence of the uncooperative seed nodes leads to the range reduction of information influence. Furthermore, the viability and performance of the proposed algorithms are presented, which show that three substitute node mining algorithms can find suitable substitute nodes for multi-social networks influence maximization, thus achieves better influence. View Full-Text
Keywords: multi-social networks; influence maximization; substitute mining algorithm multi-social networks; influence maximization; substitute mining algorithm

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Rao, X.; Zhao, J.; Chen, Z.; Lin, F. Substitute Seed Nodes Mining Algorithms for Influence Maximization in Multi-Social Networks. Future Internet 2019, 11, 112.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Future Internet EISSN 1999-5903 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top