Multi-Task Learning for Influence Estimation and Maximization

• Published in: IEEE transactions on knowledge and data engineering Vol. 34; no. 9; pp. 4398 - 4409
• Main Authors: Panagopoulos, George, Malliaros, Fragkiskos D., Vazirgiannis, Michalis
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.09.2022; The Institute of Electrical and Electronics Engineers, Inc. (IEEE); Institute of Electrical and Electronics Engineers
• Subjects: Algorithms; Artificial Intelligence; Biological system modeling; Computational modeling; Computer Science; Diffusion; Estimation; influence learning; Influence maximization; Integrated circuit modeling; Jacobian matrices; Learning; Machine Learning; Maximization; multi-task learning; Neural networks; Nodes; Optimization; Social and Information Networks; Social networking (online); Social networks; multi-task learning; influence maximization; influence learning
• ISSN: 1041-4347; 1558-2191
• DOI: 10.1109/TKDE.2020.3040028

We address the problem of influence maximization when the social network is accompanied by diffusion cascades. In the literature, such information is used to compute influence probabilities, which is utilized by stochastic diffusion models in influence maximization. Motivated by the recent criticism on diffusion models and the galloping advancements in influence learning, we propose IMINFECTOR (Influence Maximization with INFluencer vECTORs), a method that uses representations learned from diffusion cascades to perform model-independent influence maximization. The first part of our methodology is a multi-task neural network that learns embeddings of nodes that initiate cascades (influencer vectors) and embeddings of nodes that participate in them (susceptible vectors). The norm of an influencer vector captures a node's aptitude to initiate lengthy cascades and is used to reduce the number of candidate seeds. The combination of influencer and susceptible vectors form the diffusion probabilities between nodes. These are used to reformulate the computation of the influence spread and propose a greedy solution to influence maximization that retains the theoretical guarantees. We apply our method in three sizable datasets and evaluate it using cascades from future time steps. IMINFECTOR 's scalability and accuracy outperform various competitive algorithms and metrics from the diverse landscape of influence maximization.