Genetic Algorithm Based Parallel K-Means Data Clustering Algorithm Using MapReduce Programming Paradigm on Hadoop Environment (GAPKCA)

2019 ◽  
pp. 98-108 ◽  
Author(s):  
Sayer Alshammari ◽  
Maslina Binti Zolkepli ◽  
Rusli Bin Abdullah
Keyword(s):  
Genetic Algorithm ◽  
Data Clustering ◽  
Clustering Algorithm ◽  
Programming Paradigm

Balanced Data Clustering Algorithm for Both Hard and Soft Clustering

2018 ◽  
Vol 6 (2) ◽  
pp. 176-183
Author(s):  
Purnendu Das ◽  
◽  
Bishwa Ranjan Roy ◽  
Saptarshi Paul ◽  
◽  
...  
Keyword(s):  
Data Clustering ◽  
Clustering Algorithm ◽  
Soft Clustering

scholarly journals Multimodal Optimization of Permutation Flow-Shop Scheduling Problems Using A Clustering-Genetic-Algorithm-Based Approach

2021 ◽  
Vol 11 (8) ◽  
pp. 3388
Author(s):  
Pan Zou ◽  
Manik Rajora ◽  
Steven Y. Liang
Keyword(s):  
Genetic Algorithm ◽  
Clustering Algorithm ◽  
Flow Shop ◽  
Optimal Schedule ◽  
Flow Shop Scheduling ◽  
Multimodal Optimization ◽  
Shop Scheduling ◽  
Permutation Flow Shop Scheduling ◽  
Permutation Flow Shop ◽  
Global Optima

Though many techniques were proposed for the optimization of Permutation Flow-Shop Scheduling Problem (PFSSP), current techniques only provide a single optimal schedule. Therefore, a new algorithm is proposed, by combining the k-means clustering algorithm and Genetic Algorithm (GA), for the multimodal optimization of PFSSP. In the proposed algorithm, the k-means clustering algorithm is first utilized to cluster the individuals of every generation into different clusters, based on some machine-sequence-related features. Next, the operators of GA are applied to the individuals belonging to the same cluster to find multiple global optima. Unlike standard GA, where all individuals belong to the same cluster, in the proposed approach, these are split into multiple clusters and the crossover operator is restricted to the individuals belonging to the same cluster. Doing so, enabled the proposed algorithm to potentially find multiple global optima in each cluster. The performance of the proposed algorithm was evaluated by its application to the multimodal optimization of benchmark PFSSP. The results obtained were also compared to the results obtained when other niching techniques such as clearing method, sharing fitness, and a hybrid of the proposed approach and sharing fitness were used. The results of the case studies showed that the proposed algorithm was able to consistently converge to better optimal solutions than the other three algorithms.

CLUSTERING USING AN IMPROVED HYBRID GENETIC ALGORITHM

2007 ◽  
Vol 16 (06) ◽  
pp. 919-934
Author(s):  
YONGGUO LIU ◽  
XIAORONG PU ◽  
YIDONG SHEN ◽  
ZHANG YI ◽  
XIAOFENG LIAO
Keyword(s):  
Genetic Algorithm ◽  
Clustering Algorithm ◽  
Hybrid Genetic Algorithm ◽  
Sum Of Squares ◽  
Clustering Methods ◽  
Clustering Problem ◽  
Mutation Operation ◽  
Iteration Methods ◽  
Genetic Clustering ◽  
The Individual

In this article, a new genetic clustering algorithm called the Improved Hybrid Genetic Clustering Algorithm (IHGCA) is proposed to deal with the clustering problem under the criterion of minimum sum of squares clustering. In IHGCA, the improvement operation including five local iteration methods is developed to tune the individual and accelerate the convergence speed of the clustering algorithm, and the partition-absorption mutation operation is designed to reassign objects among different clusters. By experimental simulations, its superiority over some known genetic clustering methods is demonstrated.

Tree-ART2 Learning Model for Spatial Clustering in Second Dimension

2014 ◽  
Vol 543-547 ◽  
pp. 1934-1938
Author(s):  
Ming Xiao
Keyword(s):  
Network Model ◽  
Spatial Data ◽  
Data Clustering ◽  
Clustering Algorithm ◽  
Spatial Clustering ◽  
Adaptive Resonance Theory ◽  
Spatial Distance ◽  
Resonance Theory ◽  
Adaptive Resonance ◽  
Vector Module

For a clustering algorithm in two-dimension spatial data, the Adaptive Resonance Theory exists not only the shortcomings of pattern drift and vector module of information missing, but also difficultly adapts to spatial data clustering which is irregular distribution. A Tree-ART2 network model was proposed based on the above situation. It retains the memory of old model which maintains the constraint of spatial distance by learning and adjusting LTM pattern and amplitude information of vector. Meanwhile, introducing tree structure to the model can reduce the subjective requirement of vigilance parameter and decrease the occurrence of pattern mixing. It is showed that TART2 network has higher plasticity and adaptability through compared experiments.

scholarly journals Improved Fuzzy C-Means Clustering for Transformer Fault Diagnosis Using Dissolved Gas Analysis Data

Energies ◽  
2018 ◽  
Vol 11 (9) ◽  
pp. 2344 ◽  
Author(s):  
Enwen Li ◽  
Linong Wang ◽  
Bin Song ◽  
Siliang Jian
Keyword(s):  
Fault Diagnosis ◽  
Membership Function ◽  
Data Clustering ◽  
Clustering Algorithm ◽  
Gas Analysis ◽  
Dissolved Gas ◽  
Fuzzy C Means ◽  
Dissolved Gas Analysis ◽  
Fcm Clustering ◽  
Transformer Fault

Dissolved gas analysis (DGA) of the oil allows transformer fault diagnosis and status monitoring. Fuzzy c-means (FCM) clustering is an effective pattern recognition method, but exhibits poor clustering accuracy for dissolved gas data and usually fails to subsequently correctly classify transformer faults. The existing feasible approach involves combination of the FCM clustering algorithm with other intelligent algorithms, such as neural networks and support vector machines. This method enables good classification; however, the algorithm complexity is greatly increased. In this paper, the FCM clustering algorithm itself is improved and clustering analysis of DGA data is realized. First, the non-monotonicity of the traditional clustering membership function with respect to the sample distance and its several local extrema are discussed, which mainly explain the poor classification accuracy of DGA data clustering. Then, an exponential form of the membership function is proposed to obtain monotony with respect to distance, thereby improving the dissolved gas data clustering. Likewise, a similarity function to determine the degree of membership is derived. Test results for large datasets show that the improved clustering algorithm can be successfully applied for DGA-data-based transformer fault detection.

scholarly journals GENETIC ALGORITHM-BASED CLUSTERING OF WIRELESS SENSOR NETWORK WITH NOVEL DATA ENCRYPTION

2017 ◽  
Vol 10 (13) ◽  
pp. 94
Author(s):  
Bachujayendra Kumar ◽  
Rajya Lakshmidevi K ◽  
M Verginraja Sarobin
Keyword(s):  
Genetic Algorithm ◽  
Energy Efficiency ◽  
Information Security ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Data Encryption ◽  
Base Station ◽  
Wireless Sensor ◽  
Clustering Techniques ◽  
Main Challenge

Wireless sensor networks (WSNs) have been used widely in so many applications. It is the most efficient way to monitor the information. There areso many ways to deploy the sensors. Many problems are not identified and solved. The main challenge of WSN is energy efficiency and information security. WSN power consumption is reduced by genetic algorithm-based clustering algorithm. Information from cluster head to base station may have a lot of chances to get hacked. The most reliable way to manage energy consumption is clustering, and encryption will suit best for information security. In this paper, we explain clustering techniques and a new algorithm to encrypt the data in the network.

scholarly journals Algoritma K-Means Clustering dalam Mengklasifikasi Data Daerah Rawan Tindak Kriminalitas (Polres Kepulauan Mentawai)

2021 ◽  
pp. 243-248
Author(s):  
Yoni Aswan ◽  
Sarjon Defit ◽  
Gunadi Widi Nurcahyo
Keyword(s):  
Data Clustering ◽  
Clustering Algorithm ◽  
Motor Vehicle ◽  
Motor Vehicles ◽  
Hierarchical Data ◽  
Motor Vehicle Theft ◽  
Vehicle Theft ◽  
Mentawai Islands ◽  
Or Groups ◽  
Different Characteristics

Crime is all kinds of actions and actions that are economically and psychologically harmful that violate the laws in force in the State of Indonesia as well as social and religious norms. Ordinary criminal acts affect the security of the community and threaten their inner and outer peace. The research location is the Mentawai Islands Police, which is an agency that can provide security and protection for the community, especially those in the Mentawai Islands Regency. The problem is that it is difficult for the Mentawai Islands Police to classify areas that are prone to crime in the most vulnerable, moderately vulnerable and not vulnerable categories. Especially considering the condition of the Mentawai, there are four large islands consisting of 10 sub-districts, where crime is increasing every year, especially those in the Mentawai Islands Regency area such as motor vehicle theft. Based on the background of the problem above, the researcher is interested in taking research in creating a system to predict the crime rate in the Mentawai Islands Regency in order to anticipate the surge in crime that will come. The method used is the K-Means Clustering Algorithm as a non-hierarchical data clustering method to partition existing data into one or more clusters or groups. This method partitions data into clusters so that data with the same characteristics are grouped into the same cluster and data with different characteristics are grouped into other clusters. Clustering is one of the data mining techniques used to get groups of objects that have common characteristics in large enough data. The data used is data on cases of criminal theft of motor vehicles for the last 5 years from 2016 to 2020. The results of the test show that South Sipora District is an area prone to the crime of motor vehicle theft.

Sign in / Sign up

Export Citation Format

Share Document