Evidence map›Paper›PMID 42144427›Full record

ArticleScientific reports2026

Customer churn prediction in privacy-preserving HashCode-based security abstractions.

Asmaa Munshi

Abstract read
In one paragraph

Article in Scientific reports, 2026. 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

1 author.

Asmaa MunshiCollege of Computer Science and Engineering, University of Jeddah, Jeddah, 21577, Saudi Arabia. ammunshi@uj.edu.sa.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

This research presents a HashCode-based security abstraction that implements privacy-by-design in customer churn statistics, safeguarding identity while maintaining analytical integrity. A set of machine learning and deep learning models, including Logistic Regression, Random Forest, XGBoost, and a Multilayer Perceptron (MLP), is ideal for assessing churn while maintaining stringent privacy standards. Experimental results show that models that merely use behavioral, transactional, and temporal aspects can participate with and balance each other. The SGD Logistic Regression has an accuracy of 77.5%, a precision of 0.759, a recall of 0.812, an F1-score of 0.785, and an AUC of 0.815. This shows that it is quite sensitive to churners. The Random Forest has an accuracy of 77.0%, a precision of 0.767, a recall of 0.782, an F1-score of 0.775, and an AUC of 0.794. This means that it can generalize well. XGBoost has an accuracy of 74.0%, a precision of 0.733, a recall of 0.762, an F1-score of 0.748, and an AUC of 0.769. This shows that aggressive boosting doesn't work very well with this structured dataset. The MLP (Keras) has the best overall performance, with an accuracy of 80.0%, a precision of 0.802, a recall of 0.802, an F1-score of 0.802, and the highest AUC of 0.825. This shows that it is better at learning non-linear representations and balancing categorization. These results provide strong churn prediction without relying on rich identifiers or assumptions that need a lot of infrastructure, which is different from previous studies. The study offers a deployable, regulation-compliant architecture demonstrating that accurate churn prediction is attainable by behavior-driven analytics within a consistent security enforcement paradigm.

Identifiers

PMID42144427
PMCPMC13376773

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.