Association Rules Mining Method of Big Data for E-Learning Recommendation Engine

Author(s):  
Karim Dahdouh ◽  
Ahmed Dakkak ◽  
Lahcen Oughdir ◽  
Abdelali Ibriz
2012 ◽  
Vol 3 (2) ◽  
pp. 24-41 ◽  
Author(s):  
Tutut Herawan ◽  
Prima Vitasari ◽  
Zailani Abdullah

One of the most popular techniques used in data mining applications is association rules mining. The purpose of this study is to apply an enhanced association rules mining method, called SLP-Growth (Significant Least Pattern Growth) for capturing interesting rules from students suffering mathematics and examination anxieties datasets. The datasets were taken from a survey exploring study anxieties among engineering students in Universiti Malaysia Pahang (UMP). The results of this research provide useful information for educators to make decisions on their students more accurately and adapt their teaching strategies accordingly. It also can assist students in handling their fear of mathematics and examination and increase the quality of learning.


2018 ◽  
pp. 25-32 ◽  
Author(s):  
Nataliya Shakhovska ◽  
Roman Kaminskyy ◽  
Eugen Zasoba ◽  
Mykola Tsiutsiura

The paper proposes a method for Big data analyzing in the presence of different data sources and different methods of processing these data. The Big data definition is given, the main problems of data mining process are described. The concept of association rules is introduced and the method of association rules searching for working with Big Data is modified. The method of finding dependencies is developed, efficiency and possibility of its parallelization are determined. The developed algorithm makes it possible to assert that the task of detecting association dependencies in distributed databases belongs to the class of P-tasks. The algorithm for finding association dependencies is well-solved with MapReduce. The low asymptotic complexity of the developed association rules mining algorithm and a wide set of data types supported for analysis allow to apply the proposed algorithm in practically all subject areas working with association dependencies in the data domain.


Author(s):  
Hairong Wang ◽  
Pan Huang ◽  
Xu Chen

As to the problems of low data mining efficiency, less dimensionality, and low accuracy of traditional multidimensional association rules in the university big data environment, an OLAP-based multi-dimensional association rule mining method is proposed, which combines hash function and marked transaction compression technology to solve the problem of excessive or redundant candidate sets in the Apriori algorithm, and uses On Line Analytical Processing to manage the intermediate data in the association mining process , in order to reduce the time overhead caused by repeated calculations. To verify the validity of the proposed method, a learning situation analysis system is constructed in the field of colleges and universities. The multi-dimensional association rules mining method is used to analyze more than 21,000 desensitized real data, in order to mine the key factors affecting students' academic performance. The experimental results show that the proposed multi-dimensional mining model has good mining results and significantly improves the time performance.


Sign in / Sign up

Export Citation Format

Share Document