Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-15T09:17:06.551Z Has data issue: false hasContentIssue false

Merging Groups to Maximize Object Partition Comparison

Published online by Cambridge University Press:  01 January 2025

T. D. Klastorin*
Affiliation:
University of Washington
*
Requests for reprints should be sent to T. D. Klastorin, 126 Mackenzie Hall DJ-10, University of Washington, Seattle, WA 98195.

Abstract

The problem of objectively comparing two independently determined partitions of N objects or variables is discussed. A similarity measure based on the simple matching coefficient is defined and related to previously suggested measures. The problem of merging groups in one partition to maximize this similarity measure is discussed and formulated as a mathematical programming problem; such an approach is useful for determining to what extent the groups in one partition merely represent a finer subdivision of the groups in the other partition. By exploiting the structure of the similarity measure, an efficient algorithm is developed to determine which groups (if any) should be merged to maximize partition similarity.

Information

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