Effect of Kernel Learning in Unsupervised Learning for Clustering High Dimensional Databases
Esha Kashyap1, S.R.Kannan2, Mark Last3
1Esha Kashyap, Department of Mathematics, Pondicherry University, Puduchery, India.
2S.R.Kannan, Department of Mathematics, Pondicherry University, Puduchery, India.
3Mark Last, Department of Software and Information Systems Engineering, Ben-Gurion University of the Negev, Negev, Israel.
Manuscript received on 04 June 2019 | Revised Manuscript received on 12 June 2019 | Manuscript Published on 29 June 2019 | PP: 99-105 | Volume-8 Issue-5S, May 2019 | Retrieval Number: E10210585S19/19©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: This paper reviews the effectiveness of kernel learning in unsupervised data analysis using clustering. Cluster analysis is an explorative data analysis tool that assists in discovering hidden patterns or natural grouping and has many effective applications in various disciplines. The unison of kernel learning with the objective of unsupervised clustering algorithms facilitates in recognizing non linear structures in high dimensional data containing outliers with heavy noise. The recent kernel clustering methods considered in this paper are the kernelized versions of K-Means, Fuzzy C-Means, Possibilistic C-Means and Intuitionistic Fuzzy C-Means. Computational complexities in kernel based clustering algorithms are quiet prominent and our objective is to understand the performance gains while using kernels in clustering. Experimental studies of this paper substantiate that kernel based clustering algorithms yields significant improvements over their traditional counterparts.
Keywords: Unsupervised Clustering, Data Analysis, Kernel learning, Partition Clustering.
Scope of the Article: Clustering