透過您的圖書館登入
IP:18.222.119.148
  • 學位論文

以機器學習為基礎之社群網路下的競爭影響力最大化

A Learning-based Framework to Handle Multi-round Competitive Influence Maximization on Social Networks

指導教授 : 陳銘憲

摘要


隨著社群媒體的興起,人們藉由社群網路接受到的訊息越來越多,受到的影響也越來越大。因此有很多公司想借由這種社群上的影響力來做行銷。這些公司會挑選某些關鍵人物在社群網路上發表產品訊息,藉由人們在社群上互相傳遞訊息的模式,期望此訊息能影響到最多的人,得到最多的客戶。這類挑選關鍵人物經由社群傳遞訊息,使預期影響範圍達到最大的問題我們稱為影響力最大化問題。然而不同的公司若有類似產品或服務,他們的市場就會重疊,需要去競爭有限的客戶資源。考慮到這些公司的競爭關係,這篇論文採用學習為基礎的框架去解決這種社群網路下多回合競爭影響力最大化問題。我們提出了一個資料導向的方法,利用後設學習的概念,在強化學習的架構下去最大化長期影響力的期望值。當公司在挑選關鍵人物去競爭客戶時,我們的方法不只考慮到社群間的資訊還考慮了對手公司的策略。在多回合的問題下,我們的方法可以達到長期影響力總和的最大化,而不是近視短利地去追求每一回的最大化。我們分別在對手策略已知、對手策略未知但可持續對他訓練,和對手策略未知且不可持續對他訓練的這三個情況下,提出了各自的解法。最後在實驗結果中顯示出在我們提出的架構下,我們的方法能達到預期的效果,並驗證了事前提出的假設。

並列摘要


Considering nowadays companies providing similar products or services compete with each other for resources and customers, this work proposes a learning-based framework to tackle the multi-round competitive influence maximization problem on a social network. We propose a data-driven model leveraging the concept of meta-learning to maximize the expected influence in the long run. Our model considers not only the network information but also the opponent's strategy while making a decision. It maximizes the total influence in the end of the process instead of myopically pursuing short term gain. We propose solutions for scenarios when the opponent's strategy is known or unknown and available or unavailable for training. We also show how an effective framework can be trained without manually labeled data, and conduct several experiments to verify the effectiveness of the whole process.

參考文獻


[2] S. Bharathi, D. Kempe, and M. Salek. Competitive influence maximization in social networks. In Workshop on Internet and Network Economics, 2007.
[3] A. Borodin, Y. Filmus, and J. Oren. Threshold models for competitive influence in social networks. In Workshop on Internet & Network Economics, 2010.
[5] T. Carnes, C. Nagarajan, S. M. Wild, and A. van Zuylen. Maximizing influence in a competitive social network: A follower’s perspective. In International Conference on Electronic Commerce, pages 351–360, 2007.
[6] H.-H. Chen, Y.-B. Ciou, and S.-D. Lin. Information propagation game: a tool to acquire human playing data for multiplayer influence maximization on social networks. In ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2012.
[7] W. Chen, A. Collins, R. Cummings, T. Ke, Z. Liu, D. Rincon, X. S. snd Yajun Wang, W. Wei, and Y. Yuan. Influence maximization in social networks when negative opinions may emerge and propagate. In SIAM International Conference on Data Mining, 2011.

延伸閱讀