Optimal selection of a probabilistic machine learning model for predicting high run chase outcomes in T-20 international cricket

Predicting high-run chases in cricket is a complex task influenced by various factors, including team rankings, match conditions, pitch behavior, and inning scores. This study evaluates the effectiveness of probabilistic machine learning models, namely Naïve Bayes (NB), Bayesian Network (BN), Bayesian Regularized Neural Network (BRNN), Hidden Naïve Bayes (HNB), Correlation Feature-Based Filter Weighting Naïve Bayes (CFWNB), and Class-Specific Attribute Weighted Naïve Bayes (CAWNB), in predicting high run chases in T20I cricket. Model performance was assessed using accuracy, precision, sensitivity, specificity, F1-score, AUC-ROC, and entropy, while Monte Carlo simulations ensured robustness across multiple iterations. Non-parametric statistical tests were employed due to the non-normal distribution of performance metrics, with the Friedman test revealing significant ranking variations among models. The results demonstrate that CAWNB consistently outperforms other models in terms of accuracy, precision, AUC, and F1-score, making it the most reliable choice for high-run chase prediction. Future research should explore hybrid Bayesian deep learning approaches, real-time data adaptation, and the application of these models to other cricket formats and sports analytics to further enhance predictive performance.

Authors

Institutions

Publication Details

Journal
Journal of Sports Sciences
Published
2025-04-07
DOI
https://doi.org/10.1080/02640414.2025.2488157
Primary Topic
Sports Analytics and Performance
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimal selection of a probabilistic machine learning model for predicting high run chase outcomes in T-20 international cricket

Qamruz Zaman, Syed Asghar Ali Shah
Journal of Sports Sciences
Sports Analytics and Performance
article

Optimal selection of a probabilistic machine learning model for predicting high run chase outcomes in T-20 international cricket

Qamruz Zaman, Syed Asghar Ali Shah
article en

Abstract

Predicting high-run chases in cricket is a complex task influenced by various factors, including team rankings, match conditions, pitch behavior, and inning scores. This study evaluates the effectiveness of probabilistic machine learning models, namely Naïve Bayes (NB), Bayesian Network (BN), Bayesian Regularized Neural Network (BRNN), Hidden Naïve Bayes (HNB), Correlation Feature-Based Filter Weighting Naïve Bayes (CFWNB), and Class-Specific Attribute Weighted Naïve Bayes (CAWNB), in predicting high run chases in T20I cricket. Model performance was assessed using accuracy, precision, sensitivity, specificity, F1-score, AUC-ROC, and entropy, while Monte Carlo simulations ensured robustness across multiple iterations. Non-parametric statistical tests were employed due to the non-normal distribution of performance metrics, with the Friedman test revealing significant ranking variations among models. The results demonstrate that CAWNB consistently outperforms other models in terms of accuracy, precision, AUC, and F1-score, making it the most reliable choice for high-run chase prediction. Future research should explore hybrid Bayesian deep learning approaches, real-time data adaptation, and the application of these models to other cricket formats and sports analytics to further enhance predictive performance.

Journal of Sports Sciences
University of Peshawar (PK)
Openalex Percentile: Top 90%
Sports Analytics and Performance
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.