Fraud detection in digital financial transactions is traditionally formulated as a binary classification problem, although real-world fraud investigation requires analysts to prioritize a limited number of suspicious transactions according to operational risk and potential financial impact. This study reformulates fraud detection as an amount-aware operational ranking problem for fraud-risk prioritization. Transactions are organized into time-window query groups, and fraudulent transactions are assigned graded relevance based on training-only transaction-amount quartiles, enabling the ranking objective to distinguish low- and high-severity fraud without relying on proprietary cost matrices. The proposed formulation is implemented using a representative Learning-to-Rank framework based on LambdaMART, while an out-of-fold XGBoost risk score is incorporated as an auxiliary feature to refine the ranking representation rather than serve as the primary contribution. Experiments conducted on a public credit-card fraud dataset using chronological validation and future-holdout testing demonstrate that amount-aware relevance consistently improves severity-aware top-rank ordering compared with conventional binary relevance. The proposed HybridLTR_amount model significantly outperforms XGBClassifier and PureLTR_binary in terms of all-query NDCG@10, whereas its performance is not statistically different from PureLTR_amount, indicating that the primary empirical improvement is attributable to the amount-aware ranking formulation rather than the auxiliary hybrid component. Additional operational analyses show that high-risk transactions and fraudulent financial losses are concentrated within a compact top-ranked segment, while budget-oriented evaluation demonstrates the practical value of the proposed formulation under limited analyst review capacity. These findings establish amount-aware operational ranking as an effective formulation-centric framework for operational fraud-risk prioritization rather than as a new classification algorithm.
Copyrights © 2026