首页> 外文会议>International Conference on Materials Science and Information Technology >A Clustering Algorithm of E-learningers Based on Rough Set
【24h】

A Clustering Algorithm of E-learningers Based on Rough Set

机译:基于粗糙集的电子学习仪聚类算法

获取原文

摘要

The demand for individualized teaching from E-learning websites is rapidly increasing due to the huge differences existed among E-learning learners. A method for clustering E-learningers based on rough set is proposed. The basic idea of the method is to reduce the learning attributes prior to clustering, and therefore the clustering of E-learningers is carried out in a relative low-dimensional space. Using this method, the E-learning websites can arrange corresponding teaching content for different clusters of learners so that the learners' individual requirements can be more satisfied.
机译:由于电子学习学习者中存在巨大差异,对电子学习网站的个性化教学的需求正在迅速增加。提出了一种基于粗糙集的聚类电子学习仪的方法。该方法的基本思想是在聚类之前减少学习属性,因此在相对低维空间中执行电子学习仪的聚类。使用这种方法,电子学习网站可以为不同的学习集群安排相应的教学内容,以便更满意学习者的个人要求。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号