Author
Listed:
- Liman Du
(School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing 100049, P. R. China)
- Wenguo Yang
(School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing 100049, P. R. China)
- Suixiang Gao
(School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing 100049, P. R. China)
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.
Suggested Citation
Liman Du & Wenguo Yang & Suixiang Gao, 2023.
"Nonsubmodular Constrained Profit Maximization in Attribute Networks,"
Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 40(01), pages 1-22, February.
Handle:
RePEc:wsi:apjorx:v:40:y:2023:i:01:n:s0217595922400061
DOI: 10.1142/S0217595922400061
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:apjorx:v:40:y:2023:i:01:n:s0217595922400061. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.