Open AccessClustering using kernel entropy principal component analysis and variable kernel estimator
Author(s) -
Loubna El Fattahi,
El Hassan Sbai
Publication year - 2021
Publication title -
international journal of power electronics and drive systems/international journal of electrical and computer engineering
Language(s) - English
Resource type - Journals
eISSN - 2722-2578
pISSN - 2722-256X
DOI - 10.11591/ijece.v11i3.pp2109-2119
Subject(s) - cluster analysis , kernel principal component analysis , computer science , kernel (algebra) , entropy (arrow of time) , data mining , pattern recognition (psychology) , transformation (genetics) , principal component analysis , artificial intelligence , kernel method , mathematics , algorithm , support vector machine , biochemistry , physics , chemistry , combinatorics , quantum mechanics , gene
Clustering as unsupervised learning method is the mission of dividing data objects into clusters with common characteristics. In the present paper, we introduce an enhanced technique of the existing EPCA data transformation method. Incorporating the kernel function into the EPCA, the input space can be mapped implicitly into a high-dimensional of feature space. Then, the Shannon’s entropy estimated via the inertia provided by the contribution of every mapped object in data is the key measure to determine the optimal extracted features space. Our proposed method performs very well the clustering algorithm of the fast search of clusters’ centers based on the local densities’ computing. Experimental results disclose that the approach is feasible and efficient on the performance query.