INFLECT-DGNN: Influencer Prediction With Dynamic Graph Neural Networks

被引:0
作者
Tiukhova, Elena [1 ]
Penaloza, Emiliano [2 ]
Oskarsdottir, Maria [3 ]
Baesens, Bart [1 ,4 ]
Snoeck, Monique [1 ]
Bravo, Cristian
机构
[1] Katholieke Univ Leuven, Res Ctr Informat Syst Engn LIRIS, B-3000 Leuven, Belgium
[2] Western Univ, Dept Stat & Actuarial Sci, London, ON N6A 5B7, Canada
[3] Reykjavik Univ, Dept Comp Sci, IS-102 Reykjavik, Iceland
[4] Univ Southampton, Dept Decis Analyt & Risk, Southampton SO17 1BJ, England
来源
IEEE ACCESS | 2024年 / 12卷
关键词
Graph neural networks; Logic gates; Predictive models; Biological system modeling; Computer architecture; Task analysis; Recurrent neural networks; Dynamic graph neural networks; graph isomorphism networks (GINs); graph attention networks (GATs); referral marketing; influencer prediction; REFERRAL PROGRAMS;
D O I
10.1109/ACCESS.2024.3443533
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Leveraging network information for predictive modeling has become widespread in many domains. Within the realm of referral and targeted marketing, influencer detection stands out as an area that could greatly benefit from the incorporation of dynamic network representation due to the continuous evolution of customer-brand relationships. In this paper, we present INFLECT-DGNN, a new method for profit-driven INFLuencer prEdiCTion with Dynamic Graph Neural Networks that innovatively combines Graph Neural Networks (GNNs) and Recurrent Neural Networks (RNNs) with weighted loss functions, synthetic minority oversampling adapted to graph data, and a carefully crafted rolling-window strategy. We introduce a novel profit-driven framework that supports decision-making based on model predictions. To test the framework, we use a unique corporate dataset with diverse networks, capturing the customer interactions across three cities with different socioeconomic and demographic characteristics. Our results show how using RNNs to encode temporal attributes alongside GNNs significantly improves predictive performance, while the profit-driven framework determines the optimal classification threshold for profit maximization. We compare the results of different models to demonstrate the importance of capturing network representation, temporal dependencies, and using a profit-driven evaluation. Our research has significant implications for the fields of referral and targeted marketing, expanding the technical use of deep graph learning within corporate environments.
引用
收藏
页码:115026 / 115041
页数:16
相关论文
共 46 条
  • [11] Fey M., 2019, P ICLR WORKSH REPR L
  • [12] Garcia H., 2022, P NEURLPS TEMP GRAPH
  • [13] Graves A, 2012, STUD COMPUT INTELL, V385, P1, DOI [10.1007/978-3-642-24797-2, 10.1162/neco.1997.9.1.1]
  • [14] Hu W., 2020, INT C LEARN REPR
  • [15] MAGRes-UNet: Improved Medical Image Segmentation Through a Deep Learning Paradigm of Multi-Attention Gated Residual U-Net
    Hussain, Tahir
    Shouno, Hayaru
    [J]. IEEE ACCESS, 2024, 12 : 40290 - 40310
  • [16] EDGly: detection of influential nodes using game theory
    Jain, Minni
    Jaswani, Aman
    Mehra, Ankita
    Mudgal, Laqshay
    [J]. MULTIMEDIA TOOLS AND APPLICATIONS, 2022, 81 (02) : 1625 - 1647
  • [17] King DB, 2015, ACS SYM SER, V1214, P1, DOI 10.1021/bk-2015-1214.ch001
  • [18] Social Network Analytics for Supervised Fraud Detection in Insurance
    Oskarsdottir, Maria
    Ahmed, Waqas
    Antonio, Katrien
    Baesens, Bart
    Dendievel, Remi
    Donas, Tom
    Reynkens, Tom
    [J]. RISK ANALYSIS, 2022, 42 (08) : 1872 - 1890
  • [19] Time series for early churn detection: Using similarity based classification for dynamic networks
    Oskarsdottir, Maria
    Van Calster, Tine
    Baesens, Bart
    Lemahieu, Wilfried
    Vanthienen, Jan
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2018, 106 : 55 - 65
  • [20] Social network analytics for churn prediction in telco: Model building, evaluation and network architecture
    Oskarsdottir, Maria
    Bravo, Cristian
    Verbeke, Wouter
    Sarraute, Carlos
    Baesens, Bart
    Vanthienen, Jan
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2017, 85 : 204 - 220