원문정보
보안공학연구지원센터(IJMUE)
International Journal of Multimedia and Ubiquitous Engineering
Vol.11 No.10
2016.10
pp.67-82
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
Aiming at the problems such as the HIM algorithm has a very high time complexity and cannot be applied in the large social networks and so on, and this paper puts forward the hybrid influence maximization algorithm. The algorithm carries out the detailed experiments on 6 real data sets with different characteristics. The experiments show that compared with the HIM algorithm, the algorithm in this paper has great improvement in the scope of influence.
목차
Abstract
1. Introduction
2. Influence Maximization
3. Hybrid Algorithm for Influence Maximization
3.1. Presentation of Framework and the HPG Algorithm
3.2. Improvement of the uv u Estimation Formula
3.3. Time Complexity Analysis of HIM Algorithm and HPG Algorithm
4. Experimental Simulation and Analysis
4.1. Experimental Data
4.2. Experimental Environment
4.3. Results Analysis
5. Conclusion
References
1. Introduction
2. Influence Maximization
3. Hybrid Algorithm for Influence Maximization
3.1. Presentation of Framework and the HPG Algorithm
3.2. Improvement of the uv u Estimation Formula
3.3. Time Complexity Analysis of HIM Algorithm and HPG Algorithm
4. Experimental Simulation and Analysis
4.1. Experimental Data
4.2. Experimental Environment
4.3. Results Analysis
5. Conclusion
References
저자정보
참고문헌
자료제공 : 네이버학술정보