| dc.contributor | 資科系 | |
| dc.creator (作者) | Li, Fa Hsien;Li, Cheng Te;Shan, Man-Kwan | |
| dc.creator (作者) | 李法賢;林守德;沈錳坤 | zh_TW |
| dc.date (日期) | 2011 | |
| dc.date.accessioned | 8-Oct-2015 17:48:57 (UTC+8) | - |
| dc.date.available | 8-Oct-2015 17:48:57 (UTC+8) | - |
| dc.date.issued (上傳時間) | 8-Oct-2015 17:48:57 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/78905 | - |
| dc.description.abstract (摘要) | The influence maximization problem is to find a set of seed nodes which maximize the spread of influence in a social network. The seed nodes are used for the viral marketing to gain the maximum profits through the effective word-of-mouth. However, in more real-world cases, marketers usually target certain products at particular groups of customers. While original influence maximization problem considers no product information and target customers, in this paper, we focus on the target marketing. We propose the labeled influence maximization problem, which aims to find a set of seed nodes which can trigger the maximum spread of influence on the target customers in a labeled social network. We propose three algorithms to solve such labeled influence maximization problem. We first develop the algorithms based on the greedy methods of original influence maximization by considering the target customers. Moreover, we develop a novel algorithm, Maximum Coverage, whose central idea is to offline compute the pairwise proximities of nodes in the labeled social network and online find the set of seed nodes. This allows the marketers to plan and evaluate strategies online for advertised products. The experimental results on IMDb labeled social network show our methods can achieve promising performances on both effectiveness and efficiency. © 2011 IEEE. | |
| dc.format.extent | 176 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011 | |
| dc.subject (關鍵詞) | Greedy method; Influence maximizations; Maximum coverage; Maximum spread; Novel algorithm; Offline; Product information; Proximity; Social networks; Target marketing; Viral marketing; Algorithms; Customer satisfaction; Profitability; Sales; Seed; Social networking (online); Social sciences computing; Economic and social effects | |
| dc.title (題名) | Labeled influence maximization in social networks for target marketing | |
| dc.type (資料類型) | conference | en |
| dc.identifier.doi (DOI) | 10.1109/PASSAT/SocialCom.2011.152 | |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1109/PASSAT/SocialCom.2011.152 | |
