TY - GEN
T1 - Generating Concept Effect Relationship Based On Frequency Of Concept's Co-Occurrence Using Concept-Rank Algorithms
AU - Wahyuningsih, Yulia
AU - Djunaidy, Arif
AU - Siahaan, Daniel
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - Understanding a topic in a course mainly consists of many concepts, which is challenging for students. It is because, usually, those concepts need to be conveyed with information on the relationships between concepts to solve the problem. Students' different limits, backgrounds, and goals have made research regarding concepts become even more challenging. Researchers have applied various learning path personalization strategies employing multiple methods and techniques, including depicting the connections between topic concepts. However, the strategy has several problems to solve, one of which is the main and exciting is the process of generating connections between concepts which is seen as a weighted-directed graph. This research offers a new practical and adaptive method for constructing Concept Effect Relationship (CER), a more specific concept map, by identifying the co-occurrence frequency of concepts hidden in a set of questions. It is proven that it is possible to extract the hidden concept when it appears simultaneously in the question item. It can be used to determine the weight and direction of each concept's node to generate CERs.
AB - Understanding a topic in a course mainly consists of many concepts, which is challenging for students. It is because, usually, those concepts need to be conveyed with information on the relationships between concepts to solve the problem. Students' different limits, backgrounds, and goals have made research regarding concepts become even more challenging. Researchers have applied various learning path personalization strategies employing multiple methods and techniques, including depicting the connections between topic concepts. However, the strategy has several problems to solve, one of which is the main and exciting is the process of generating connections between concepts which is seen as a weighted-directed graph. This research offers a new practical and adaptive method for constructing Concept Effect Relationship (CER), a more specific concept map, by identifying the co-occurrence frequency of concepts hidden in a set of questions. It is proven that it is possible to extract the hidden concept when it appears simultaneously in the question item. It can be used to determine the weight and direction of each concept's node to generate CERs.
KW - concept's co-occurrence
KW - concept-effect relationship
KW - concept-rank
KW - learning path
UR - http://www.scopus.com/inward/record.url?scp=85186489640&partnerID=8YFLogxK
U2 - 10.1109/ICITDA60835.2023.10427276
DO - 10.1109/ICITDA60835.2023.10427276
M3 - Conference contribution
AN - SCOPUS:85186489640
T3 - ICITDA 2023 - Proceedings of the 2023 8th International Conference on Information Technology and Digital Applications
BT - ICITDA 2023 - Proceedings of the 2023 8th International Conference on Information Technology and Digital Applications
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 8th International Conference on Information Technology and Digital Applications, ICITDA 2023
Y2 - 17 November 2023 through 18 November 2023
ER -