.png){kind=icon}
返回
A Survey on Influence Maximization: From an ML-Based Combinatorial Optimization
.png){kind=icon}
OA
AI
DOI：10.1145/3604559.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Influence Maximization (IM) is a classical combinatorial optimization problem, which can be widely used in mobile networks, social computing, and recommendation systems. It aims at selecting a small number of users such that maximizing the influence spread across the online social network. Because of its potential commercial and academic value, there are a lot of researchers focusing on studying the IM problem from different perspectives. The main challenge comes from the NP-hardness of the IM problem and #P-hardness of estimating the influence spread, thus traditional algorithms for overcoming them can be categorized into two classes: heuristic algorithms and approximation algorithms. However, there is no theoretical guarantee for heuristic algorithms, and the theoretical design is close to the limit. Therefore, it is almost impossible to further optimize and improve their performance. With the rapid development of artificial intelligence, technologies based on Machine Learning (ML) have achieved remarkable achievements in many fields. In view of this, in recent years, a number of new methods have emerged to solve combinatorial optimization problems by using ML-based techniques. These methods have the advantages of fast solving speed and strong generalization ability to unknown graphs, which provide a brand-new direction for solving combinatorial optimization problems. Therefore, we abandon the traditional algorithms based on iterative search and review the recent development of ML-based methods, especially Deep Reinforcement Learning, to solve the IM problem and other variants in social networks. We focus on summarizing the relevant background knowledge, basic principles, common methods, and applied research. Finally, the challenges that need to be solved urgently in future IM research are pointed out.
Keyword:
Influence maximization
machine learning
social networks
combinatorial optimization
deep reinforcement learning
graph embedding
期刊
IF:
4.8
论文数:
1.3K
被引数:
4.4K
机构
引用论文
Succinylated copper, zinc superoxide dismutase. A novel approach to the problem of active subunits琥珀酰化铜，锌超氧化物歧化酶。一种解决活性亚基问题的新方法.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏
查看更多内容