Creating student groups with similar characteristics: A heuristic approach

Mingers, J. and O'Brien, F.A. (1995) Creating student groups with similar characteristics: A heuristic approach. Omega - International Journal of Management Science, 23 (3). pp. 313-321. ISSN 0305-0483 . (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)
Official URL
http://dx.doi.org/10.1016/0305-0483(95)00014-F

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

Item Type: Article
Uncontrolled keywords: Combinatorial Analysis; Education; Goal programming; Heuristics; Set Partitioning
Subjects: H Social Sciences > HA Statistics > HA33 Management Science
Divisions: Faculties > Social Sciences > Kent Business School
Depositing User: John Mingers
Date Deposited: 09 Sep 2009 15:41
Last Modified: 14 Jan 2010 14:13
Resource URI: http://kar.kent.ac.uk/id/eprint/3888 (The current URI for this page, for reference purposes)
  • Depositors only (login required):