Convergence Behavior of Competitive Repetition-Suppression Clustering

Davide Bacciu, Antonina Starita

Abstract

Competitive Repetition-suppression (CoRe) clustering is a bio-inspired learning algorithm that is capable of automatically determining the unknown cluster number from the data. In a previous work it has been shown how CoRe clustering represents a robust generalization of rival penalized competitive learning (RPCL) by means of M-estimators. This paper studies the convergence behavior of the CoRe model, based on the analysis proposed for the distance-sensitive RPCL (DSRPCL) algorithm. Furthermore, it is proposed a global minimum criterion for learning vector quantization in kernel space that is used to assess the correct location property for the CoRe algorithm.
BibTeX
@inproceedings{bacciu2007convergence,
  author = {Davide Bacciu and Antonina Starita},
  title = {{Convergence Behavior of Competitive Repetition-Suppression Clustering}},
  booktitle = {ICONIP},
  year = {2007},
  doi = {10.1007/978-3-540-69158-7\_52},
}

Loading related content...

Figure