TY - GEN
T1 - Multi-attribute Based Influence Maximization in Social Networks
AU - Ni, Qiufen
AU - Guo, Jianxiong
AU - Du, Hongmin W.
N1 - Publisher Copyright:
© 2021, Springer Nature Switzerland AG.
PY - 2021
Y1 - 2021
N2 - Viral marketing on social networks is an important application and hot research problem. Most of the related work on viral marketing focuses on the spread of single information, while a product may associate with multi-attribute in real life. Information on multiple attributes of a product propagates in the social networks simultaneously and independently. The attribute information that a user receives will determine whether he would purchase the product or not. We extend the traditional single information influence maximization problem to the Multi-attribute based Influence Maximization Problem (MIMP). We present the Multi-dimensional IC model (MIC model) for the proposed problem. The objective function for MIMP is proved to be non-submodular, then we solve the problem with the Sandwich Algorithm, which can get a max{f(SU)f¯(SU),f̲(SL∗)f(So∗)}(1-1/e) approximation ratio to the optimal solution. Experiments are conducted in two real world datasets to verify the correctness and effectiveness of the proposed algorithm.
AB - Viral marketing on social networks is an important application and hot research problem. Most of the related work on viral marketing focuses on the spread of single information, while a product may associate with multi-attribute in real life. Information on multiple attributes of a product propagates in the social networks simultaneously and independently. The attribute information that a user receives will determine whether he would purchase the product or not. We extend the traditional single information influence maximization problem to the Multi-attribute based Influence Maximization Problem (MIMP). We present the Multi-dimensional IC model (MIC model) for the proposed problem. The objective function for MIMP is proved to be non-submodular, then we solve the problem with the Sandwich Algorithm, which can get a max{f(SU)f¯(SU),f̲(SL∗)f(So∗)}(1-1/e) approximation ratio to the optimal solution. Experiments are conducted in two real world datasets to verify the correctness and effectiveness of the proposed algorithm.
KW - Approximation algorithm
KW - Influence maximization
KW - Multi-attribute information
KW - Social network
UR - https://www.scopus.com/pages/publications/85122021638
UR - https://www.scopus.com/pages/publications/85122021638#tab=citedBy
U2 - 10.1007/978-3-030-93176-6_21
DO - 10.1007/978-3-030-93176-6_21
M3 - Conference contribution
AN - SCOPUS:85122021638
SN - 9783030931759
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 240
EP - 251
BT - Algorithmic Aspects in Information and Management - 15th International Conference, AAIM 2021, Proceedings
A2 - Wu, Weili
A2 - Du, Hongwei
PB - Springer Science and Business Media Deutschland GmbH
T2 - 15th International Conference on Algorithmic Aspects in Information and Management, AAIM 2021
Y2 - 20 December 2021 through 22 December 2021
ER -