Show simple item record

dc.contributor.advisorNoor, Jannatun
dc.contributor.authorRahman, Shabab Intishar
dc.contributor.authorFariha, Tasnim Akter
dc.contributor.authorHaque, Muhammad Nayeem Mubasshirul
dc.contributor.authorMohammad, Ammar
dc.contributor.authorAhmed, Shadman
dc.date.accessioned2024-06-26T04:22:28Z
dc.date.available2024-06-26T04:22:28Z
dc.date.copyright©2023
dc.date.issued2023-09
dc.identifier.otherID 18241010
dc.identifier.otherID 23341072
dc.identifier.otherID 19101115
dc.identifier.otherID 19301063
dc.identifier.otherID 20101031
dc.identifier.urihttp://hdl.handle.net/10361/23592
dc.descriptionThis thesis is submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering, 2023.en_US
dc.descriptionCataloged from PDF version of thesis.
dc.descriptionIncludes bibliographical references (pages 37-41).
dc.description.abstractTo uncover underlying patterns in large datasets, a procedure called data mining is often utilized. By analyzing data gathered through Online Learning (OL) systems, data mining can be used to unearth hidden relationships between topics and trends in student performance. Here in this paper, we show how data mining techniques such as clustering and association rule algorithms can be used on historical data to develop a unique recommendation system module. In our implementation, we utilize historical data to generate association rules specifically for student test marks below a threshold of 60%. By focusing on marks below this threshold, we aim to identify and establish associations based on the patterns of weakness observed in the past data. Additionally, we leverage K-means clustering to provide instructors with visual representations of the generated associations. This strategy aids teachers in better comprehending the information and associations produced by the algorithms. K-means clustering helps visualize and organize the data in a way that makes it easier for instructors to analyze and gain insights, enabling them to support the verification of the relationship between topics. This can be a useful tool to deliver better feedback to students as well as provide better insights to instructors when developing their pedagogy. This paper further shows a prototype implementation of the above-mentioned concepts to gain opinions and insights about the usability and viability of the proposed system.en_US
dc.format.extent52 pages
dc.language.isoenen_US
dc.publisherBrac Universityen_US
dc.rightsBrac University theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission.
dc.subjectThresholden_US
dc.subjectWeaknessesen_US
dc.subjectUnsupervised algorithmsen_US
dc.subjectAssociative patternen_US
dc.subjectE-learning sphereen_US
dc.subject.lcshData structures (Computer science)
dc.subject.lcshAlgorithms
dc.titleEducation content provider based on particular weaknesses of students: a unsupervised machine learning approen_US
dc.typeThesisen_US
dc.contributor.departmentDepartment of Computer Science and Engineering, Brac University
dc.description.degreeB.Sc in Computer Science 


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record