Mining Student Evolution Using Associative Classification and Clustering

Associative classification (AC) is a branch in data mining that utilises association rule discovery methods in classification problems.This paper idea aims to discuss and evaluate a modeling approach for student evolution. It is developed as a component of an adaptive achievement system. At the beginning of the process, associations of student achievement results are found based on each student’s factors that affect learning process, which finds the relationship between student evolution during years of study and understanding the modular scheme, that finds the main effect of enrolling on the correct modules i.e. getting the right advice and student support regarding choosing modules, meeting all the necessary prerequisites, having summer courses, and taking in consideration the student's high school grades, as well as finding the relationship between modules type and student gender . Clustering [10], or unsupervised classification, method is employed to model this task. The goal of clustering is [7] to objectively partition data into homogeneous groups such that the within group object similarity and the between group object dissimilarity are determined. Clustering here is used to model student achievement according to predefined criterion functions that measure similarity among students who grant certain goal having the same conditions using data collected from University Database. A clustering method is developed for this step. We evaluated the student progress according to associations between different factors using data collected. We concluded the performance of those groups using these two approaches. Now, the need for solid information about student evolution and how to improve it has only grown in importance for state policy. The compelling metaphor of increasing flow through the “educational pipeline” is now common in state policy discussions, fueled by more vocal recognition by business and civic leaders of the importance of the critical “supply chain” of educational capital in their states.

[1]  Wynne Hsu,et al.  Mining association rules with multiple minimum supports , 1999, KDD '99.

[2]  Heikki Mannila,et al.  Verkamo: Fast Discovery of Association Rules , 1996, KDD 1996.

[3]  Desire L. Massart,et al.  Improved algorithm for clustering tendency , 2000 .

[4]  Heikki Mannila,et al.  Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.

[5]  Cen Li,et al.  A bayesian approach to temporal data clustering using the hidden markov model methodology , 2000 .

[6]  Rakesh Agarwal,et al.  Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.

[7]  Douglas H. Fisher,et al.  Data mining tasks and methods: Clustering: conceptual clustering , 2002 .

[8]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[9]  Ramez Elmasri,et al.  Fundamentals of Database Systems, 5th Edition , 2006 .

[10]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[11]  Alexander Dekhtyar,et al.  Information Retrieval , 2018, Lecture Notes in Computer Science.

[12]  Ian H. Witten,et al.  Data mining: practical machine learning tools and techniques with Java implementations , 2002, SGMD.

[13]  Jian Pei,et al.  CMAR: accurate and efficient classification based on multiple class-association rules , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[14]  Ramez Elmasri,et al.  Fundamentals of Database Systems , 1989 .

[15]  Wynne Hsu,et al.  Integrating Classification and Association Rule Mining , 1998, KDD.

[16]  Srinivasan Parthasarathy,et al.  New Algorithms for Fast Discovery of Association Rules , 1997, KDD.

[17]  Gregory Piatetsky-Shapiro,et al.  Advances in Knowledge Discovery and Data Mining , 2004, Lecture Notes in Computer Science.

[18]  Peter I. Cowling,et al.  MMAC: a new multi-class, multi-label associative classification approach , 2004, Fourth IEEE International Conference on Data Mining (ICDM'04).