Creating student groups with similar characteristics: A heuristic approach
This paper describes an algorithm for classifying elements with binary valued attributes so that the classes are similar. The problem chosen for discussing is that of allocating students to groups within an educational setting. Individual students are described by a set of binary-valued attributes. The objective of the algorithm is to create working groups which are similar to each other in terms of their mix of student attributes. The algorithm uses an information theory measure. The paper also compares the performance of the algorithm to a goal programming formulation of the problem.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 23 (1995)
Issue (Month): 3 (June)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:23:y:1995:i:3:p:313-321. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.