Genetic K-means Algorithm Research Articles

A Novel K-Means Clustering Method for Locating Urban Hotspots Based on Hybrid Heuristic Initialization

With rapid economic and demographic growth, traffic conditions in medium and large cities are becoming extremely congested. Numerous metropolitan management organizations hope to promote the coordination of traffic and urban development by formulating and improving traffic development strategies. The effectiveness of these solutions depends largely on an accurate assessment of the distribution of urban hotspots (centers of traffic activity). In recent years, many scholars have employed the K-Means clustering technique to identify urban hotspots, believing it to be efficient. K-means clustering is a sort of iterative clustering analysis. When the data dimensionality is large and the sample size is enormous, the K-Means clustering algorithm is sensitive to the initial clustering centers. To mitigate the problem, a hybrid heuristic “fuzzy system-particle swarm-genetic” algorithm, named FPSO-GAK, is employed to obtain better initial clustering centers for the K-Means clustering algorithm. The clustering results are evaluated and analyzed using three-cluster evaluation indexes (SC, SP and SSE) and two-cluster similarity indexes (CI and CSI). A taxi GPS dataset and a multi-source dataset were employed to test and validate the effectiveness of the proposed algorithm in comparison to the Random Swap clustering algorithm (RS), Genetic K-means algorithm (GAK), Particle Swarm Optimization (PSO) based K-Means, PSO based constraint K-Means, PSO based Weighted K-Means, PSO-GA based K-Means and K-Means++ algorithms. The comparison findings demonstrate that the proposed algorithm can achieve better clustering results, as well as successfully acquire urban hotspots.

Classification of Acute Pathology for Vocal Cord Using Advanced Multi-Resolution Algorithm

Vocal fold, a significant body structure, is accountable for phonation, which regulates air motion within and out of the lungs. The disorders in the vocal fold influence the quality of life. Thus, diagnosis of vocal fold disorders has a significant need, and CT of the neck is employed for an effective imaging scheme. Accordingly, this paper proposes an advanced multi-resolution algorithm (MRA) that optimally identifies and classifies pathologies. The vocal regions are acquired using the genetic k-means algorithm. The pathology features are generated using the local directional pattern (LDP) fed to pathology classification using moth search-rider optimization-based deep convolutional neural networks (MRA-based DCNN). The hybrid optimization (MRA), integrates the standard rider optimization algorithm (ROA) and moth search algorithm (MS) that trains deep learning classifier (DCNN). The analysis using the real databases regarding the performance metrics divulge that the proposed pathology detection module obtained the accuracy, specificity, and sensitivity of 97.020%, 91.698%, and 96.624%.

K-Means Genetic Algorithms with Greedy Genetic Operators

The k-means problem is one of the most popular models of cluster analysis. The problem is NP-hard, and modern literature offers many competing heuristic approaches. Sometimes practical problems require obtaining such a result (albeit notExact), within the framework of the k-means model, which would be difficult to improve by known methods without a significant increase in the computation time or computational resources. In such cases, genetic algorithms with greedy agglomerative heuristic crossover operator might be a good choice. However, their computational complexity makes it difficult to use them for large-scale problems. The crossover operator which includes the k-means procedure, taking the absolute majority of the computation time, is essential for such algorithms, and other genetic operators such as mutation are usually eliminated or simplified. The importance of maintaining the population diversity, in particular, with the use of a mutation operator, is more significant with an increase in the data volume and available computing resources such as graphical processing units (GPUs). In this article, we propose a new greedy heuristic mutation operator for such algorithms and investigate the influence of new and well-known mutation operators on the objective function value achieved by the genetic algorithms for large-scale k-means problems. Our computational experiments demonstrate the ability of the new mutation operator, as well as the mechanism for organizing subpopulations, to improve the result of the algorithm.

Multiattribute Group Decision-Making Method Using a Genetic K-Means Clustering Algorithm

Multiattribute group decision-making (MAGDM) problems are characterized by the large number, uneven levels, and bounded rationality of decision-makers; multiple attributes and fuzziness of decision problems; and complex group behaviours. Considering these characteristics, we propose a MAGDM method using a genetic K-means clustering algorithm. First, we briefly review the traditional multiattribute decision-making method based on prospect theory (PT) and trapezoidal intuitionistic fuzzy numbers (TrIFNs) under the premise of human bounded rationality and uncertain decision environment. Then, the aggregation model of decision information given by decision-makers is established using the genetic K-means algorithm in order to determine optimal clustering results. Each clustering center represents decision information given by decision-makers in each cluster, and the weight of each clustering center is determined by considering the tightness of decision information within a cluster and the count of decision-makers in each cluster. Finally, the ranking of schemes is obtained according to the comparison rules of TrIFNs. We design comparison simulation experiments to test the proposed method and the simulation results demonstrate that the proposed method is apprehensible and feasible to solve MAGDM problems.

Index group optimization based on automatic clustering using K-Means genetic algorithm

E-prints UMSIDA is a repository of student and lecturer publication documents at the Muhammadiyah University of Sidoarjo (UMSIDA). The collection of documents is still random and the search can only detect from the title keywords. The increasing culture of writing and research makes it possible for more and more documents as literature. Documents in E-prints are grouped by subject provided by the repository manager and grouped by the admin who uploaded the document. Automatic document grouping can be done by grouping documents based on the contents of the document using the Information Retrieval (IR) approach. The retrieval process is carried out by document processing with tokenisation to obtain data tokens, the data tokens are processed through a stemming process to obtain the stem value of each word. The stem value is processed using the indexing process and word stem to get sentence indexes through the weighting process. The index results stored in the database become document variables that are the features or characteristics of each document. The index of all documents is grouped through Automatic Clustering technique using K-Means Genetic Algorithm.

A high-performance parallel coral reef optimization for data clustering

As a critical research topic toward the new era of big data, how to develop a high-performance data analytics system has received significant research attention from different disciplines since the 2000s. In the literature, many recent works attempted to develop a high-performance data analytics system to handle the large amount of data (i.e., volume) from different information systems (i.e., variety) that typically will be created very quickly in a short time (i.e., velocity). In particular, several recent studies have shown that metaheuristic algorithms can be applied to many data mining optimization problems to provide a better way to find a high-quality result than traditional deterministic algorithms. A high-performance clustering algorithm for big data analytics system will be presented in this paper. The proposed algorithm is designed based on a new kind of metaheuristic algorithm, coral reef optimization with substrate layers (CRO-SL), to get a better cluster result. To improve the effectiveness and efficiency, the proposed CRO-SL scheme has been applied to a cloud computing platform as well to reduce the response time of a data analytics system. The simulation results show that the proposed algorithm is able to provide a better clustering result than the other clustering algorithms compared in this research, including k-means, genetic k-means algorithm, particle swarm optimization, and simple coral reef optimization algorithm in terms of the sum of squared errors.

K-Means Clustering and Genetic Algorithm to Solve Vehicle Routing Problem with Time Windows Problem

<span lang="EN-US">Distribution is an important aspect of industrial activity to serve customers on time with minimal operational cost. Therefore, it is necessary to design a quick and accurate distribution route. One of them can be design travel distribution route using the k-means method and genetic algorithms. This research will combine k-means method and genetic algorithm to solve VRPTW problem. K-means can do clustering properly and genetic algorithms can optimize the route. The proposed genetic algorithm employs initialize chromosome from the result of k-means and using replacement method of selection. Based on the comparison between genetic algorithm and hybrid k-means genetic algorithm proves that k-means genetic algorithm is a suitable combination method with relative low computation time, are the comparison between 2700 and 3900 seconds.</span>

A Novel Bio-Inspired Algorithm Based on Social Spiders for Improving Performance and Efficiency of Data Clustering

Abstract Since the last decade, the collective intelligent behavior of groups of animals, birds or insects have attracted the attention of researchers. Swarm intelligence is the branch of artificial intelligence that deals with the implementation of intelligent systems by taking inspiration from the collective behavior of social insects and other societies of animals. Many meta-heuristic algorithms based on aggregative conduct of swarms through complex interactions with no supervision have been used to solve complex optimization problems. Data clustering organizes data into groups called clusters, such that each cluster has similar data. It also produces clusters that could be disjoint. Accuracy and efficiency are the important measures in data clustering. Several recent studies describe bio-inspired systems as information processing systems capable of some cognitive ability. However, existing popular bio-inspired algorithms for data clustering ignored good balance between exploration and exploitation for producing better clustering results. In this article, we propose a bio-inspired algorithm, namely social spider optimization (SSO), for clustering that maintains a good balance between exploration and exploitation using female and male spiders, respectively. We compare results of the proposed algorithm SSO with K means and other nature-inspired algorithms such as particle swarm optimization (PSO), ant colony optimization (ACO) and improved bee colony optimization (IBCO). We find it to be more robust as it produces better clustering results. Although SSO solves the problem of getting stuck in the local optimum, it needs to be modified for locating the best solution in the proximity of the generated global solution. Hence, we hybridize SSO with K means, which produces good results in local searches. We compare proposed hybrid algorithms SSO+K means (SSOKC), integrated SSOKC (ISSOKC), and interleaved SSOKC (ILSSOKC) with K means+PSO (KPSO), K means+genetic algorithm (KGA), K means+artificial bee colony (KABC) and interleaved K means+IBCO (IKIBCO) and find better clustering results. We use sum of intra-cluster distances (SICD), average cosine similarity, accuracy and inter-cluster distance to measure and validate the performance and efficiency of the proposed clustering techniques.

A Selection Process for Genetic Algorithm Using Clustering Analysis

This article presents a newly proposed selection process for genetic algorithms on a class of unconstrained optimization problems. The k-means genetic algorithm selection process (KGA) is composed of four essential stages: clustering, membership phase, fitness scaling and selection. Inspired from the hypothesis that clustering the population helps to preserve a selection pressure throughout the evolution of the population, a membership probability index is assigned to each individual following the clustering phase. Fitness scaling converts the membership scores in a range suitable for the selection function which selects the parents of the next generation. Two versions of the KGA process are presented: using a fixed number of clusters K (KGAf) and via an optimal partitioning Kopt (KGAo) determined by two different internal validity indices. The performance of each method is tested on seven benchmark problems.

Design of Hybridized Wireless Sensor Network using K-Means Clustering and Genetic Algorithm

Prolonging the network lifetime in wireless sensor networks (WSNs), Clustering has been recognized has one of the significant methods in achieving this, It entails grouping of sensor nodes into clusters and electing cluster heads (CHs) for all the clusters. CH’s accept data from relevant cluster’s nodes and forward the aggregate data to base station. A main challenge in WSNs is the selection of appropriate cluster heads. This work proposes a system that is efficient, scalable and load balanced. The proposed scheme combines two known algorithms namely k-means clustering and genetic algorithms based on the weaknesses identified in the two. The simulated data is obtained through the enhancement of clustering by the cluster head (base station) that helps in locating the nearest node that is important in the data transfer instead of transferring to a node that is not necessary, thereby wasting time and resources. The obtained simulation results indicate that this approach is efficient and last longer in elongating the battery life time than the conventional method by 60%.

KMGEM: Data Clustering by Combination of K-Means and Grenade Explosion Algorithm

The main purpose of using clustering techniques is to divide a dataset into a few unsupervised data analysis partitions. One of the recent and apparently one of the easiest one of them is k-means. This technique is based on square error criterion. To solve the combinatorial optimization issues in the context of clustering techniques, k-means algorithm was used recently. In spite of the fact that it has been applied to a few territories, it experiences sensitivity to initial points. There have been a few techniques that were reported beneficial for improving kmeans systems. By this paper we are trying to suggest a new algorithm which depends on an optimized clustering method. This algorithm that is called K-Means Modified Grenade Explosion Method (KMGEM) is a K-Means that initialized with Modified Grenade Explosion algorithm. The results showed that our proposed method is superior in comparison with methods like Genetic Algorithm, Genetic K-Means Algorithm, and k-means algorithms.

Evolutionary Clustering Algorithm Using Criterion-Knowledge-Ranking for Multi-objective Optimization

There are variety of methods available to solve multi-objective optimization problems, very few utilizes criterion linkage between data objects in the searching phase, to improve final result. This article proposes an evolutionary clustering algorithm for multi-objective optimization. This paper aims to identify more relevant features based on criterion knowledge from the given data sets and also adopts neighborhood learning to improve the diversity and efficacy of the algorithm. This research is an extension of the previous work named neighborhood learning using k-means genetic algorithm (FS-NLMOGA) for multi-objective optimization which maximizes the compactness of the cluster and accuracy of the solution through constrained feature selection. The proposed objective finds the closest feature subset from the selected features of the data sets that also minimizes the cost while maintains the quality of the solution. The resultant cluster were analyzed and validated using cluster validity indexes. The proposed algorithm is tested with several UCI real-life data sets. The experimental results substantiates that the algorithm is efficient and robust .

Outlier Detection Using Improved Genetic K-Means

The outlier detection problem in some cases is similar to the classification problem. For example, the main concern of clustering-based outlier detection algorithms is to find clusters and outliers, which are often regarded as noise that should be removed in order to make more reliable clustering. In this article, we present an algorithm that provides outlier detection and data clustering simultaneously. The algorithm improves the estimation of centroids of the generative distribution during the process of clustering and outlier discovery. The proposed algorithm consists of two stages. The first stage consists of improved genetic k-means algorithm (IGK) process, while the second stage iteratively removes the vectors which are far from their cluster centroids.

Feature Selection Using K-Means Genetic Algorithm for Multi-objective Optimization

Abstract Multi-objective genetic -clustering algorithms are based on optimization which optimizes several objectives simultaneously. In multi-objective optimization problem (MOP), different objective function may have different properties. In the previous paper, multi-objective optimization on neighbourhood learning using k-means genetic algorithm (NLMOGA), was proposed and applied to several real-life data sets. This research paper aims to extend NLMOGA by maximizing the compactness and the accuracy of the solution through constraint feature selection on the selected sub-population. A new population is generated using NLMOGA and a constrained feature selection is applied to each sub-population. This method is developed to determine a suitable or closest set of objects from the group objects which will improve the robustness of NLMOGA for different instances of MOPs. In NLMOGA, a solution is selected from global population repository and then neighbourhood learning is made to promote the evolution of each objective for the selected solution. The effectiveness of this approach is evaluated with various real-life benchmark gene expression data sets.

Research on Image Technology with Application of K-Means Based on Genetic Simulated Annealing Algorithm in CT Image Segmentation

Aiming at the characteristic of medical images, this paper presents the improved genetic simulated annealing algorithm with K-means clustering analysis and applies in medical CT image segmentation. This improved genetic simulated annealing algorithm can be used to globally optimize k-means image segmentation functions to solve the locality and the sensitiveness of the initial condition. It can automatically adjust the parameters of genetic algorithm according to the fitness values of individuals and the decentralizing degree of individuals of the population and keep the variety of population for rapidly converging, and it can effectively avoid appearing precocity and plunging into local optimum. The example shows that the method is feasible, and better segmentation results have got to satisfy the request for 3D reconstruction, compared with k-means image segmentation and genetic algorithm based image segmentation.

Damage Classification of Sandwich Composites Using Acoustic Emission Technique and k-means Genetic Algorithm

In this study acoustic emission (AE) technique was used for monitoring mode I delamination test of sandwich composites. Since, during mode I delamination test various damage mechanisms appear, their classification is of major importance. Hence, integration of $$k$$ -means algorithm and genetic algorithm was applied as an efficient clustering method to discriminate different failure modes. Performing primary experiments to find the relationship between AE parameters and damage mechanisms, the AE signals of obtained clusters were assigned to distinct damage mechanisms. Also, the dominance of damage mechanisms was determined based on the distribution of AE signals in different clusters. Finally SEM observation was employed to verify obtained results. The results indicate the efficiency of the proposed method in damage classification of sandwich composites.

Reporting and analyzing alternative clustering solutions by employing multi-objective genetic algorithm and conducting experiments on cancer data

Clustering is an essential research problem which has received considerable attention in the research community for decades. It is a challenge because there is no unique solution that fits all problems and satisfies all applications. We target to get the most appropriate clustering solution for a given application domain. In other words, clustering algorithms in general need prior specification of the number of clusters, and this is hard even for domain experts to estimate especially in a dynamic environment where the data changes and/or become available incrementally. In this paper, we described and analyze the effectiveness of a robust clustering algorithm which integrates multi-objective genetic algorithm into a framework capable of producing alternative clustering solutions; it is called Multi-objective K-Means Genetic Algorithm (MOKGA). We investigate its application for clustering a variety of datasets, including microarray gene expression data. The reported results are promising. Though we concentrate on gene expression and mostly cancer data, the proposed approach is general enough and works equally to cluster other datasets as demonstrated by the two datasets Iris and Ruspini. After running MOKGA, a pareto-optimal front is obtained, and gives the optimal number of clusters as a solution set. The achieved clustering results are then analyzed and validated under several cluster validity techniques proposed in the literature. As a result, the optimal clusters are ranked for each validity index. We apply majority voting to decide on the most appropriate set of validity indexes applicable to every tested dataset. The proposed clustering approach is tested by conducting experiments using seven well cited benchmark data sets. The obtained results are compared with those reported in the literature to demonstrate the applicability and effectiveness of the proposed approach.

Hybrid Modeling KMeans – Genetic Algorithms in the Health Care Data

K-Means is one of the major algorithms widely used in clustering due to its good computational performance. However, K-Means is very sensitive to the initially selected points which randomly selected, and therefore it does not always generate optimum solutions. Genetic algorithm approach can be applied to solve this problem. In this research we examine the potential of applying hybrid GA- KMeans with focus on the area of health care data. We proposed a new technique using hybrid method combining KMeans Clustering and Genetic Algorithms, called the “Hybrid K-Means Genetic Algorithms” (HKGA). HKGA combines the power of Genetic Algorithms and the efficiency of K-Means Clustering. We compare our results with other conventional algorithms and also with other published research as well. Our results demonstrate that the HKGA achieves very good results and in some cases superior to other methods.Keywords: Machine Learning, K-Means, Genetic Algorithms, Hybrid KMeans Genetic Algorithm (HGKA).

Outlier Detection using Improved Genetic K-means

The outlier detection problem in some cases is similar to the classification problem. For example, the main concern of clustering-based outlier detection algorithms is to find clusters and outliers, which are often regarded as noise that should be removed in order to make more reliable clustering. In this article, we present an algorithm that provides outlier detection and data clustering simultaneously. The algorithmimprovesthe estimation of centroids of the generative distribution during the process of clustering and outlier discovery. The proposed algorithm consists of two stages. The first stage consists of improved genetic k-means algorithm (IGK) process, while the second stage iteratively removes the vectors which are far from their cluster centroids.

Damage Characterization of Glass/Epoxy Composite Under Three-Point Bending Test Using Acoustic Emission Technique

Acoustic emission (AE) technique is an efficient non-destructive method for detection and identification of various damage mechanisms in composite materials. Discrimination of AE signals related to different damage modes is of great importance in the use of this technique. For this purpose, integration of k-means algorithm and genetic algorithm (GA) was used in this study to cluster AE events of glass/epoxy composite during three-point bending test. Performing clustering analysis, three clusters with separate frequency ranges were obtained, each one representing a distinct damage mechanism. Furthermore, time-frequency analysis of AE signals was performed based on wavelet packet transform (WPT). In order to find the dominant components associated with different damage mechanisms, the energy distribution criterion was used. The frequency ranges of the dominant components were then compared with k-means genetic algorithm (KGA) outputs. Finally, SEM observation was utilized to validate the results. The obtained results indicate good performance of the proposed methods in the damage characterization of composite materials.