The goal of clustering is to cluster the objects into groups that are internally homogeneous and heterogeneous from group to group. Clustering is an important tool for diversely intelligent systems. So, many works have been researched in the machine learning algorithms. But, some problems are still shown in the clustering. One of them is to determine the optimal number of clusters. In K-means algorithm, the number of cluster K is determined by the art of researchers. Another problem is an over fitting of learning models. The majority of learning algorithms for clustering are not free from the problem. Therefore, we propose a competitive co-evolving support vector clustering. Using competitive co-evolutionary computing, we overcome the over fitting problem of support vector clustering which is a good learning model for clustering. The number of clusters is efficiently determined by our competitive co-evolving support vector clustering. To verify the improved performances of our research, we compare competitive co-evolving support vector clustering with established clustering methods using the data sets form UCI machine learning repository. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Jun, S. H., & Oh, K. W. (2006). A competitive co-evolving support vector clustering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4232 LNCS, pp. 864–873). Springer Verlag. https://doi.org/10.1007/11893028_96
Mendeley helps you to discover research relevant for your work.