By Topic

Selecting the Most Influential Nodes in Social Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Pablo A. Estevez ; Senior Member, IEEE, Department of Electrical Engineering, Universidad de Chile, Casilla 412-3, Santiago, Chile. email: pestevez@ing.uchile.cl ; Pablo Vera ; Kazumi Saito

A set covering greedy algorithm is proposed for solving the influence maximization problem in social networks. Two information diffusion models are considered: Independent Cascade Model and Linear Threshold Model. The proposed algorithm is compared with traditional maximization algorithms such as simple greedy and degree centrality using three data sets. In addition, an algorithm for mapping social networks is proposed, which allows visualizing the infection process and how the different algorithms evolve. The proposed approach is useful for mining large social networks.

Published in:

2007 International Joint Conference on Neural Networks

Date of Conference:

12-17 Aug. 2007