By Topic

Scalable Influence Maximization in Social Networks Using the Community Discovery Algorithm

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

2 Author(s)
Jinshuang Li ; Comput. Center, Northeastern Univ., Shenyang, China ; Yangyang Yu

Influence maximization is the problem of finding a small set of most influential vertices in a social network so that their aggregated influence in the network is maximized. Most social networks influence maximization problem are based on the following two basic propagation model: Independent Cascade Model and Linear Threshold Model. They all believe that the impact of all the vertices in a community is the same. It is inconsistent with the actual observed. in social networks, the influence of the different members in a community is not the same. Every community have some core members, their influence is far greater than the others. in view of this, a community discovery algorithm is proposed to find the core members of the community. Selecting the initial members from these core members will have the greatest influence.

Published in:

Genetic and Evolutionary Computing (ICGEC), 2012 Sixth International Conference on

Date of Conference:

25-28 Aug. 2012