You are here:

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

, Dept. of Information Management, Ming Hsin University of Science and Technology, Taiwan

EdMedia + Innovate Learning, in Honolulu, Hawaii, USA ISBN 978-1-880094-48-8 Publisher: Association for the Advancement of Computing in Education (AACE), Waynesville, NC

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.

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 ED-MEDIA 2003--World Conference on Educational Multimedia, Hypermedia & Telecommunications (pp. 1584-1585). Honolulu, Hawaii, USA: Association for the Advancement of Computing in Education (AACE). Retrieved October 18, 2019 from .

Keywords

References

View References & Citations Map

These references have been extracted automatically and may have some errors. Signed in users can suggest corrections to these mistakes.

Suggest Corrections to References