The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (2002 vol.24)
pp: 1273-1280
ABSTRACT
<p><b>Abstract</b>—We present a partitional cluster algorithm that minimizes the sum-of-squared-error criterion while imposing a hard constraint on the cluster variance. Conceptually, hypothesized clusters act in parallel and cooperate with their neighboring clusters in order to minimize the criterion and to satisfy the variance constraint. In order to enable the demarcation of the cluster neighborhood without crucial parameters, we introduce the notion of <it>foreign</it> cluster samples. Finally, we demonstrate a new method for cluster tendency assessment based on varying the variance constraint parameter</p>
INDEX TERMS
Cluster analysis, partitional clustering, cluster tendency assessment, cluster validity.
CITATION
Cor J. Veenman, Marcel J.T. Reinders, Eric Backer, "A Maximum Variance Cluster Algorithm", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.24, no. 9, pp. 1273-1280, September 2002, doi:10.1109/TPAMI.2002.1033218
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool