Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T03:16:03.387Z Has data issue: false hasContentIssue false

The Approximation of Two-Mode Proximity Matrices by Sums of Order-Constrained Matrices

Published online by Cambridge University Press:  01 January 2025

Lawrence Hubert*
Affiliation:
University of Illinois, ChampaignDepartment of Data Theory, University of Leiden
Phipps Arabie
Affiliation:
Faculty of Management, Rutgers University
*
Requests for reprints should be sent to Lawrence Hubert, Department of Psychology, The University of Illinois, 603 East Daniel Street, Champaign, IL 61820.

Abstract

A least-squares strategy is proposed for representing a two-mode proximity matrix as an approximate sum of a small number of matrices that satisfy certain simple order constraints on their entries. The primary class of constraints considered define Q-forms (or anti-Q-forms) for a two-mode matrix, where after suitable and separate row and column reorderings, the entries within each row and within each column are nondecreasing (or nonincreasing) to a maximum (or minimum) and thereafter nonincreasing (or nondecreasing). Several other types of order constraints are also mentioned to show how alternative structures can be considered using the same computational strategy.

Information

Type
Original Paper
Copyright
Copyright © 1995 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