2004•Jisuanji gongcheng yu shejiRequires access
K-maxmins clustering algorithm
Yu Wang
Open publisher page 1 citations
Abstract
On the basis of analyzing k-means clustering algorithm and k-medians clustering algorithm, cluster analysis is made on a set of data objects by using tschebyshev distance (i.e. -norm) to have got a novel result that the cluster center is just the average of the maximum and minimum values of the data objects. Furthermore, a new clustering algorithm-k-maxmins clustering algorithm is presented. Finally, computing results of k-maxmins clustering algorithm, k-means clustering algorithm and k-medians clustering algorithm are given.