CoChat

Increased Prediction Accuracy in the Game of Cricket Using Machine Learning

Open access
Passi, Kalpdrum, Pandey, Niravkumar · 2018 · International Journal of Data Mining & Knowledge Management Process
Cited by 71

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Abstract

Player selection is one the most important tasks for any sport and cricket is no exception.The performance of the players depends on various factors such as the opposition team, the venue, his current form etc. The team management, the coach and the captain select 11 players for each match from a squad of 15 to 20 players.They analyze different characteristics and the statistics of the players to select the best playing 11 for each match.Each batsman contributes by scoring maximum runs possible and each bowler contributes by taking maximum wickets and conceding minimum runs.This paper attempts to predict the performance of players as how many runs will each batsman score and how many wickets will each bowler take for both the teams.Both the problems are targeted as classification problems where number of runs and number of wickets are classified in different ranges.We used naïve bayes, random forest, multiclass SVM and decision tree classifiers to generate the prediction models for both the problems.Random Forest classifier was found to be the most accurate for both the problems.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.5121/ijdkp.2018.8203

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Cited by

Metadata

Authors
Passi, K., & Pandey, N.
Venue
International Journal of Data Mining & Knowledge Management Process
Published
2018-03-30
Volume
8
Issue
2
Pages
19-36
ISSN
  • 2230-9608 (ISSN-L)
  • 2231-007X
OpenAlex
W2795656879
Cited by
71
References
1
FWCI
9.40
Type
journal article
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.