開源欺詐偵測系統推出

🔑 增強重點摘要

• •The project is a refactored production-grade Python application using Random Forest and XGBoost on the PaySim dataset to handle 0.17% class imbalance via class weighting, achieving ~0.999 ROC-AUC[4].
• •Modular design decouples data ingestion (data_loader.py), feature engineering (features.py including time-based and behavioral flags), and modeling (model.py with joblib persistence)[4].
• •Includes full pytest integration tests, automated evaluation with ROC-AUC, confusion matrix, and precision-recall reports, plus audit logging for production readiness[4].
• •Serves as a professional ML project template beyond Jupyter notebooks, with detailed docs on architecture and testing strategy[4].
• •Recent arXiv paper (Feb 2026) on similar European credit card dataset uses optimized Explainable Boosting Machine (EBM) with Taguchi method, achieving 0.983 AUC, highlighting interpretable alternatives to Random Forest[1][2].

🛠️ 技術深入

• •Dataset: PaySim synthetic mobile money transactions with ~0.17% fraud class; alternative Kaggle European credit card dataset has 284,807 transactions, 30 features[1][2][4].
• •Imbalance handling: class_weight='balanced' for Random Forest, scale_pos_weight for XGBoost; avoids sampling to prevent bias/information loss[1][4].
• •Modular structure: data_loader.py (ingestion/cleaning), features.py (time-based features, behavioral flags), model.py (training/persistence with joblib)[4].
• •Evaluation: ROC-AUC ~0.999, confusion matrix, precision-recall; full pytest end-to-end tests[4].
• •Competitive approach: EBM with Taguchi method for scaler sequence/hyperparameter optimization, feature selection to top 18 variables, outperforms RF/XGBoost[1][2].

🔮 前景展望AI analysis grounded in cited sources

⏳ 時間線