Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-14T21:05:49.427Z Has data issue: false hasContentIssue false

Indclus: An Individual differences Generalization of the Adclus Model and the Mapclus Algorithm

Published online by Cambridge University Press:  01 January 2025

J. Douglas Carroll*
Affiliation:
Bell Laboratories
Phipps Arabie
Affiliation:
Bell LaboratoriesUniversity of Illinois at Champaign
*
Authors' addresses: J. Douglas Carroll, Room 2C-553, Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ 07974; Phipps Arabie, Department of Psychology, University of Illinois, 603 East Daniel Street, Champaign, IL 61820.

Abstract

We present a new model and associated algorithm, INDCLUS, that generalizes the Shepard-Arabie ADCLUS (ADditive CLUStering) model and the MAPCLUS algorithm, so as to represent in a clustering solution individual differences among subjects or other sources of data. Like MAPCLUS, the INDCLUS generalization utilizes an alternating least squares method combined with a mathematical programming optimization procedure based on a penalty function approach to impose discrete (0,1) constraints on parameters defining cluster membership. All subjects in an INDCLUS analysis are assumed to have a common set of clusters, which are differentially weighted by subjects in order to portray individual differences. As such, INDCLUS provides a (discrete) clustering counterpart to the Carroll-Chang INDSCAL model for (continuous) spatial representations. Finally, we consider possible generalizations of the INDCLUS model and algorithm.

Information

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