Publish time: 2022-08-08 00:00:00
IM aims to select k users for the promotion of a target item by maximizing the total spread of their influence. However, most previous works on IM do not explore the dynamic user perception of promoted items in the process. In this work, by exploiting the KG to capture dynamic user perception, we formulate the IMDPP problem that considers user preferences and social influence reflecting the impact of relevant item adoptions. We prove the hardness of IMDPP and design an approximation algorithm, named Dysim. The experimental results show that Dysim effectively achieves at least 6 times of influence spread in large datasets over the state-of-the-art approaches.
- Our proposed algorithm Dysim effectively achieves up to 6.7 times of influence spread in large datasets over the state-of-the-art approaches.
- Our proposed algorithm Dysim is close to the optimal solution.

Figure1 The comparison of influence spread on the large-scale dataset Douban.
05T-1110708
Know-how
- Marketing strategies for E-commerce platforms
- Event prediction and optimization through knowledge graphs for industry
Yang, De-Nian; Teng, Ya-Wen
If you are interested in this technology, please fill in the information on the webpage under the manufacturer option (Request for Technology Licensing, Material Transfer, or Sponsored Research) on the website of this office

Figure2 The comparison of influence spread with optimal solutions

Influence maximization based on dynamic personal perception in knowledge graph