Combining diversity and dispersion criteria for anticlustering: A bicriterion approach

被引:10
作者
Brusco, Michael J. [1 ]
Cradit, J. Dennis [1 ]
Steinley, Douglas [2 ]
机构
[1] Florida State Univ, Tallahassee, FL 32306 USA
[2] Univ Missouri, Columbia, MO USA
关键词
anticlustering; maximum diversity; maximum dispersion; partitioning; bicriterion optimization; iterated local search; parallel test forms; ASSIGNING STUDENTS; AUTOMATED TEST; ALGORITHM; OPTIMIZATION; ALLOCATION; SELECTION; DESIGN; MODELS; SET;
D O I
10.1111/bmsp.12186
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Most partitioning methods used in psychological research seek to produce homogeneous groups (i.e., groups with low intra-group dissimilarity). However, there are also applications where the goal is to provide heterogeneous groups (i.e., groups with high intra-group dissimilarity). Examples of these anticlustering contexts include construction of stimulus sets, formation of student groups, assignment of employees to project work teams, and assembly of test forms from a bank of items. Unfortunately, most commercial software packages are not equipped to accommodate the objective criteria and constraints that commonly arise for anticlustering problems. Two important objective criteria for anticlustering based on information in a dissimilarity matrix are: a diversity measure based on within-cluster sums of dissimilarities; and a dispersion measure based on the within-cluster minimum dissimilarities. In many instances, it is possible to find a partition that provides a large improvement in one of these two criteria with little (or no) sacrifice in the other criterion. For this reason, it is of significant value to explore the trade-offs that arise between these two criteria. Accordingly, the key contribution of this paper is the formulation of a bicriterion optimization problem for anticlustering based on the diversity and dispersion criteria, along with heuristics to approximate the Pareto efficient set of partitions. A motivating example and computational study are provided within the framework of test assembly.
引用
收藏
页码:375 / 396
页数:22
相关论文
共 62 条
[1]  
[Anonymous], 2005, BRANCH BOUND APPL CO
[2]  
ARABIE P, 1992, ANNU REV PSYCHOL, V43, P169
[3]   AN AUTOMATED TEST DEVELOPMENT OF PARALLEL TESTS FROM A SEED TEST [J].
ARMSTRONG, RD ;
JONES, DH ;
WU, IL .
PSYCHOMETRIKA, 1992, 57 (02) :271-288
[4]   Methods for assigning students to groups: a study of alternative objective functions [J].
Baker, KR ;
Powell, SG .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2002, 53 (04) :397-404
[5]   Uniform test assembly [J].
Belov, Dmitry I. .
PSYCHOMETRIKA, 2008, 73 (01) :21-38
[6]   Maximizing workforce diversity in project teams: a network flow approach [J].
Bhadury, J ;
Mighty, EJ ;
Damar, H .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2000, 28 (02) :143-153
[7]  
Brusco M, 2013, PSYCHOMETRIKA, V78, P498, DOI [10.1007/S11336-012-9313-1, 10.1007/s11336-012-9313-1]
[8]   Clustering, seriation, and subset extraction of confusion data [J].
Brusco, Michael J. ;
Steinley, Douglas .
PSYCHOLOGICAL METHODS, 2006, 11 (03) :271-286
[9]   Partitioning methods for pruning the Pareto set with application to multiobjective allocation of a cross-trained workforce [J].
Brusco, Michael J. .
COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 111 :29-38
[10]   Gaussian model-based partitioning using iterated local search [J].
Brusco, Michael J. ;
Shireman, Emilie ;
Steinley, Douglas ;
Brudvig, Susan ;
Cradit, J. Dennis .
BRITISH JOURNAL OF MATHEMATICAL & STATISTICAL PSYCHOLOGY, 2017, 70 (01) :1-24