至今有關解決影響力最大化問題已經有許多的方法及文獻,這些方法和文獻都是基於貪婪演算法。不過,因為社群網路規模日趨龐大,因此使得演算法的效率及可擴展性越來越重要。近年來有關影響力最大化問題的研究也都著重於演算法的效率,但這些方法都是以分析靜態的資料(社群網路)為主。然而現今的社群網路成長速度非常快速,在社群網絡上每分每秒都有新的關係或互動產生,我們將之稱為動態社群網路。因此在本文中我們分析的對象主要是以動態社群網路為主,藉由觀察動態社群網路結構的變化,找出變化的規則並建構出一個模型,來預測未來的社群結構,最後利用有效率的演算法來解決影響力最大化問題。我們的實驗也證實了我們的預測模型有很高的精准度,並且藉由觀察動態社群網路所預測得到未來網路結構上能得到與靜態網路不同的使用者集合,並且能得到更大的影響力散播。
Up to now, much literature has focused on influence maximization problem. These methods and literature are all based on the greedy algorithm. However, social networks are growing rapidly, so the efficiency and scalability of the algorithm have become more important. In recent years, the study on the issue of influence maximization has also focused on the efficiency of the algorithm, but these studies are all based on the analysis of the static social network. However, every minute and second has new relationships or interaction on the social network, we describe this status as the dynamic social network. Therefore, in this paper, we focus on the analysis of the dynamic social network. By observing the changes in the dynamic social network structure, we can find out the pattern of variation and build a model to predict the future network structure. Eventually, using an efficient algorithm to solve the influence maximization problem based on the dynamic social network. The experimental results show that our prediction model has a high accuracy, we also can obtain a seed set different from the analysis of static social network and get more influence spreads.