Melola Discovery

← Melola Discovery

Open access Journal SINTA 1

Clustering using kernel entropy principal component analysis and variable kernel estimator

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 11 No. 3 (2021)

DOI
10.11591/ijece.v11i3.pp2109-2119
ISSN
2722-2578, 2088-8708
Published
2021-06-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

Abstract

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.

Collaboration network of the authors

2 authors · 1 co-authorship link

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Université Moulay Ismail de Meknes
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Oct 2026, last seen 15 Nov 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Clustering using kernel entropy principal component analysis and variable kernel estimator</dc:title><dc:creator>Fattahi, Loubna El</dc:creator><dc:creator>Sbai, El Hassan</dc:creator><dc:description>&lt;jats:p&gt;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.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2021-06-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v11i3.pp2109-2119</dc:identifier><dc:identifier>10.11591/ijece.v11i3.pp2109-2119</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 11 No 3 (2021); 2109</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/21643/14759</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>