Smart Tech, Scared Users: A Behavioral Analysis of AI-Powered Solutions for Cyberthreat-Induced Customer Complaints in Low-Income Countries
Bibliographic record
Abstract
In the face of rising cyber incidents in digital banking, artificial intelligence (AI) has emerged as a critical tool for automating threat detection, enhancing response speed, and improving complaint resolution. However, the success of such technological interventions depends significantly on user behavior, perceptions, and willingness to use these systems. This study examines the behavioral determinants influencing the implementation of AI-powered solutions for cyberthreat-induced customer complaints for banks in low-income countries. Guided by the protection motivation theory (PMT), the study adopted a quantitative, cross-sectional survey design involving 350 respondents, comprising 315 bank customers and 35 frontline bank staff, across seven Nigerian banks with international authorization. PMT constructs were used to develop the Likert-based questionnaire. Data were analyzed using Ordinal Logistic Regression (OLR) model. The findings reveal that perceived severity (? = 0.455, p < 0.05), perceived vulnerability (? = 0.387, p < 0.05), response efficacy (? = 0.658, p < 0.05), and self-efficacy (? = 0.587, p < 0.05) have positive and significant effects on AI-powered solutions for cyberthreat-induced customer complaints. However, response cost (? = -0.405, p < 0.05) has negative and significant effects on AI-powered solutions for cyberthreat-induced customer complaints. This study contributes to the growing field of AI solutions for cyber related customer complaints in banks by offering a behaviorally grounded framework for understanding how threat appraisals and coping appraisals drive support for AI-powered cyber complaint solutions. The study recommends that banks in low-income countries should actively communicate the effectiveness and success rates of AI-powered tools such as chatbots, anomaly detection systems, and automated complaint resolution platforms to demonstrate how these systems resolve issues faster, more securely, and more accurately so as to build trust among users.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.010 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".