臺灣博碩士論文加值系統

過社群媒體進行行銷是目前的趨勢，不但方便而且兼具低成本的優點，對於急於擴大市場的公司是非常有吸引力的。在文獻中，許多研究解決了一種或多種產品的影響最大化問題，其多半選擇一批初始消費者來傳播產品信息，去增加接收到信息的消費者（受影響的消費者）數量。但鮮少人同時考慮到其他人的惡意謠言和行為意圖(Behavior Intention)。
在本文中，作者通過提出多種產品的影響最大化問題的新變體，即限定預算行為意圖最大化問題(Budgeted Behavioral Intentions Maximization Problem)填補了這一空白，該問題要求在不超過給定預算的情況下選擇一組種子(初始消費者)，使得受所選種子影響的消費者的總體預期行為意圖最大化。
此外，作者提出了一種貪婪算法的變體，用來處理這個問題，並以真實社群資料和模擬數據，進行模擬評估演算法的性能。實驗結果表明，該演算法優於多種貪心算法。

Marketing through online social networks is convenient, low-cost, and bene-?cial for companies seeking to expand their customer numbers. In the literature, many studies address the in?uence maximization problem with one or multiple products, which selects initial consumers (seeds) to spread one or multiple product information such that the number of consumers receiving this product information (the in?uenced consumers) is maximized. However, to date, none of these schemes take the rumors and the beliefs of other persons that could signi?cantly change the consumer’s behavioral intention into account at once.
In this paper, the author ?lls this gap by proposing a new variant of the in?uence maximization problem with multiple products, the Budgeted Behavioral Intentions Maximization problem, which asks for a set of seeds with the total cost not greater than a given budget in online social networks such that the total expected behavioral intentions of the consumers in?uenced by the selected seeds and the rumors are maximized. In addition, the author proposes a variant of greedy algorithm for the Budgeted Behavioral Intentions Maximization problem. the also conduct simulations to evaluate the performance of the algorithm using real traces and synthesis data. Experimental results show that the algorithm outperforms several greedy algorithms.

中文摘要 I
Abstract II
Content III
1 Introduction 1
2 Related Works 4
3 Budgeted Behavioral Intentions Maximization Problem 7
3.1 Scenario 7
3.2 Fishbein Model 8
3.3 Propagation 10
3.3.1 Seed Propagation 10
3.3.2 Rumor Propagation 12
3.4 The Problem Definition 13
4 Approximation Algorithm 15
4.1 Enumeration Algorithm 15
4.2 GuessGreedy Algorithm 18
5 Experimental Result 20
5.1 Simulation Settings 20
5.2 Simulation Results 26
6 Conclusion 32

[1] H. Zhang, H. Zhang, A. Kuhnle, and M. T. Thai, “Profit maximization for multiple products in online social networks,” in IEEE INFOCOM, 2016.
[2] P. Domingos and M. Richardson, “Mining the network value of customers,” in ACM SIGKDD, 2001.
[3] M. Richardson and P. Domingos, “Mining knowledge-sharing sites for viral mar- keting,” in ACM SIGKDD, 2002.
[4] D. Kempe, J. Kleinberg, and E. Tardos, “Maximizing the spread of influence through a social network,” in ACM SIGKDD, 2003.
[5] S. Tang, J. Yuan, X. Mao, X. Y. Li, W. Chen, and G. Dai, “Relationship classi- fication in large scale online social networks and its impact on information prop- agation,” in IEEE INFOCOM, 2011.
[6] D. T. Nguyen, S. Das, and M. T. Thai, “Influence maximization in multiple online social networks,” in IEEE GLOBECOM, 2013.
[7] G. Tong, W. Wu, L. Guo, D. Li, C. Liu, B. Liu, and D.-Z. Du, “An efficient randomized algorithm for rumor blocking in online social networks,” in IEEE INFOCOM, 2017.
[8] C. Budak, D. Agrawal, and A. E. Abbadi, “Limiting the spread of misinformation in social networks,” in ACM WWW, 2011.
[9] X. He, G. Song, W. Chen, and Q. Jiang, “Influence blocking maximization in social networks under the competitive linear threshold model,” in SIAM SDM,





2012.
[10] Y. Ping, Z. Cao, and H. Zhu, “Sybil-aware least cost rumor blocking in social networks,” in IEEE GLOBECOM, 2014.
[11] L. G. Schiffman and L. L. Kanuk, Consumer Behavior. Prentice HalL, 2003.
[12] S. Martin E. P. and C. Mihaly, Positive Psychology: An Introduction.American Psychologist, 2000.
[13] “Last.fm,” [Online]. http://www.last.fm.
[14] Y. Tang, X. Xiao, and Y. Shi, “Influence maximization: Near-optimal time complexity meets practical efficiency,” in Proceedings of the 2014 ACM SIGMOD, 2014.
[15] S. Khuller, A. Moss, and J. Naor, “The budgeted maximum coverage problem,” in ACM IPL, 1999.
[16] A. Krause and C. Guestrin, “A note on the budgeted maximization of submod- ular functions,” in Technical Report. CMU-CALD-05-103, 2005.
[17] W. Gao, G. Cao, T. L. Porta, and J. Han, “On exploiting transient social contact patterns for data forwarding in delay-tolerant networks,” in IEEE TMC, 2013.
[18] Nguyen, H., Zheng, R.: On budgeted influence maximization in social networks. IEEE Journal on Selected Areas in Communications 31(6), 1084–1094 (2013)
[19] Y. Li,J. Fan, Y. Wang,KL. Tan. Influence Maximization on Social Graphs: A Survey. IEEE Transactions on Knowledge and Data Engineering.(2018)
[20] Lee, Chung-Wei et al. “The Algorithm of Seed Selection for Maximizing the Behavioral Intentions in Mobile Social Networks.” GLOBECOM 2017 - 2017 IEEE Global Communications Conference (2017): 1-7.
[21] Arndt, J. (1967), Word of Mouth Advertising: A Review of the Literature, Advertising Research Foundation, Inc., New York, NY.
[22] P.F. Bone,Word-of-mouth effects on short-term and long-term product judg-





ments,J Bus Res, 32 (3) (1995), pp. 213-223
[23] Arndt, Johan (1967), ”Perceived Risk, Sociometric Integration, and Word of Mouth in the Adoption of a New Food Product,” in Risk Taking and Information Handling in Consumer Behavior. ed. D. F. Cox, Boston: Harvard University, 289-316.
[24] Tybout, Alice M., Bobby J. Calder and Brian Sternthal (1981), ”Using Infor- mation Processing Theory to Design Marketing Strategies,” Journal of Marketing Research, 18 (February), 73-79.
[25] Weinberger, Marc G., Chris T. Allen and William R. Dillon (1981a), ”The Impact of Negative Marketing Communications: The Consumers Union/Chrysler Controversy,” Journal of Advertising, 10(4), 20-28.
[26] A. Goyal, W. Lu, and L. V. S. Lakshmanan, “Simpath: An efficient algorithm for influence maximization under the linear threshold model,” in Proceedings of the 2011 IEEE ICDM, 2011.
[27] K. Jung, W. Heo, and W. Chen, “Irie: Scalable and robust influence maximiza- tion in social networks,” in Proceedings of the 2012 IEEE 12th ICDM, 2012.