关键词: 社会网, 利润最大化, 动作日志, 时间长度

Abstract: Influence maximization is the problem of finding a small set of seed nodes in a social network. Existing works ignore the differences between influence spread maximization and profit maximization, and influence spread becomes stable when time passes by. This paper uses real action log and proposes a new propagation model with timespan which is called IVA-T (influence value allocation-T) propagation model, and firstly proposes time optimal profit maximization (OTPM) problem and proves that the problem is NP-hard. In order to solve the problem, this paper designs an effective approximation algorithm Profit-Max and analyzes the approximation ratio. The experimental  results on several real datasets show that Profit-Max algorithm can solve OTPM problem effectively and efficiently.

Key words: social network, profit maximization, action log, timespan