To provide baseline algorithm for team forming: K team-forming algorithm

New Search

Print Abstract

E-mail Abstract

Full Text

Save to My Collections

Export Citation

Liu, E.Z.F. (2003). To provide baseline algorithm for team forming: K team-forming algorithm. In D. Lassner & C. McNaught (Eds.), Proceedings of World Conference on Educational Multimedia, Hypermedia and Telecommunications 2003 (pp. 1584-1585). Chesapeake, VA: AACE.
Retrieved from http://www.editlib.org/p/11144.

• Share:
• 
• 
• 
• 
• 
• 

Conference Information

World Conference on Educational Multimedia, Hypermedia and Telecommunications (EDMEDIA) 2003
Honolulu, Hawaii, USA
2003
ISBN 1-880094-48-7
  David Lassner & Carmel McNaught
AACE

More Information on EDMEDIA
Table of Contents

Author

Eric Zhi-Feng Liu, Dept. of Information Management, Ming Hsin University of Science and Technology, Taiwan

Abstract

In recent studies, some researchers were eager for the answer of how to group a perfectly dream team. There are various grouping methods, e.g. random assignment, homogeneous grouping with personality or achievement and heterogeneous grouping with personality or achievement [2], were proposed.The random assignment by instructor or manager could not be reproduced, some instructors would put some students in a team perfectly via their experiences, and some algorithms would match students perfectly but in chance teams assigned by instructor also good enough. This phenomenon would stay continuance until a baseline algorithm is to be proposed as a base of comparison. I want to propose an easy and non-perfect team-forming algorithm that could be used by other researchers to compare with.

Keywords

• Achievement
• Personality
• Students
• Information Sciences

Also Read

• A REVIEW OF WEB-BASED LEARNING SYSTEMS FOR PROGRAMMING

Tags