Hostname: page-component-6898cfcb55-th4rj Total loading time: 0 Render date: 2026-11-11T14:27:27.814Z Has data issue: false hasContentIssue false

Compact Integer-Programming Models for Extracting Subsets of Stimuli from Confusion Matrices

Published online by Cambridge University Press:  01 January 2025

Michael J. Brusco*
Affiliation:
Marketing Department, Florida State University
Stephanie Stahl
Affiliation:
Tallahassee, Florida
*
Requests for reprints should be sent to Michael J. Brusco, Marketing Department, College of Business, Florida State University, Tallahassee, FL 32306-1110. E-Mail: mbrusco@cob.fsu.edu

Abstract

This paper presents an integer linear programming formulation for the problem of extracting a subset of stimuli from a confusion matrix. The objective is to select stimuli such that total confusion among the stimuli is minimized for a particular subset size. This formulation provides a drastic reduction in the number of variables and constraints relative to a previously proposed formulation for the same problem. An extension of the formulation is provided for a biobjective problem that considers both confusion and recognition in the objective function. Demonstrations using an empirical interletter confusion matrix from the psychological literature revealed that a commercial branch-and-bound integer programming code was always able to identify optimal solutions for both the single-objective and biobjective formulations within a matter of seconds. A further extension and demonstration of the model is provided for the extraction of multiple subsets of stimuli, wherein the objectives are to maximize similarity within subsets and minimize similarity between subsets.

Information

Type
Articles
Copyright
Copyright © 2001 The Psychometric Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable