Research on association rules of course grades based on parallel FP-Growth algorithm

被引:3
|
作者
Wang, Xinyan [1 ]
Jiao, Guie [2 ,3 ]
机构
[1] Shanghai Ocean Univ, Coll Informat, Shanghai, Peoples R China
[2] Shanghai Univ, Sch Comp Engn & Sci, Shanghai, Peoples R China
[3] Shanghai JianQiao Univ, Coll Informat Technol, Shanghai, Peoples R China
关键词
Association rules; Hadoop; MapReduce; parallel FP-Growth algorithm; TREE;
D O I
10.3233/JCM-194079
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
With the rapid growth of massive data in all walks of life, massive data faces enormous challenges such as storage capacity and computing power. In Chinese universities, traditional data analysis of student course cannot meet the growing demand for increasing data size and real-time computation of big data. In this paper, a parallel FP-Growth algorithm based on split is proposed. The established FP-Tree is split into blocks, and the split FP-Trees are equally divided into different nodes. The monitoring point is set up to monitor the operation of other nodes, dynamically migrate tasks and maintain load balancing. The experiment proves that each node has good load balancing with the given support degree, and the improved algorithm has better running performance than the classic FP-Growth algorithm in parallel processing. Finally, the parallel FP-Growth algorithm based on split is implemented on Hadoop to mine association rules between course grades. The mining process includes data preprocessing, mining results and analysis. The association rules between course grades provide suggestions for the way students learn and the way teachers teach.
引用
收藏
页码:759 / 769
页数:11
相关论文
共 50 条
  • [1] Research on Association Rules Parallel Algorithm Based on FP-Growth
    Chen, Ke
    Zhang, Lijun
    Li, Sansi
    Ke, Wende
    [J]. INFORMATION COMPUTING AND APPLICATIONS, PT II, 2011, 244 : 249 - +
  • [2] Research of Improved FP-Growth Algorithm in Association Rules Mining
    Zeng, Yi
    Yin, Shiqun
    Liu, Jiangyue
    Zhang, Miao
    [J]. SCIENTIFIC PROGRAMMING, 2015, 2015
  • [3] An optimized FP-growth algorithm for discovery of association rules
    Shawkat, Mai
    Badawi, Mahmoud
    El-ghamrawy, Sally
    Arnous, Reham
    El-desoky, Ali
    [J]. JOURNAL OF SUPERCOMPUTING, 2022, 78 (04): : 5479 - 5506
  • [4] Discovery of Incremental Association Rules Based on a New FP-Growth Algorithm
    Kreesuradej, Worapoj
    Thurachon, Wannasiri
    [J]. 2019 IEEE 4TH INTERNATIONAL CONFERENCE ON COMPUTER AND COMMUNICATION SYSTEMS (ICCCS 2019), 2019, : 184 - 188
  • [5] An optimized FP-growth algorithm for discovery of association rules
    Mai Shawkat
    Mahmoud Badawi
    Sally El-ghamrawy
    Reham Arnous
    Ali El-desoky
    [J]. The Journal of Supercomputing, 2022, 78 : 5479 - 5506
  • [6] A Parallel FP-growth Algorithm Based on GPU
    Jiang, Hao
    Meng, He
    [J]. 2017 IEEE 14TH INTERNATIONAL CONFERENCE ON E-BUSINESS ENGINEERING (ICEBE 2017), 2017, : 97 - 102
  • [7] Research on Association Rule Algorithm Based on Distributed and Weighted FP-Growth
    Wang, Huaibin
    Liu, Yuanchao
    Wang, Chundong
    [J]. ADVANCES IN MULTIMEDIA, SOFTWARE ENGINEERING AND COMPUTING, VOL 1, 2011, 128 : 133 - 138
  • [8] A Power Load Association Rules Mining Method Based on Improved FP-Growth Algorithm
    Wang, Ze-Zhong
    Cao, Shuo
    [J]. 2018 CHINA INTERNATIONAL CONFERENCE ON ELECTRICITY DISTRIBUTION (CICED), 2018, : 2833 - 2837
  • [9] Quantum FP-Growth for Association Rules Mining
    Belkadi, Widad Hassina
    Drias, Yassine
    Drias, Habiba
    [J]. QUANTUM COMPUTING: APPLICATIONS AND CHALLENGES, QSAC 2023, 2024, 2 : 91 - 106
  • [10] Using Fuzzy FP-Growth for Mining Association Rules
    Wang, Chien-Hua
    Zheng, Li
    Yu, Xuelian
    Zheng, XiDuan
    [J]. PROCEEDINGS OF THE 2017 INTERNATIONAL CONFERENCE ON ORGANIZATIONAL INNOVATION (ICOI 2017), 2017, 131 : 328 - 332