The Best Learning Order Inference Based on Blue-Red Trees of Rule-Space Model for Social Network -- Case in ITE Course

• Main Authors: Yung-Hui Chen, Deng, L. Y., Ku-Chen Huang
• Format: Conference Proceeding
• Language: English
• Subjects: Analytical models; Binary trees; Blue-Red tree; Computational modeling; Confidence Level; Educational institutions; Knowledge engineering; Learning Path; Local area networks; Relation Weight; Rule-Space Model; Social network services
• DOI: 10.1109/INCoS.2011.154

Network Learning is becoming increasingly popular today. It is getting important to develop adaptive learning by social network that can be applied in intelligent e-learning systems, and provide learners with efficient learning paths and learning orders for learning objects. Therefore, we use the Rule-Space Model to infer reasonable learning effects of Blue-Red trees and their definitions through analyzing all learning objects of courses within system. We can also define all part learning of sub-binary trees from a course and derive all learning paths from each part learning of sub-binary tree based on the premise that we had inferred nine learning groups of social network grouping algorithms. Most importantly, we can define the Relation Weight of every learning object associated with the other learning objects, and separately calculate the Confidence Level values of between two adjacent learning objects from all learning paths. And finally, we can find the optimal learning orders among all learning paths from a sub-binary tree in the case of ITE course.