| dc.contributor | 資科系 | - |
| dc.creator (作者) | Chen, Arbee L. P. | - |
| dc.creator (作者) | 陳良弼 | zh_TW |
| dc.creator (作者) | Wang, E.T. | en_US |
| dc.creator (作者) | Yeh, T.A. | en_US |
| dc.date (日期) | 2013 | - |
| dc.date.accessioned | 21-May-2015 17:25:15 (UTC+8) | - |
| dc.date.available | 21-May-2015 17:25:15 (UTC+8) | - |
| dc.date.issued (上傳時間) | 21-May-2015 17:25:15 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/75275 | - |
| dc.description.abstract (摘要) | Social influence is an important phenomenon in social networks. A user is said to be influenced by his/her friends if this user performs the same actions after his/her friends. The problem of influence maximization is to find a small set of users that maximize the spread of influence throughout the social network. Many approaches are proposed to solve this problem under different influence cascade models. In this paper, we propose another solution based on a pruning strategy in which influence boundaries for users are computed to effectively reduce the number of users who have chances to be seeds, thus making the proposed solution efficient. A series of experiments are performed to evaluate the proposed approach and the experiment results reveal that our approach outperforms the previous works. © Springer-Verlag Berlin Heidelberg 2013. | - |
| dc.format.extent | 176 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | Smart Innovation, Systems and Technologies, 20, 269-279 | - |
| dc.subject (關鍵詞) | CASCADE model; Influence maximizations; Maximum spread; Pruning strategy; Social influence; Social Networks; Experiments; Intelligent control; Intelligent systems; Social networking (online) | - |
| dc.title (題名) | Finding leaders with maximum spread of influence through social networks | - |
| dc.type (資料類型) | article | en |
| dc.identifier.doi (DOI) | 10.1007/978-3-642-35452-6_29 | - |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1007/978-3-642-35452-6_29 | - |
