Zonglin Han
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zonglin Han has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Andrej Zlatos
Department of Mathematics, UC San Diego, La Jolla, USA
4 shared publications - Kejian Tong
Independent Researcher, Mukilteo, USA
2 shared publications - Yanxin Shen
Independent Researcher, China
2 shared publications - Yijing Wei
Northwestern University, USA
2 shared publications - Yujian Long
Independent Researcher, USA
2 shared publications - Amir Alwan
Booth School of Business, University of Chicago, 5807 S. Woodlawn Avenue, Chicago, IL 60637, United States of America
1 shared publication
Latest Publications
- Open Access
- 10 December 2025
- Published by Springer Nature in Research Square
An Integrated Machine Learning and Deep Learning Framework for Credit Card Approval Prediction
Credit scoring is vital in the financial industry,assessing the risk of lending to credit card applicants. Traditionalcredit scoring methods face challenges with large datasets anddata imbalance between creditworthy and non-creditworthy applicants.This paper introduces an advanced machine learningand deep learning framework to improve the accuracy andreliability of credit card approval predictions. We utilized extensivedatasets of user application records and credit history,implementing a comprehensive preprocessing strategy, featureengineering, and model integration. Our methodology combinesneural networks with an ensemble of base models, includinglogistic regression, support vector machines, k-nearest neighbors,decision trees, random forests, and gradient boosting. The ensembleapproach addresses data imbalance using Synthetic MinorityOver-sampling Technique (SMOTE) and mitigates overfittingrisks. Experimental results show that our integrated modelsurpasses traditional single-model approaches in precision, recall,F1-score, AUC, and Kappa, providing a robust and scalablesolution for credit card approval predictions. This researchunderscores the potential of advanced machine learning techniquesto transform credit risk assessment and financial decisionmaking.
- 10 December 2025
- Published by Springer Nature in Research Square
Open AccessAn Integrated Machine Learning and Deep Learning Framework for Credit Card Approval Prediction
Credit scoring is vital in the financial industry,assessing the risk of lending to credit card applicants. Traditionalcredit scoring methods face challenges with large datasets anddata imbalance between creditworthy and non-creditworthy applicants.This paper introduces an advanced machine learningand deep learning framework to improve the accuracy andreliability of credit card approval predictions. We utilized extensivedatasets of user application records and credit history,implementing a comprehensive preprocessing strategy, featureengineering, and model integration. Our methodology combinesneural networks with an ensemble of base models, includinglogistic regression, support vector machines, k-nearest neighbors,decision trees, random forests, and gradient boosting. The ensembleapproach addresses data imbalance using Synthetic MinorityOver-sampling Technique (SMOTE) and mitigates overfittingrisks. Experimental results show that our integrated modelsurpasses traditional single-model approaches in precision, recall,F1-score, AUC, and Kappa, providing a robust and scalablesolution for credit card approval predictions. This researchunderscores the potential of advanced machine learning techniquesto transform credit risk assessment and financial decisionmaking.
- Open Access
An Integrated Machine Learning and Deep Learning Framework for Credit Card Approval Prediction
Credit scoring is vital in the financial industry, assessing the risk of lending to credit card applicants. Traditional credit scoring methods face challenges with large datasets and data imbalance between creditworthy and non-creditworthy applicants. This paper introduces an advanced machine learning and deep learning framework to improve the accuracy and reliability of credit card approval predictions. We utilized extensive datasets of user application records and credit history, implementing a comprehensive preprocessing strategy, feature engineering, and model integration. Our methodology combines neural networks with an ensemble of base models, including logistic regression, support vector machines, k-nearest neighbors, decision trees, random forests, and gradient boosting. The ensemble approach addresses data imbalance using Synthetic Minority Over-sampling Technique (SMOTE) and mitigates overfitting risks. Experimental results show that our integrated model surpasses traditional single-model approaches in precision, recall, F1-score, AUC, and Kappa, providing a robust and scalable solution for credit card approval predictions. This research underscores the potential of advanced machine learning techniques to transform credit risk assessment and financial decision-making.
Open AccessAn Integrated Machine Learning and Deep Learning Framework for Credit Card Approval Prediction
Credit scoring is vital in the financial industry, assessing the risk of lending to credit card applicants. Traditional credit scoring methods face challenges with large datasets and data imbalance between creditworthy and non-creditworthy applicants. This paper introduces an advanced machine learning and deep learning framework to improve the accuracy and reliability of credit card approval predictions. We utilized extensive datasets of user application records and credit history, implementing a comprehensive preprocessing strategy, feature engineering, and model integration. Our methodology combines neural networks with an ensemble of base models, including logistic regression, support vector machines, k-nearest neighbors, decision trees, random forests, and gradient boosting. The ensemble approach addresses data imbalance using Synthetic Minority Over-sampling Technique (SMOTE) and mitigates overfitting risks. Experimental results show that our integrated model surpasses traditional single-model approaches in precision, recall, F1-score, AUC, and Kappa, providing a robust and scalable solution for credit card approval predictions. This research underscores the potential of advanced machine learning techniques to transform credit risk assessment and financial decision-making.
- 17 August 2023
- Published by Springer Nature in Archive for Rational Mechanics and Analysis
- Vol. 247 (5) , 1-22
Uniqueness of Positive Vorticity Solutions to the 2d Euler Equations on Singular Domains
- 17 August 2023
- Published by Springer Nature in Archive for Rational Mechanics and Analysis
- Vol. 247 (5) , 1-22
Uniqueness of Positive Vorticity Solutions to the 2d Euler Equations on Singular Domains
- 25 August 2021
- Published by Springer Nature in Annals of PDE
- Vol. 7 (2) , 1-31
Euler Equations on General Planar Domains
- 25 August 2021
- Published by Springer Nature in Annals of PDE
- Vol. 7 (2) , 1-31
Euler Equations on General Planar Domains
- Open Access
Euler Equations on General Planar Domains
We obtain a general sufficient condition on the geometry of possibly singular planar domains that guarantees global uniqueness for any weak solution to the Euler equations on them whose vorticity is bounded and initially constant near the boundary. This condition is only slightly more restrictive than exclusion of corners with angles greater than $\pi$ and, in particular, is satisfied by all convex domains. The main ingredient in our approach is showing that constancy of the vorticity near the boundary is preserved for all time because Euler particle trajectories on these domains, even for general bounded solutions, cannot reach the boundary in finite time. We then use this to show that no vorticity can be created by the boundary of such possibly singular domains for general bounded solutions. We also show that our condition is essentially sharp in this sense by constructing domains that come arbitrarily close to satisfying it, and on which particle trajectories can reach the boundary in finite time. In addition, when the condition is satisfied, we find sharp bounds on the asymptotic rate of the fastest possible approach of particle trajectories to the boundary.Open AccessEuler Equations on General Planar Domains
We obtain a general sufficient condition on the geometry of possibly singular planar domains that guarantees global uniqueness for any weak solution to the Euler equations on them whose vorticity is bounded and initially constant near the boundary. This condition is only slightly more restrictive than exclusion of corners with angles greater than $\pi$ and, in particular, is satisfied by all convex domains. The main ingredient in our approach is showing that constancy of the vorticity near the boundary is preserved for all time because Euler particle trajectories on these domains, even for general bounded solutions, cannot reach the boundary in finite time. We then use this to show that no vorticity can be created by the boundary of such possibly singular domains for general bounded solutions. We also show that our condition is essentially sharp in this sense by constructing domains that come arbitrarily close to satisfying it, and on which particle trajectories can reach the boundary in finite time. In addition, when the condition is satisfied, we find sharp bounds on the asymptotic rate of the fastest possible approach of particle trajectories to the boundary. - 8 February 2019
- Published by IOP Publishing in Nonlinearity
- Vol. 32 (3) , 927-941
Multidimensional transition fronts for Fisher–KPP reactions
We study entire solutions to homogeneous reaction–diffusion equations in several dimensions with Fisher–KPP reactions. Any entire solution is known to satisfy and we consider here those satisfying When is and concave, our main result provides an almost complete characterization of transition fronts as well as transition solutions with bounded width within this class of solutions.
- 8 February 2019
- Published by IOP Publishing in Nonlinearity
- Vol. 32 (3) , 927-941
Multidimensional transition fronts for Fisher–KPP reactions
We study entire solutions to homogeneous reaction–diffusion equations in several dimensions with Fisher–KPP reactions. Any entire solution is known to satisfy and we consider here those satisfying When is and concave, our main result provides an almost complete characterization of transition fronts as well as transition solutions with bounded width within this class of solutions.