Compact integer-programming models for extracting subsets of stimuli from confusion matrices

DOI10.1007/BF02294442zbMath1293.62239MaRDI QIDQ2511847

Michael J. Brusco, Stephanie Stahl

Publication date: 6 August 2014

Published in: Psychometrika (Search for Journal in Brave)

zbMATH Keywords

integer programmingconfusion matrixcombinatorial data analysis

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Applications of statistics to psychology (62P15)

Related Items

Integer programs for one- and two-mode blockmodeling based on prespecified image matrices for structural and regular equivalence, A review of multiobjective programming and its application in quantitative psychology, Continuation methods for approximate large scale object sequencing, Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Stimulus and response generalization: A stochastic model relating generalization to distance in psychological space
• An experimental and theoretical investigation of the constant-ratio rule and other models of visual letter confusion
• QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm
• An interactive multiobjective programming approach to combinatorial data analysis
• Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
• Combinatorial Data Analysis
• SOME HIERARCHICAL SCALING METHODS FOR CONFUSION MATRIX ANALYSIS
• SOME HIERARCHICAL SCALING METHODS FOR CONFUSION MATRIX ANALYSIS II. APPLICATIONS TO LARGE MATRICES
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• SERIATION USING ASYMMETRIC PROXIMITY MEASURES
• QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
• Linear and circular unidimensional scaling for symmetric proximity matrices
• Models for asymmetric proximities
• SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• A Balasian-Based Algorithm for Zero-One Polynomial Programming
• Selecting a stimulus set with prescribed structure from empirical confusion frequencies