Earticle

초록

영어

The formation of the collaborative learning group is a challenging problem, especially the principle construction and multi-objective optimization. In this paper, we propose an improved density clustering algorithm, and further implement the group formation based on the proposed algorithm. The proposed algorithm first constructs the distance matrix for learners, and clusters learners into different groups. After the random selection of the initial cluster centers, our algorithm achieves superior clustering result by iteratively adjusting the clustering centers. We conduct sufficient experiments and the experimental results demonstrate that the proposed algorithm well satisfies our aim, that is, inter-group heterogeneity maximization and intra-group homogeneity maximization.

목차

Abstract
 1. Introduction
 2. Problem Description and Definition
  2.1 Problem Description
  2.2 Definition
 3. The Proposed Algorithm
  3.1 Pre-processing
  3.2 Clustering Analysis
  3.3 Group Formation
 4. Experiment and Evaluation
 5. Conclusion and Future Work
 Acknowledgments
 References

키워드

저자

• Mengxiong Zhou [ School of Information Engineering, Hangzhou Dianzi University, Hangzhou 310018,P.R.China ]
• Yanming Ye [ School of Information Engineering, Hangzhou Dianzi University, Hangzhou 310018,P.R.China, School of Computer Science and Technology,Zhejiang University, Hangzhou 310018, P.R.China, School of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou 310018, P.R.China ] Corresponding author
• Yizhi Ren [ School of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou 310018, P.R.China ]
• Yueshen Xu [ School of Computer Science and Technology,Zhejiang University, Hangzhou 310018, P.R.China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Grid and Distributed Computing

• 간기

  격월간

• pISSN

  2005-4262

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605