A FP-Tree Based Algorithm for mining knowledge point association

DOI

10.2991/icimm-16.2016.8How to use a DOI?

Keywords

Knowledge point association, DFP-tree, multiple minimum support, frequent pattern

Abstract

In online educational courses, knowledge point is the basic unit used for the organization and dissemination of information. Mining the association of knowledge points can help to improve the navigation of course learning. However, it is difficult for the existing mining algorithms to balance the performance and accuracy of mining the association of knowledge points. This paper proposes a FP-tree based algorithm used for mining the association of knowledge points. With the multiple minimum support strategy, this algorithm modifies the setting mode of each item's minimum support and improves the construction method of FP-tree to adapt to the dynamic database mining. The experiment shows that the algorithm improved the accuracy of the mining results and ensured a good performance.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Bingtao Hu
AU  - Xiaoming Ju
PY  - 2016/11
DA  - 2016/11
TI  - A FP-Tree Based Algorithm for mining knowledge point association
BT  - Proceedings of the 6th International Conference on Information Engineering for Mechanics and Materials
PB  - Atlantis Press
SP  - 34
EP  - 41
SN  - 2352-5401
UR  - https://doi.org/10.2991/icimm-16.2016.8
DO  - 10.2991/icimm-16.2016.8
ID  - Hu2016/11
ER  -