Abstract
A self-organizing k-means algorithm to classify the inputs (data) into classes is presented. This algorithm provides solutions to the problems that the k-means classification algorithm faces. The k-means classification algorithm has the problem of selecting the threshold(s). It also requires that the number of classes be known a priori. This algorithm forms clusters, removes noise, and is trained without supervision. The clustering is done on the basis of the statistical properties of the set of input data. The algorithm consists of two phases. The first phase is similar to the Carpenter/Grossberg classifier, and the second phase is a modified version of the k-means algorithm. An example is given to illustrate the application of this algorithm and to compare this algorithm with the k-means algorithm.