Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Proceeding of the Electrical Engineering Computer Science and Informatics

Building Student’s Study Path using Markov Chain Process with Apriori Cross Join Pearson Correlation Tekad Matulatan; Martaleli Bettiza
Proceeding of the Electrical Engineering Computer Science and Informatics Vol 2: EECSI 2015
Publisher : IAES Indonesia Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (991.889 KB) | DOI: 10.11591/eecsi.v2.787

Abstract

Student’s study path could be advised by using bestpossible path from Markov Chain rule based on student’sacademic performance records with several assumption on thecurrent curriculum. Finding the Markov’s rule is crucial processbecause it will determine study path’s scenarios which rely onstudent current performance to choose the next best possiblepath. The rule would be built using the whole student’s academicperformance on the same curriculum by implementing AprioriCross Join Pearson Correlation Test on two consecutivesemesters. It will then create path consist of paired courses A->B with Pearson value that would be implemented as rule in Markov Process
Deep Learning on Curriculum Study Pattern by Selective Cross Join in Advising Students’ Study Path Tekad Matulatan; Muhammad Resha
Proceeding of the Electrical Engineering Computer Science and Informatics Vol 4: EECSI 2017
Publisher : IAES Indonesia Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (407.495 KB) | DOI: 10.11591/eecsi.v4.1050

Abstract

Advising engineering students in their study path need to understand the curriculum structure, student capabilities and challenge that commonly appear in courses. This paper offered the simple method to help student advisor in analyzing student performance in their study path based on academic progress record of the student it-self and pattern that been built from other students that have taken the courses. Using selective cross join for each  possible permutation of pair courses with respect to courses’ grade to create knowledge base. This knowledge base will be used to construct complex tree of any possible study path that might be taken by student to reach the end of study including course that must be retaken. Finding the best suggestion for study path using Monte Carlo tree search style