Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Jurnal Ilmiah Kursor

CASE BASED REASONING (CBR) FOR OBESITY LEVEL ESTIMATION USING K-MEANS INDEXING METHOD I Made Satria Bimantara; I Wayan Supriana
Jurnal Ilmiah Kursor Vol 11 No 4 (2022)
Publisher : Universitas Trunojoyo Madura

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21107/kursor.v11i4.268

Abstract

As many as 600 million of the 1.9 billion adults who are overweight are obese. Obesity that is not treated immediately will be a risk factor for increasing cardiovascular, metabolic, degenerative diseases, and even death at a young age. Case Based Reasoning (CBR) can be used to estimate a person's obesity level using previous cases. The old case with the highest similarity will be the solution for the new case. Indexing methods such as the K-Means Algorithm are needed so that the search for similar cases does not involve all cases on a case base so that it can shorten the computation time at the retrieve stage and still produce optimal solutions. Cosine similarity is used to find relevant clusters of new cases and Euclidean distance similarity is used to calculate similarity between cases. Random subsampling method was used to validate the CBR system. The test results with K=2 indicate that the CBR is better than the CBR-K-Means, each of which produces an average accuracy of 88.365% and 88.270% at a threshold of 0.8. CBR-K-Means produces an average computation time at the retrieve stage of 33.55 seconds and is faster than the CBR of 35.5 seconds.
OPTIMIZATION OF K-MEANS CLUSTERING USING PARTICLE SWARM OPTIMIZATION ALGORITHM FOR GROUPING TRAVELER REVIEWS DATA ON TRIPADVISOR SITES I Made Satria Bimantara; I Made Widiartha
Jurnal Ilmiah Kursor Vol 12 No 1 (2023)
Publisher : Universitas Trunojoyo Madura

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21107/kursor.v12i01.269

Abstract

K-Means Algorithm can be used to group tourists based on reviews on tourist destination objects. This algorithm has a weakness that is sensitive to the determination of the initial centroid. The initial centroid that is determined at random will decreasing the level accuracy, often gets stuck at the local optimum, and gets a random solution. Optimization algorithms such as PSO can overcome this by determining the optimal initial centroid. The optimal number of clusters (K) will be determined using the Elbow method by calculating the SSE value of the resulting cluster. The average Silhouette Coefficient (SC) is used to measure the quality of the clusters produced by the K-Means Algorithm with and without the PSO Algorithm. This study uses secondary data obtained from the UCI Machine Learning Repository with the name Travel Reviews Data Set which consists of 980 records and 10 attributes. The test results show that K=2 is the optimal number of clusters. The K-Means and PSO Algorithm gives an average SC value of 0.300358 which is better than without the PSO Algorithm of 0.300076. The optimal PSO hyperparameter generated is the number of particles=30, \varphi_1=2.2, and {\ \varphi}_2=3 at maximum iteration of 100.