scholarly journals OPTIMASI K-MEANS CLUSTERING UNTUK IDENTIFIKASI DAERAH ENDEMIK PENYAKIT MENULAR DENGAN ALGORITMA PARTICLE SWARM OPTIMIZATION DI KOTA SEMARANG

2018 ◽  
Vol 10 (3) ◽  
pp. 251-259
Author(s):  
Suhardi Rustam ◽  
Heru Agus Santoso ◽  
Catur Supriyanto
Keyword(s):  
Data Mining ◽  
Particle Swarm Optimization ◽  
Infectious Diseases ◽  
Clustering Algorithm ◽  
Particle Swarm ◽  
Public Health Problem ◽  
Major Public Health Problem ◽  
Swarm Optimization ◽  
Tropical Regions ◽  
Endemic Areas

Tropical regions is a region endemic to various infectious diseases. At the same time an area of high potential for the presence of infectious diseases. Infectious diseases still a major public health problem in Indonesia. Identification of endemic areas of infectious diseases is an important issue in the field of health, the average level of patients with physical disabilities and death are sourced from infectious diseases. Data Mining in its development into one of the main trends in the processing of the data. Data Mining could effectively identify the endemic regions of hubunngan between variables. K-means algorithm klustering used to classify the endemic areas so that the identification of endemic infectious diseases can be achieved with the level of validation that the maximum in the clustering. The use of optimization to identify the endemic areas of infectious diseases combines k-means clustering algorithm with optimization particle swarm optimization ( PSO ). the results of the experiment are endemic to the k-means algorithm with iteration =10, the K-Fold =2 has Index davies bauldin = 0.169 and k-means algorithm with PSO, iteration = 10, the K-Fold = 5, index davies bouldin = 0.113. k-fold = 5 has better performance.

scholarly journals Memetic Variable Clustering and Its Application

2019 ◽  
Vol 2019 ◽  
pp. 1-15
Author(s):  
JiaCheng Ni ◽  
Li Li
Keyword(s):  
Particle Swarm Optimization ◽  
Local Search ◽  
Clustering Analysis ◽  
Clustering Algorithm ◽  
Particle Swarm ◽  
Optimization Techniques ◽  
Experimental Result ◽  
Swarm Optimization ◽  
Metaheuristic Optimization ◽  
Variable Clustering

Clustering analysis is an important and difficult task in data mining and big data analysis. Although being a widely used clustering analysis technique, variable clustering did not get enough attention in previous studies. Inspired by the metaheuristic optimization techniques developed for clustering data items, we try to overcome the main shortcoming of k-means-based variable clustering algorithm, which is being sensitive to initial centroids by introducing the metaheuristic optimization. A novel memetic algorithm named MCLPSO (Memetic Comprehensive Learning Particle Swarm Optimization) based on CLPSO (Comprehensive Learning Particle Swarm Optimization) has been studied under the framework of memetic computing in our previous work. In this work, MCLPSO is used as a metaheuristic approach to improve the k-means-based variable clustering algorithm by adjusting the initial centroids iteratively to maximize the homogeneity of the clustering results. In MCLPSO, a chaotic local search operator is used and a simulated annealing- (SA-) based local search strategy is developed by combining the cognition-only PSO model with SA. The adaptive memetic strategy can enable the stagnant particles which cannot be improved by the comprehensive learning strategy to escape from the local optima and enable some elite particles to give fine-grained local search around the promising regions. The experimental result demonstrates a good performance of MCLPSO in optimizing the variable clustering criterion on several datasets compared with the original variable clustering method. Finally, for practical use, we also developed a web-based interactive software platform for the proposed approach and give a practical case study—analyzing the performance of semiconductor manufacturing system to demonstrate the usage.

Sign in / Sign up

Export Citation Format

Share Document