Soft learning vector quantization and clustering algorithms based on non-Euclidean norms: single-norm algorithms.
This paper presents the development of soft clustering and learning vector quantization (LVQ) algorithms that rely on a weighted norm to measure the distance between the feature vectors and their prototypes. The development of LVQ and clustering algorithms is based on the minimization of a reformulation function under the constraint that the generalized mean of the norm weights be constant. According to the proposed formulation, the norm weights can be computed from the data in an iterative fashion together with the prototypes. An error analysis provides some guidelines for selecting the parameter involved in the definition of the generalized mean in terms of the feature variances. The algorithms produced from this formulation are easy to implement and they are almost as fast as clustering algorithms relying on the Euclidean norm. An experimental evaluation on four data sets indicates that the proposed algorithms outperform consistently clustering algorithms relying on the Euclidean norm and they are strong competitors to non-Euclidean algorithms which are computationally more demanding.
Karayiannis
Nicolaos B
NB
Department of Electrical and Computer Engineering, University of Houston, Houston, TX 77204, USA. Karayiannis@UH.EDU
Randolph-Gips
Mary M
MM
D000465:Algorithms; D016000:Cluster Analysis; D007858:Learning / Q000502:physiology