Evidence map›Paper›PMID 41422130›Full record

ArticleScientific reports2025

Advanced customer churn prediction for a music streaming digital marketing service using attention graph-based deep learning approach.

Haiyan Cheng, Jie He

Abstract read
In one paragraph

Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Haiyan ChengMaster School of Economics and Management Department, Gongqing College, Nanchang University, Jiujiang, Gongqing City, 332020, China. hiayanchengreas@hotmail.com.
Jie HeMaster School of Economics and Management Department, Gongqing College, Nanchang University, Jiujiang, Gongqing City, 332020, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Customer churn poses a persistent threat to the sustainability of music streaming platforms, where user disengagement often occurs unpredictably. Most existing churn prediction methods fail to integrate relational dependencies among users or address the limitations of static, tabular models in imbalanced datasets. In this research, we propose a Hybrid Graph Attention Network (Hybrid GAT + MLP (Multi Layered Perceptron)) that efficiently combines graph-based learning with deep tabular feature modelling, allowing the capture of both individual behaviour and peer-influenced churn patterns. The use of a synthetic similarity graph enables the model to learn from neighbourhood context, while a weighted loss function ensures robustness against class imbalance without altering data distribution. The model was evaluated on the KKBox dataset, achieving an accuracy of 95.8% with an AUC score of 0.9626, indicating high discriminative power. Additional metrics, such as F1-score, confusion matrix, and ROC analysis, ensure the system’s ability to generalize across both churn and non-churn classes. These results validate the applicability of our approach to large-scale, real-world scenarios involving churn detection. All code and the curated dataset for customer churn prediction for music steaming is available at the https://github.com/haiyanchenas/Advanced-Customer-Churn-Prediction-for-a-Music-Streaming-Digital-Marketing-Service/tree/main enabling reproducibility of our findings.

Indexed as

Churn predictionClass imbalanceGraph attention networkHybrid GNNKKBox datasetMLPNode embeddingWeighted loss function

Identifiers

PMID41422130
PMCPMC12749653

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.