Please use this identifier to cite or link to this item:
|Title:||Influence maximization on dynamic graphs - project 1||Authors:||Cao, Gaoxu||Keywords:||DRNTU::Engineering::Computer science and engineering::Computing methodologies::Computer graphics||Issue Date:||2017||Abstract:||With the increasing popularity of social media and different emerging social networks, the impact of social influencers turns to more significant in people’s decision making process. In light of this opportunity, researchers have developed different methodologies to estimate influential spread of people in social network, and to effectively identify the top-k influencers, who will maximize the influence among all social network users. However, in reality, the social networks have a highly dynamic nature and involve rapidly over time. The results based on one specific static graph will be outdated quickly. And The re-run of program on massive networks requires an expensive computational cost every time.In order to address this issue, researchers proposed new algorithms, such as DIM and OINT, which can effectively find the top-k influencers and estimate their influential spread in dynamic settings.In this project, a dataset of dynamic network graphs is firstly created from DBLP database. After that, some modifications and implementations are complemented on top of the paper authors’ code to ensure the both programs are able to run on the created dataset. Additionally, experimental evaluations using the created dynamic networks with millions of edges were done to demonstrate the efficiency, stability and accuracy of both DIM and OINT algorithms. The performance of two programs are compared with each other in detail as well. Based on the outcome of experiments, DIM algorithm provides a better performance in terms of the accuracy of influential spread estimation and required running time to identified the top-k influencers. It also provides a significant improvement over the static algorithms on time consumption for top-k influencers indemnification in dynamic settings and it does not cost much accuracy.||URI:||http://hdl.handle.net/10356/70505||Rights:||Nanyang Technological University||Fulltext Permission:||restricted||Fulltext Availability:||With Fulltext|
|Appears in Collections:||SCSE Student Reports (FYP/IA/PA/PI)|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.