An efficient similarity-based validity index for kernel clustering algorithm

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The qualities of clustering, including those obtained by the kernel-based methods should be assessed. In this paper, by investigating the inherent pairwise similarities in kernel matrix implicitly defined by the kernel function, we define two statistical similarity coefficients which can be used to describe the within-cluster and between-cluster similarities between the data items, respectively. And then, an efficient cluster validity index and a self-adaptive kernel clustering (SAKC) algorithm are proposed based on these two similarity coefficients. The performance and effectiveness of the proposed validity index and SAKC algorithm are demonstrated, compared with some existing methods, on two synthetic datasets and four UCI real databases. And the robustness of this new index with Gaussian kernel width is also explored tentatively. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Pu, Y. W., Zhu, M., Jin, W. D., & Hu, L. Z. (2006). An efficient similarity-based validity index for kernel clustering algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3971 LNCS, pp. 1044–1049). Springer Verlag. https://doi.org/10.1007/11759966_153

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free