Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

eHMCOKE: an enhanced overlapping clustering algorithm for data analysis

Bulletin of Electrical Engineering and Informatics · Vol. 10 No. 4 (2021) · hlm. 2212–2222

DOI
10.11591/eei.v10i4.2547
ISSN
2089-3191, 2302-9285
Terbit
2021-07-07
Penerbit
Institute of Advanced Engineering and Science (IAES)
Bahasa
en
Lisensi
creativecommons.org/licenses/by-sa/4.0/

Abstrak

Improved multi-cluster overlapping k-means extension (IMCOKE) uses median absolute deviation (MAD) in detecting outliers in datasets makes the algorithm more effective with regards to overlapping clustering. Nevertheless, analysis of the applied MAD positioning was not considered. In this paper, the incorporation of MAD used to detect outliers in the datasets was analyzed to determine the appropriate position in identifying the outlier before applying it in the clustering application. And the assumption of the study was the size of the cluster and cluster that are close to each other can led to a higher runtime performance in terms of overlapping clusters. Therefore, additional parameters such as radius of clusters and distance between clusters are added measurements in the algorithm procedures. Evaluation was done through experimentations using synthetic and real datasets. The performance of the eHMCOKE was evaluated via F1-measure criterion, speed and percentage of improvement. Evaluation results revealed that the eHMCOKE takes less time to discover overlap clusters with an improvement rate of 22% and achieved the best performance of 91.5% accuracy rate via F1-measure in identifying overlapping clusters over the IMCOKE algorithm. These results proved that the eHMCOKE significantly outruns the IMCOKE algorithm on mosts of the test conducted.

Kata kunci

Jaringan kolaborasi para penulis

7 penulis · 18 tautan kepenulisan bersama · 8 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Tarlac State University
  • Emilio Aguinaldo College
  • Technological Institute of the Philippines
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Ruji P. MedinaTechnological Institute of the Philippines2
Ariel M. SisonEmilio Aguinaldo College2
Heidilyn V. GamidoTarlac State University2
Marlon Viray GamidoTarlac State University2
Jerico S. BaladhayTarlac State University2

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OpenAlex API (jurnal SINTA, ADR 0048) https://openalex.org/S2765016208, pertama di-harvest 19 Nov 2026, terakhir terlihat 19 Nov 2026.
Metadata asli (oai_dc)
<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 xml:lang="en">eHMCOKE: an enhanced overlapping clustering algorithm for data analysis</dc:title><dc:creator>Alvincent Egonia Danganan</dc:creator><dc:creator>Edjie Malonzo De Los Reyes</dc:creator><dc:subject>overlapping clustering</dc:subject><dc:subject>K-means clustering</dc:subject><dc:subject>median absolute deviation</dc:subject><dc:subject>outlier detection</dc:subject><dc:subject>cluster radius</dc:subject><dc:subject>cluster distance</dc:subject><dc:subject>clustering algorithm performance</dc:subject><dc:subject>runtime efficiency</dc:subject><dc:description xml:lang="en">Improved multi-cluster overlapping k-means extension (IMCOKE) uses median absolute deviation (MAD) in detecting outliers in datasets makes the algorithm more effective with regards to overlapping clustering. Nevertheless, analysis of the applied MAD positioning was not considered. In this paper, the incorporation of MAD used to detect outliers in the datasets was analyzed to determine the appropriate position in identifying the outlier before applying it in the clustering application. And the assumption of the study was the size of the cluster and cluster that are close to each other can led to a higher runtime performance in terms of overlapping clusters. Therefore, additional parameters such as radius of clusters and distance between clusters are added measurements in the algorithm procedures. Evaluation was done through experimentations using synthetic and real datasets. The performance of the eHMCOKE was evaluated via F1-measure criterion, speed and percentage of improvement. Evaluation results revealed that the eHMCOKE takes less time to discover overlap clusters with an improvement rate of 22% and achieved the best performance of 91.5% accuracy rate via F1-measure in identifying overlapping clusters over the IMCOKE algorithm. These results proved that the eHMCOKE significantly outruns the IMCOKE algorithm on mosts of the test conducted.</dc:description><dc:publisher>Institute of Advanced Engineering and Science (IAES)</dc:publisher><dc:date>2021-07-07</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/eei.v10i4.2547</dc:identifier><dc:identifier>10.11591/eei.v10i4.2547</dc:identifier><dc:source>Bulletin of Electrical Engineering and Informatics; Vol 10 No 4 (2021); 2212-2222</dc:source><dc:source>2089-3191</dc:source><dc:source>2302-9285</dc:source><dc:language>en</dc:language><dc:relation>https://beei.org/index.php/EEI/article/download/2547/2283</dc:relation><dc:rights>https://creativecommons.org/licenses/by-sa/4.0/</dc:rights></oai_dc:dc>