z-logo
open-access-imgOpen Access
SISTEM PENUNJANG KEPUTUSAN PEMILIHAN BEASISWA DENGAN METODE DECISION TRE ID3 PADA SMAN 2 CIBINONG KABUPATEN BOGOR
Author(s) -
Linda Sukmawati
Publication year - 2019
Publication title -
jif: jurnal imiah informatika/jurnal ilmiah informatika
Language(s) - English
Resource type - Journals
eISSN - 2615-1049
pISSN - 2337-8379
DOI - 10.33884/jif.v7i01.932
Subject(s) - scholarship , decision tree , id3 , selection (genetic algorithm) , set (abstract data type) , computer science , id3 algorithm , tree (set theory) , test (biology) , operations research , psychology , mathematics education , decision tree learning , political science , mathematics , data mining , artificial intelligence , incremental decision tree , programming language , mathematical analysis , paleontology , biology , law
The selection of scholarships must be in accordance with established rules. The criteria set out in this case study are academic values, parents' income, number of siblings, number of dependents of parents, active organizations and others. Therefore not all who register as candidates for the scholarship will be accepted, only those who meet the criteria will get the scholarship. Because of the large number of participants who apply for scholarships, it is necessary to build a decision support system that will help determine who is entitled to get the scholarship. Therefore, this study seeks to provide a solution for the selection of students who deserve a scholarship in accordance with the criteria that have been determined by each to produce more accurate and faster data. Decision Tree ID3 method as a comparative test analysis model, as well as policy analysis is used to support appropriate decision making for the school board. ID3 Decision Tree is suitable for use in this case because it can make data classification accuracy and tree generated results are very easy to read by humans.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here