摘要 : Although the K-means algorithm for minimizing the within-cluster sums of squared deviations from cluster centroids is perhaps the most common method for applied cluster analyses, a variety of other criteria are available. The p-me... 展开
作者 | Brusco MJ Kohn HF |
---|---|
作者单位 | |
期刊名称 | 《Psychometrika 》 |
总页数 | 17 |
语种/中图分类号 | 英语 / B841.7 |
关键词 | combinatorial data analysis cluster analysis p-median problem Lagrangian relaxation branch and bound heuristics TRAVELING-SALESMAN PROBLEM CLUSTER-ANALYSIS LAGRANGIAN-RELAXATION ALGORITHM LOCATION SEARCH GRAPH |
馆藏号 | N2008EPST0009481 |