IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/9648534.html
   My bibliography  Save this article

Difficulty-Based Knowledge Point Clustering Algorithm Using Students’ Multi-Interactive Behaviors in Online Learning

Author

Listed:
  • Zhaoyu Shou
  • Jun-Li Lai
  • Hui Wen
  • Jing-Hua Liu
  • Huibing Zhang
  • Xingling Shao

Abstract

To improve learners’ performance in online learning, a teacher needs to understand the difficulty of knowledge points learners of different cognitive encounter levels in the learning process. This paper proposes a difficulty-based knowledge point clustering algorithm based on collaborative analysis of multi-interactive behaviors. Firstly, combining the group-directed learning path network, forgetting factors and the degree of student-system interaction, we propose a measurement model to calculate the similarity of the difficulty between knowledge points on student-system interactive behavior. Secondly, to solve the data sparsity problem of interaction, we propose an improved similarity model to calculate the similarity of the difficulty between knowledge points on student-teacher and student-student interactive behavior. Finally, the knowledge point difficulty similarity matrix is obtained by integrating the difficulty similarity of knowledge points obtained from student-system interactive behavior, student-teacher interactive behavior, and student-student interactive behavior. The spectral clustering algorithm is used to achieve knowledge point difficulty classification based on the obtained similarity matrix. The experiments on real datasets show that the proposed method has better knowledge point difficulty classification results than the existing methods.

Suggested Citation

  • Zhaoyu Shou & Jun-Li Lai & Hui Wen & Jing-Hua Liu & Huibing Zhang & Xingling Shao, 2022. "Difficulty-Based Knowledge Point Clustering Algorithm Using Students’ Multi-Interactive Behaviors in Online Learning," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-16, November.
  • Handle: RePEc:hin:jnlmpe:9648534
    DOI: 10.1155/2022/9648534
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2022/9648534.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2022/9648534.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/9648534?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:9648534. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.