You can view the full text of this article for free using the link below.

Title: A conditionally positive definite kernel function for possibilistic clustering

Authors: Jyotsna Nigam; Meena Tushir; Dinesh Rai

Addresses: Department of Information Technology, Maharaja Surajmal Institute of Technology, Delhi, India ' Department of Information Technology, Maharaja Surajmal Institute of Technology, Delhi, India ' Department of Computer Science and Engineering, Ansal University School of Engineering and Technology, Gurgaon, India

Abstract: In the past few years, the kernel-based clustering methods have overpowered the conventional clustering techniques in the field of unsupervised learning due to its strength and effectiveness to deal with nonlinearly separable data and mapping it into higher dimensional feature space by preserving the inner structure of the data. Many kernel functions exist in the literature which works effectively depending on the type of dataset to be used. In this paper, we have proposed a new log kernel function which is embedded in the unsupervised possibilistic clustering and this kernel function is not explored much in research. We have done extensive comparison of the proposed algorithm with few clustering techniques over a test suite of several synthetic and real life datasets. Based on the experimental results, we have proved that our algorithm gives better performance than the previous methods on various comparative parameters like ideal centroids, error rate, misclassification, accuracy and elapsed time.

Keywords: unsupervised learning; possibilistic c-means; conditionally positive definite function; fuzzy c-means; kernel functions.

DOI: 10.1504/IJAISC.2017.10005161

International Journal of Artificial Intelligence and Soft Computing, 2017 Vol.6 No.1, pp.75 - 91

Received: 13 Jan 2016
Accepted: 24 Nov 2016

Published online: 21 May 2017 *

Full-text access for editors Access for subscribers Free access Comment on this article