N data items —- > k clusters
in each cluster, there is a cluster center.
Object: minimize the maximum distance from each item to its nearest cluster centers (maximum distance !! not sum of distance !!)
来源于:https://blog.youkuaiyun.com/qq_29007291/article/details/76668740
N 个样本,有K个聚类,在每一个类别中,有一个聚类中心。
如何优化:
k-center center 的选取是基于与此类样本中最小距离来查找的。