The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach

T. D. Klastorin
Additional contact information
T. D. Klastorin: Graduate School of Business, University of Washington, Seattle, Washington 98195

Management Science, 1985, vol. 31, issue 1, 84-95

Abstract: Recently, Mulvey and Crowder (Mulvey, J., H. Crowder. 1979. Cluster analysis: an application of Lagrangian relaxation. Management Sci. 25 329--340.) suggested that the p-median problem might be useful for cluster analysis problems (where the goal is to group objects described by a vector of characteristics in such a way that objects in the same group are somehow more alike than objects in different groups). The intent of this paper is to test Mulvey and Crowder's proposal using the mixture model approach; i.e., by applying a number of algorithms (including one for the p-median problem) to a set of objects randomly sampled from a number of known multivariate populations and comparing the ability of each algorithm to detect the original populations. In order to evaluate the results, a generalized partition comparison measure and its distribution are developed. Using this measure, results from various algorithms are compared.

Keywords: statistics: cluster analysis; programming: integer; applications; facilities/equipment planning: location (search for similar items in EconPapers)
Date: 1985
References: Add references at CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.31.1.84 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:31:y:1985:i:1:p:84-95

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().