论文信息 - Cluster Analysis and Mathematical Programming

Cluster Analysis and Mathematical Programming

Abstract Cluster analysis involves the problem of optimal partitioning of a given set of entities into a pre-assigned number of mutually exclusive and exhaustive clusters. Here the problem is formulated in two different ways with the distance function (a) of minimizing the within groups sums of squares and (b) minimizing the maximum distance within groups. These lead to different kinds of linear and non-linear (0–1) integer programming problems. Computational difficulties are discussed and efficient algorithms are provided for some special cases.

M. Rao

[1] Walter D. Fisher. On Grouping for Maximum Homogeneity , 1958 .

[2] Abraham Charnes,et al. Management Models and Industrial Applications of Linear Programming , 1961 .

[3] Stuart E. Dreyfus,et al. Applied Dynamic Programming , 1965 .

[4] R. Sokal,et al. Principles of numerical taxonomy , 1965 .

[5] F. Glover. AN ALL-INTEGER INTEGER PROGRAMMING ALGORITHM , 1963 .

[6] E. Balas. An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .

[7] A W EDWARDS,et al. A METHOD FOR CLUSTER ANALYSIS. , 1965, Biometrics.

[8] P. R. Sanday,et al. ON THE NUMERICAL CLASSIFICATION OF NOMINAL DATA. , 1968 .

[9] Peter L. Hammer,et al. Boolean Methods in Operations Research and Related Areas , 1968 .

[10] Giandomenico Majone. CLASSIFICATION AND DISCRIMINATION IN THE ANALYSIS OF CREDIT RISKS: II. , 1968 .

[11] A DESCRIPTION AND SOME SUGGESTED EXTENSIONS FOR METHODS OF CLUSTER ANALYSIS. , 1968 .

[12] George L. Nemhauser,et al. The Set-Partitioning Problem: Set Covering with Equality Constraints , 1969, Oper. Res..

[13] Hrishikesh D. Vinod Mathematica. Integer Programming and the Theory of Grouping , 1969 .

[14] Robert E. Jensen,et al. A Dynamic Programming Algorithm for Cluster Analysis , 1969, Oper. Res..

[15] Giandomenico Majone. Distance-based cluster analysis and measurement scales , 1970 .