We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Nonsubmodular Constrained Profit Maximization in Attribute Networks.
- Authors
Du, Liman; Yang, Wenguo; Gao, Suixiang
- Abstract
The number of social individuals who interact with their friends through social networks is increasing, leading to an undeniable fact that word-of-mouth marketing has become one of the useful ways to promote sale of products. The Constrained Profit Maximization in Attribute network (CPMA) problem, as an extension of the classical influence maximization problem, is the main focus of this paper. We propose the profit maximization in attribute network problem under a cardinality constraint which is closer to the actual situation. The profit spread metric of CPMA calculates the total benefit and cost generated by all the active nodes. Different from the classical Influence Maximization problem, the influence strength should be recalculated according to the emotional tendency and classification label of nodes in attribute networks. The profit spread metric is no longer monotone and submodular in general. Given that the profit spread metric can be expressed as the difference between two submodular functions and admits a DS decomposition, a three-phase algorithm named as Marginal increment and Community-based Prune and Search(MCPS) Algorithm frame is proposed which is based on Louvain algorithm and logistic function. Due to the method of marginal increment, MPCS algorithm can compute profit spread more directly and accurately. Experiments demonstrate the effectiveness of MCPS algorithm.
- Subjects
PROFIT maximization; SUBMODULAR functions; SOCIAL networks; SOCIAL marketing; WORD of mouth advertising
- Publication
Asia-Pacific Journal of Operational Research, 2023, Vol 40, Issue 1, p1
- ISSN
0217-5959
- Publication type
Article
- DOI
10.1142/S0217595922400061