CoChat

USE OF MACHINE LEARNING TECHNIQUES FOR THE FORECAST OF STUDENT ACHIEVEMENT IN HIGHER EDUCATION

Open access
Акмеше, Омер Фарук, Кьор, Хакан, Ербей, Хасан · 2021 · Information Technologies and Learning Tools
Cited by 41

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

Abstract

The machine learning method, which is a sub-branch of artificial intelligence and which makes predictions with mathematical and statistical operations, is used frequently in education as in every field of life. Nowadays, it is seen that millions of data are recorded continuously, and a large amount of data accumulation has occurred. Although data accumulation increases exponentially, the number of analysts and their capabilities to process these data are insufficient. Although we live in the information age, it is more accurate to say that we live in the data age. By using stored and accumulated data, it is becoming increasingly essential to reveal meaningful relationships and trends and to make predictions for the future. It is important to analyze the data obtained from the education process and to evaluate the success of the students and the factors affecting success. These analyses may also contribute to future training activities. In this study, a data set, including socio-demographic variables of students enrolled in distance education at Hitit University, was used. The authors estimated the success of the students with demographic and social variables such as age, gender, city, family income, family education level. The primary purpose is to provide students with information about their estimated academic achievement at the beginning of the process. Thus, at the beginning of the education process, students' success can be increased by informing the students who are predicted to be unsuccessful. Diversification and enhancement of this data may also support other decision-making mechanisms in the training process. Additionally, the factors affecting students’ academic success were researched, and the students' educational outcomes were evaluated. Prediction success was compared using various machine learning algorithms. As a result of the analysis, it was determined that the Random Forest algorithm was more predictive of student achievement than others.

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.33407/itlt.v82i2.4178

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

  • Random Forests

    Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538 · cited 1×

    “In the bagging method, new trees are created by combining the properties in different ways and the most popular class is selected from the trees created [17].”
    Method

Cited by

See all 41

Metadata

Authors
Акмеше, О. Ф., Кьор, Х., & Ербей, Х.
Venue
Information Technologies and Learning Tools
Published
2021-04-25
Volume
82
Issue
2
Pages
297-311
ISSN
2076-8184 (ISSN-L)
OpenAlex
W3157027770
Cited by
41
References
1
FWCI
5.52
Type
journal article
Language
en
Open access
diamond

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.