Presentation 2011-12-16
A Study of Information Diffusion Model Considering Update of a Social Network
Masaki OONO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We study the combinational optimizaion problem of finding the most influential nodes on a social network. Kempe's method based on a general greedy algorithm can give a good approximate solution to the problem. However, the approximation performance of Kempe's method deteriorates because the method doesn't consider the change of the number of nodes and the number of edges. In this paper, I propose a new method to extract the viral nodes efficiently from the dynamic social network.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Social network analysis / Information diffusion model / Influence maxmization problem / Dynamic network
Paper # DE2011-48
Date of Issue

Conference Information
Committee DE
Conference Date 2011/12/9(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Data Engineering (DE)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Study of Information Diffusion Model Considering Update of a Social Network
Sub Title (in English)
Keyword(1) Social network analysis
Keyword(2) Information diffusion model
Keyword(3) Influence maxmization problem
Keyword(4) Dynamic network
1st Author's Name Masaki OONO
1st Author's Affiliation Faculty of Informatics and Engineering, University of Electro-Communications()
Date 2011-12-16
Paper # DE2011-48
Volume (vol) vol.111
Number (no) 361
Page pp.pp.-
#Pages 4
Date of Issue