Abstract

Acceptance of new students is the most important part of STIKOM UYELINDO Kupang as one of the benchmarks for the progress of the campus in the future. In the process of admitting new students (PMB), prospective new students must go through several stages of registration until the stage of filling out the KRS, so that the students concerned are legitimately declared as active students of STIKOM UYELINDO KUPANG. However, many cases occur that not all students arrive at the final stage of filling in the KRS to be declared as active students. Problems that occur result in the division responsible for new students difficult to predict that prospective students concerned in the process of admitting new students, will go through the process until the status of filling KRS or not, and also affect the prediction of the number of new student achievement. This study aims to find out and recognize the pattern of classification of new student registration status so that the level of presentation of new students entering the STIKOM UYELINDO KUPANG can be made by applying the rough set algorithm. In the process of applying Rough Set, it will produce a rule as a rule or pattern for classification of new student registration status data. The data used in this study is the data of new student registration in 2016-2018 with a total record of 579 records. The results of this study are expected to be an important input for the responsibility of new students and high school education institutions, in the strategy of screening new students to achieve the target of better new student admissions.

Highlights

  • Acceptance of new students is the most important part of STIKOM UYELINDO Kupang as one of the benchmarks for the progress of the campus in the future

  • This study aims to find out and recognize the pattern of classification of new student registration status so that the level of presentation of new students entering the STIKOM UYELINDO KUPANG can be made by applying the rough set algorithm

  • Implementasi Algoritma Rough Set Untuk Deteksi dan Penangan Dini Penyakit Sapi

Read more

Summary

Rough Set dikembangkan oleh Zdizslaw

Pawlak (Akseptor and Vasektomi, 2014). Rough Set merupakan perluasan dari teori set untuk studi sistem cerdas yang ditandai dengan infomasi eksak, pasti, atau samasamar (Mi, Wu and Zhang, 2004). Dalam aplikasi Artificial Intellegenci (AI), Rough Set digunakan untuk menangani masalah Uncertainty Data Imprecision dan Vagueness). Pendekatan roughset menjadi pendekatan yang peting dalam AI dan ilmu kognitif, terurama pada area mechine learning, akuisisi pengetahuan, analisis keputusan, pencarian pengetahuan dari database, sistem pakar, penalaran induktif, dan pengenalan pola (Listiana, Anggraeni and Mukhlason, 2010). Salah satu kelebihan dari roughset adalah proses rough set dapat melakukan penanganan data yang inkonsistensi sepeti yang ditampilkan pada tabel 2.1 (Gogoi, Bhattacharyya and Kalita, 2013)

Information System
Indiscernibility Relation
Dependensi Atribut
Reduksi Atribut
Decision Rule
Qualitative Measure
Metode Perancangan Sistem
HASIL ANALISA DAN PERANCANGAN

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.