An Alternative Method for Hospital Partition Determination Using Hierarchical Cluster Analysis

The classification of short-term hospitals into homogeneous groups has become an integral part of many systems designed to abate continuing cost inflation in the hospital industry. This paper describes one approach which was developed to identify homogeneous groups of short-term hospitals. The approach, based on hierarchical cluster analysis, defines an objective measure (called expected distinctiveness) to evaluate any group of hospitals identified by a hierarchical grouping structure or dendrogram. Using this measure, an efficient algorithm is developed which finds the hospital partition from the identified groups which maximizes total expected distinctiveness. A numerical example illustrates the application and extensions.

[1]  Joe H. Ward,et al.  Application of an Hierarchical Grouping Procedure to a Problem of Grouping Profiles , 1963 .

[2]  R. Mojena,et al.  Hierarchical Grouping Methods and Stopping Rules: An Evaluation , 1977, Comput. J..

[3]  S. Arnold.  A Test for Clusters , 1979 .

[4]  L. A. Goodman,et al.  Measures of Association for Cross Classifications. II: Further Discussion and References , 1959 .

[5]  L. Hubert.  Monotone invariant clustering procedures , 1973 .

[6]  D. N. Sparks.  Euclidean Cluster Analysis , 1973 .

[7]  J. Overall,et al.  Applied multivariate analysis , 1983 .

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  P. Hogeweg,et al.  Iterative character weighing in numerical taxonomy. , 1976, Computers in biology and medicine.

[10]  Philip H. Birnbaum,et al.  Assessment of Alternative Management Forms in Academic Interdisciplinary Research Projects , 1977 .

[11]  J. H. Ward.  Hierarchical Grouping to Optimize an Objective Function , 1963 .

[12]  R. M. Cormack,et al.  A Review of Classification , 1971 .

[13]  L. Hubert.  Some extensions of Johnson's hierarchical clustering algorithms , 1972 .

[14]  Martin Grötschel,et al.  Weakly bipartite graphs and the Max-cut problem , 1981, Oper. Res. Lett..

[15]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[16]  B. B. Murphy,et al.  Entropy in the hierarchical cluster analysis of hospitals. , 1978, Health services research.

[17]  A. Tversky,et al.  Additive similarity trees , 1977 .

[18]  T. Klastorin,et al.  The determination of alternative hospital classifications. , 1981, Health services research.

[19]  Donald E. Knuth,et al.  The art of computer programming: V.1.: Fundamental algorithms , 1997 .

[20]  L. Zurich,et al.  Operations Research in Production Planning, Scheduling, and Inventory Control , 1974 .

[21]  F. Hadlock,et al.  Finding a Maximum Cut of a Planar Graph in Polynomial Time , 1975, SIAM J. Comput..

[22]  L. A. Goodman,et al.  Measures of association for cross classifications , 1979 .

[23]  H. P. Friedman,et al.  On Some Invariant Criteria for Grouping Data , 1967 .

[24]  Michael R. Anderberg,et al.  Cluster Analysis for Applications , 1973 .

[25]  R. F. Ling,et al.  Probability Tables for Cluster Analysis Based on a Theory of Random Graphs , 1976 .

[26]  Vijay Mahajan,et al.  An Approach to Normative Segmentation , 1978 .

[27]  Brian Everitt,et al.  Cluster analysis , 1974 .

[28]  R. E. Marsten.  An Algorithm for Large Set Partitioning Problems , 1974 .