Cluster Analysis and Mathematical Programming
作者:
M.R. Rao,
期刊:
Journal of the American Statistical Association
(Taylor Available online 1971)
卷期:
Volume 66,
issue 335
页码: 622-626
ISSN:0162-1459
年代: 1971
DOI:10.1080/01621459.1971.10482319
出版商: Taylor & Francis Group
数据来源: Taylor
摘要:
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.
点击下载:
PDF (570KB)
返 回