cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Hairani
Contact Email
matrik@universitasbumigora.ac.id
Phone
+6285933083240
Journal Mail Official
matrik@universitasbumigora.ac.id
Editorial Address
Jl. Ismail Marzuki-Cilinaya-Cakranegara-Mataram 83127
Location
Kota mataram,
Nusa tenggara barat
INDONESIA
MATRIK : Jurnal Manajemen, Teknik Informatika, dan Rekayasa Komputer
Published by Universitas Bumigora
ISSN : 18584144     EISSN : 24769843     DOI : 10.30812/matrik
Core Subject : Science,
Computer Science & IT
MATRIK adalah salah satu Jurnal Ilmiah yang terdapat di Universitas Bumigora Mataram (eks STMIK Bumigora Mataram) yang dikelola dibawah Lembaga Penelitian dan Pengabadian kepada Masyarakat (LPPM). Jurnal ini bertujuan untuk memberikan wadah atau sarana publikasi bagi para dosen, peneliti dan praktisi baik di lingkungan internal maupun eksternal Universitas Bumigora Mataram. Jurnal MATRIK terbit 2 (dua) kali dalam 1 tahun pada periode Genap (Mei) dan Ganjil (Nopember).
Arjuna Subject : Ilmu Komputer (semua kategori) - Ilmu Komputer (Lain-Lain)
Articles 2 Documents
 1 
Search results for , issue "Vol. 23 No. 1 (2023)" : 2 Documents clear
Application of Numerical Measure Variations in K-Means Clustering for Grouping Data Relita Buaton; Solikhun Solikhun
MATRIK : Jurnal Manajemen, Teknik Informatika dan Rekayasa Komputer Vol. 23 No. 1 (2023)
Publisher : LPPM Universitas Bumigora

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30812/matrik.v23i1.3269

Abstract

The K-Means Clustering algorithm is commonly used by researchers in grouping data. The main problem in this study was that it has yet to be discovered how optimal the grouping with variations in distance calculations is in K-Means Clustering. The purpose of this research was to compare distance calculation methods with K-Means such as Euclidean Distance, Canberra Distance, Chebychev Distance, Cosine Similarity, Dynamic TimeWarping Distance, Jaccard Similarity, and Manhattan Distance to find out how optimal the distance calculation is in the K-Means method. The best distancecalculation was determined from the smallest Davies Bouldin Index value. This research aimed to find optimal clusters using the K-Means Clustering algorithm with seven distance calculations based on types of numerical measures. This research method compared distance calculation methods in the K-Means algorithm, such as Euclidean Distance, Canberra Distance, Chebychev Distance, Cosine Smilirity, Dynamic Time Warping Distance, Jaccard Smilirity and Manhattan Distance to find out how optimal the distance calculation is in the K-Means method. Determining the best distance calculation can be seen from the smallest Davies Bouldin Index value. The data used in this study was on cosmetic sales at Devi Cosmetics, consisting of cosmetics sales from January to April 2022 with 56 product items. The result of this study was a comparison of numerical measures in the K-Means Clustering algorithm. The optimal cluster was calculating the Euclidean distance with a total of 9 clusters with a DBI value of 0.224. In comparison, the best average DBI value was the calculation of the Euclidean Distance with an average DBI value of 0.265.
Application of Numerical Measure Variations in K-Means Clustering for Grouping Data Buaton, Relita; Solikhun, Solikhun
MATRIK : Jurnal Manajemen, Teknik Informatika dan Rekayasa Komputer Vol. 23 No. 1 (2023)
Publisher : Universitas Bumigora

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30812/matrik.v23i1.3269

Abstract

The K-Means Clustering algorithm is commonly used by researchers in grouping data. The main problem in this study was that it has yet to be discovered how optimal the grouping with variations in distance calculations is in K-Means Clustering. The purpose of this research was to compare distance calculation methods with K-Means such as Euclidean Distance, Canberra Distance, Chebychev Distance, Cosine Similarity, Dynamic TimeWarping Distance, Jaccard Similarity, and Manhattan Distance to find out how optimal the distance calculation is in the K-Means method. The best distancecalculation was determined from the smallest Davies Bouldin Index value. This research aimed to find optimal clusters using the K-Means Clustering algorithm with seven distance calculations based on types of numerical measures. This research method compared distance calculation methods in the K-Means algorithm, such as Euclidean Distance, Canberra Distance, Chebychev Distance, Cosine Smilirity, Dynamic Time Warping Distance, Jaccard Smilirity and Manhattan Distance to find out how optimal the distance calculation is in the K-Means method. Determining the best distance calculation can be seen from the smallest Davies Bouldin Index value. The data used in this study was on cosmetic sales at Devi Cosmetics, consisting of cosmetics sales from January to April 2022 with 56 product items. The result of this study was a comparison of numerical measures in the K-Means Clustering algorithm. The optimal cluster was calculating the Euclidean distance with a total of 9 clusters with a DBI value of 0.224. In comparison, the best average DBI value was the calculation of the Euclidean Distance with an average DBI value of 0.265.

Page 1 of 1 | Total Record : 2

 1 

Filter by Year

2023 2023


Reset
Filter By Issues
All Issue Vol. 25 No. 1 (2025) Vol. 24 No. 3 (2025) Vol. 24 No. 2 (2025) Vol 24 No 2 (2025) Vol. 24 No. 1 (2024) Vol 24 No 1 (2024) Vol 23 No 3 (2024) Vol. 23 No. 3 (2024) Vol. 23 No. 2 (2024) Vol 23 No 2 (2024) Vol. 23 No. 1 (2023) Vol 23 No 1 (2023) Vol 22 No 3 (2023) Vol. 22 No. 3 (2023) Vol 22 No 2 (2023) Vol 22 No 1 (2022) Vol 21 No 3 (2022) Vol 21 No 2 (2022) Vol 21 No 1 (2021) Vol 20 No 2 (2021) Vol 20 No 1 (2020) Vol 19 No 2 (2020) Vol 19 No 1 (2019) Vol 18 No 2 (2019) Vol. 18 No. 2 (2019) Vol 18 No 1 (2018) Vol 17 No 2 (2018) Vol 17 No 1 (2017) Vol 16 No 2 (2017) Vol 16 No 1 (2016) Vol 15 No 2 (2016) Vol 15 No 1 (2015) More Issue