KERNEL METHODS FOR CLUSTERING: COMPETITIVE LEARNING AND c-MEANS

doi:10.1142/s0218488506004138

KERNEL METHODS FOR CLUSTERING: COMPETITIVE LEARNING AND c-MEANS

2011-11-21

0

PRE

AI

DOI：10.1142/s0218488506004138

原文链接

原文求助

摘要

En 中文

Recently kernel methods in support vector machines have widely been used in machine learning algorithms to obtain nonlinear models. Clustering is an unsupervised learning method which divides whole data set into subgroups, and popular clustering algorithms such as c-means are employing kernel methods. Other kernel-based clustering algorithms have been inspired from kernel c-means. However, the formulation of kernel c-means has a high computational complexity. This paper gives an alternative formulation of kernel-based clustering algorithms derived from competitive learning clustering. This new formulation obviously uses sequential updating or on-line learning to avoid high computational complexity. We apply kernel methods to related algorithms: learning vector quantization and self-organizing map. We moreover consider kernel methods for sequential c-means and its fuzzy version by the proposed formulation.

KERNEL METHODS FOR CLUSTERING: COMPETITIVE LEARNING AND c-MEANS

摘要

AI总结

期刊

机构

引用论文