Efficient algorithms for influence maximization in social networks

NCU Institutional Repository > 管理學院 > 資訊管理學系 > 期刊論文 > Item 987654321/106629

請使用永久網址來引用或連結此文件: https://ir.lib.ncu.edu.tw/handle/987654321/106629

題名:	Efficient algorithms for influence maximization in social networks
作者:	陳以錚;Chen, Yi-Cheng;Peng, Wen-Chih;Lee, Suh-Yin
貢獻者:	管理學院資訊管理學系
關鍵詞:	Algorithms;Analysis;Applied sciences;Biological and medical sciences;Co authorship;Communities;Computer Science;Computer science;control theory;systems;Computer systems and distributed systems. User interface;Data Mining and Knowledge Discovery;Database Management;Datasets;Diffusion models;Exact sciences and technology;Friendship;Fundamental and applied biological sciences. Psychology;Heat;Heuristic;Information Storage and Retrieval;Information systems;Information Systems and Communication Service;Information Systems Applications (incl.Internet);Innovations;IT in Business;Maximization;Psychology. Psychoanalysis. Psychiatry;Psychology. Psychophysiology;Regular Paper;Social interactions. Communication. Group processes;Social network analysis;Social networks;Social psychology;Software;Spreads;State of the art;Studies
日期:	2012-12-01
上傳時間:	2026-04-23 13:32:25 (UTC+8)
出版者:	Springer London;London: Springer-Verlag
摘要:	摘要： In recent years, due to the surge in popularity of social-networking web sites, considerable interest has arisen regarding influence maximization in social networks. Given a social network structure, the problem of influence maximization is to determine a minimum set of nodes that could maximize the spread of influences. With a large-scale social network, the efficiency and practicability of such algorithms are critical. Although many recent studies have focused on the problem of influence maximization, these works in general are time-consuming when a social network is large-scale. In this paper, we propose two novel algorithms, CDH-Kcut and Community and Degree Heuristic on Kcut/SHRINK, to solve the influence maximization problem based on a realistic model. The algorithms utilize the community structure, which significantly decreases the number of candidates of influential nodes, to avoid information overlap. The experimental results on both synthetic and real datasets indicate that our algorithms not only significantly outperform the state-of-the-art algorithms in efficiency but also possess graceful scalability. 其他題名： Knowl Inf Syst 出版者： London: Springer-Verlag 出版日期： 2012-12-01 出處： Knowledge and information systems, 2012-12, Vol.33 (3), p.577-601 資源來源： ABI/INFORM Collection (via ProQuest) 版權： Springer-Verlag London Limited 2012 版權： 2015 INIST-CNRS 版權： Springer-Verlag London 2012 識別號： ISSN: 0219-1377 識別號： EISSN: 0219-3116 識別號： DOI: 10.1007/s10115-012-0540-7 識別號： CODEN: KISNCR
顯示於類別:	[資訊管理學系] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	14	檢視/開啟

在NCUIR中所有的資料項目都受到原著作權保護.

社群 sharing

資料載入中.....