Evaluation of the performance of clustering algorithms in kernel-induced feature space

✍ Scribed by Dae-Won Kim; Ki Young Lee; Doheon Lee; Kwang H. Lee

• Publisher: Elsevier Science
• Year: 2005
• Tongue: English
• Weight: 223 KB
• Volume: 38
• Category: Article
• ISSN: 0031-3203
• DOI: 10.1016/j.patcog.2004.09.006

✦ Synopsis

By using a kernel function, data that are not easily separable in the original space can be clustered into homogeneous groups in the implicitly transformed high-dimensional feature space. Kernel k-means algorithms have recently been shown to perform better than conventional k-means algorithms in unsupervised classification. However, few reports have examined the benefits of using a kernel function and the relative merits of the various kernel clustering algorithms with regard to the data distribution. In this study, we reformulated four representative clustering algorithms based on a kernel function and evaluated their performances for various data sets. The results indicate that each kernel clustering algorithm gives markedly better performance than its conventional counterpart for almost all data sets. Of the kernel clustering algorithms studied in the present work, the kernel average linkage algorithm gives the most accurate clustering results.