Generalized self-profit maximization and complementary-profit maximization in attribute networks

Liman Du (), Suixiang Gao () and Wenguo Yang ()
Additional contact information
Liman Du: University of Chinese Academy of Science
Suixiang Gao: University of Chinese Academy of Science
Wenguo Yang: University of Chinese Academy of Science

Journal of Combinatorial Optimization, 2023, vol. 45, issue 1, No 24, 27 pages

Abstract: Abstract Profit Maximization problem is an extension of Influence Maximization problem and aims to find a small set of initial adopters to maximize the expected profit generated by all the adopters after information dissemination. To the best of our knowledge, almost all the related works about Profit Maximization focus on one-entity diffusion model. In addition, emotion tendency and interest classification also play a role in real marketing process while their importance are underestimated in a lot of research. In this paper, we propose two novel nonsubmodular optimization problems, Generalized Self-profit Maximization in Attribute networks (GSMA) and Generalized Complementary-profit Maximization in Attribute networks (GCMA). Based on attribute networks’ community structure, these two problems consider the influence of both emotion tendency and interest classification on information dissemination process. GSMA problem focuses on supplement relationship and aims to maximize the expected value of profit. Whereas GCMA problem concentrates on the dependency relationship between entities and its goal is boosting the expected value of profit generated by adopter for an entity by selecting some initial adopters for its complementing entities. To solve these two problems, the R-GPMA algorithm framework which is inspired by sampling method and martingale analysis is designed. We evaluate our proposed algorithm by conducting experiments on randomly generated and real data sets and show that R-GPMA is superior in effectiveness and accuracy comparing with other baseline algorithms.

Keywords: Profit maximization; Nonsubmodularity; Attribute networks; Random algorithm; Martingale (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-022-00950-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:45:y:2023:i:1:d:10.1007_s10878-022-00950-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-022-00950-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().