| 한글제목(Korean Title) |
Running Time Improvement of Influence Maximization in Social Network Using Graph Reducing Technique (GRT) |
| 영문제목(English Title) |
Running Time Improvement of Influence Maximization in Social Network Using Graph Reducing Technique (GRT) |
| 저자(Author) |
Ashis Talukder
Anupam Kumar Bairagi
VanDung Nguyen
Choong Seon Hong
|
| 원문수록처(Citation) |
VOL 42 NO. 02 PP. 1391 ~ 1393 (2015. 12) |
한글내용
(Korean Abstract) |
|
영문내용
(English Abstract) |
Influence maximization is to find a small seed set of most influence people in a domain. With the increased popularity of social network, influence maximization in the social network has become a potential problem and the result has been begun to be applied in various applications like viral marketing, domain expert search, recommending network etc. The basic influence maximization problem is NP-hard and many researchers has developed different approximation algorithms. In this research we have proposed an algorithm named Graph Reduced Technique (GRT) which estimates influence based on heuristics. The algorithm offers better running time and with feasible amount of spread of influence. |
| 키워드(Keyword) |
|
| 파일첨부 |
PDF 다운로드
|
