KOMBINASI K-MEANS DENGAN PARTICLE SWARM OPTIMIZATION UNTUK CLUSTERING PADA DATA PENJUALAN SUPERMARKET

Ryana, Purwaningrum (2024) KOMBINASI K-MEANS DENGAN PARTICLE SWARM OPTIMIZATION UNTUK CLUSTERING PADA DATA PENJUALAN SUPERMARKET. Undergraduate Thesis thesis, Institut Teknologi Telkom Purwokerto.

[img] Text
COVER.pdf

Download (597kB)
[img] Text
ABSTRACT.pdf

Download (151kB)
[img] Text
ABSTRAK.pdf

Download (513kB)
[img] Text
BAB 1.pdf

Download (597kB)
[img] Text
BAB 2.pdf

Download (920kB)
[img] Text
BAB 3.pdf

Download (577kB)
[img] Text
BAB 4.pdf
Restricted to Registered users only

Download (599kB)
[img] Text
BAB 5.pdf

Download (160kB)
[img] Text
DAFTAR PUSTAKA.pdf

Download (375kB)
[img] Text
LAMPIRAN.pdf
Restricted to Registered users only

Download (307kB)

Abstract

Supermarkets are a type of large store that offers a variety of retail goods in large quantities, including household appliances, food, drinks and other products. To improve stock management, reduce waste, and respond to changes in market demand, an effective sales strategy is needed. One approach that can be used is the clustering method in data mining, which utilizes information technology. The iK-Meansi algorithm is one of the most commonly used algorithms for clustering, but has a weakness in determining the centroid value which can result in it falling to the local optimal point. ParticleiSwarmiOptimization is an algorithm that can be used to optimize the KMeans centroid value, so that the resulting cluster is more optimal. This research proposes a combination of the K-MeansidaniParticle Swarm Optimization algorithm. The aim of this research is to improve the initial initialization of cluster centers. By using the elbow method, 3 optimal clusters were obtained. Results from this research Analysis From this, the combination of ParticleiSwarmiOptimization with K-Means produces a Sum of Squared Errors (SSE) value that is much higher compared to K-Means alone, showing a greater spread between data points and the centroids of their groups. Nevertheless, both have the same Davies-Bouldin Index (DBI) values, indicating comparable clustering quality in terms of separation between clusters and compactness within clusters. However, the combination of ParticleiSwarmiOptimization with K-Means has a lower Quantization Error value, indicating its effectiveness in mapping data to centroids better, which leads to more accurate clustering. Therefore, the combination method of Particle Swarm Optimization with K-Means is superior. Keywords: Supermarkets, Sales Strategy, Clustering, Particle Swarm Optimization, and K-Meansi

Item Type: Thesis (Undergraduate Thesis)
Subjects: T Technology > T Technology (General)
Divisions: Faculty of Informatics > Data Science
Depositing User: repository staff
Date Deposited: 02 Oct 2024 06:48
Last Modified: 02 Oct 2024 06:48
URI: http://repository.ittelkom-pwt.ac.id/id/eprint/11393

Actions (login required)

View Item View Item