Creating student groups with similar characteristics: A heuristic approach

J. Mingers and F. A. O'Brien

Omega, 1995, vol. 23, issue 3, 313-321

Abstract: 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.

Keywords: combinatorial; analysis; education; goal; programming; heuristics; set; partitioning (search for similar items in EconPapers)
Date: 1995
References: View complete reference list from CitEc
Citations: View citations in EconPapers (15)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0305-0483(95)00014-F
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:23:y:1995:i:3:p:313-321

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().