DESTEK VEKTÖR ÖBEKLEME İÇİN ETKİLİ KERNEL FONKSİYONLARININ ARAŞTIRILMASI

Abstract

Clustering is an effective tool that divides data into different classes to reveal internal and previously unknown data schemes. However, in conventional clustering algorithms such as the k-means, k-NN, fuzzy c tool, the selection of the appropriate number of clusters for each data set is uncertain and varies with the data sets. Furthermore, the data sets to which the clustering algorithm is applied generally have nonlinear boundaries between clusters. Determining these nonlinear boundaries in the input space causes a complex problem. To overcome these problems, kernel-based clustering methods have been developed in recent years, which automatically determine the number and boundaries of clusters. In particular, the Support Vector Clustering (SVC) algorithm has received great attention in data analysis because of its features such as automatically determining the number of clusters and recognizing nonlinear boundaries based on the Gaussian kernel parameter. The number of clusters and region boundaries produced by SVC may show variation depending on the choice of the kernel function and its parameters. Therefore, the choice of kernel function plays a significant role. In this study, for the first time, the implementation of two different kernel (Cauchy and Laplacian) functions and evaluation of their performances have been realized within the framework of SVC. It was observed that the Laplacian kernel function performed better than Gauss and Cauchy kernel functions.