The <i>p</i>-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach (Q3753315)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3990663
Language Label Description Also known as
default for all languages
No label defined
    English
    The <i>p</i>-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach
    scientific article; zbMATH DE number 3990663

      Statements

      The <i>p</i>-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach (English)
      0 references
      1985
      0 references
      p-median problem
      0 references
      cluster analysis
      0 references
      mixture model approach
      0 references
      generalized partition comparison measure
      0 references
      Recently, \textit{J. M. Mulvey} and \textit{H. P. Crowder} [ibid. 25, 329-340 (1979; Zbl 0415.90085)] suggested that the p-median problem might be useful for cluster analysis problems. 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.
      0 references

      Identifiers