Proceedings of the 2nd International Conference on Research of Educational Administration and Management (ICREAM 2018) 2019
DOI: 10.2991/icream-18.2019.34
|View full text |Cite
|
Sign up to set email alerts
|

Prediction of Teachers' Lateness Factors Coming to School Using C4.5, Random Tree, Random Forest Algorithm

Abstract: Lateness arrives at work can be experienced by anyone, including teachers. Teachers who are late arriving at school have shown examples of bad behavior for students. It takes a study to determine the factors that cause a teacher to arrive late to school. Data Mining is selected to process the data that has been available. Processing uses 3 classification algorithms which are decision tree (C4.5, Random Tree, and Random Forest) algorithms. All three algorithms will be tested for known performance, where the bes… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0
2

Year Published

2020
2020
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(11 citation statements)
references
References 3 publications
0
9
0
2
Order By: Relevance
“…Decision tree algorithms are a family of machine learning classification and regression algorithms that fits a model on a given dataset having considered the entropy of some or all attributes for making its splitting decision. Tree-based machine learning algorithms are widely used and acceptable for various research and industrial areas, even as distant as software defect prediction in the field of software engineering [24] and even for the prediction of factors in educational management [25]. Decision Tree models are known to always produce interpretable models.…”
Section: B Implemented Modelsmentioning
confidence: 99%
See 1 more Smart Citation
“…Decision tree algorithms are a family of machine learning classification and regression algorithms that fits a model on a given dataset having considered the entropy of some or all attributes for making its splitting decision. Tree-based machine learning algorithms are widely used and acceptable for various research and industrial areas, even as distant as software defect prediction in the field of software engineering [24] and even for the prediction of factors in educational management [25]. Decision Tree models are known to always produce interpretable models.…”
Section: B Implemented Modelsmentioning
confidence: 99%
“…Fundamentally, all decision tree algorithm can perform both regression and classification (primarily binary classification) analyses. Decision algorithms usually fit its model through a greedy top-down method which is performed recursively on the dataset to find the most informative variable at each split decision junction [25]. Additionally, it may also include a method for producing a fine-tuned tree by the way of pruning the initial tree based on the error rate thereby removing redundant branches [26].…”
Section: B Implemented Modelsmentioning
confidence: 99%
“…Bentuk kedisiplinan siswa terhadap tata tertib sekolah adalah tepat waktu datang di sekolah. Terlambat dapat diasumsikan sebagai suatu kegiatan yang tidak dapat dilakukan sebelum waktunya atau tepat pada waktunya (Gata et al, 2019). Tindakan ini merupakan bentuk ketidakmampuan seseorang untuk berada pada suatu tempat dan waktu yang telah disepakati sebelumnya.…”
Section: Pendahuluanunclassified
“…For the processing of continuous attributes in C4.5 algorithm, the key step is to find the optimal segmentation threshold of attributes, form discrete intervals and then recursively establish branches [16,17]. Among them, the way to determine the optimal segmentation threshold is to average all the adjacent values of attributes in turn, so as to form a threshold sequence before selection [18]. Although this process does not leave out the best threshold, the selection range of sequences is larger.…”
Section: A C45 Improved Processing Of Continuous Attribute Segmentamentioning
confidence: 99%