Abstract—Clustering is inherently a difficult problem, both with respect to the construction of adequate objective functions as well as to the optimization of the objective functions. In this paper, we suggest an objective function called the Weighted Sum Validity Function (WSVF), which is a weighted sum of the several normalized cluster validity functions. Further, we propose a Hybrid Niching Genetic Algorithm (HNGA), which can be used for the optimization of the WSVF to automatically evolve the proper number of clusters as well as appropriate partitioning of the data set. Within the HNGA, a niching method is developed to preserve both the diversity of the population with respect to the number of clusters encoded in the individuals and the...
Abstract—In this paper, we propose a novel hybrid genetic algorithm (GA) that finds a globally optim...
Throughout the years, considerable efforts made to tackle the clustering problem. Yet, because of t...
In solving the clustering problem, traditional methods, for example, the K-means algorithm and its v...
Clustering is inherently a difficult problem, both with respect to the construction of adequate obje...
Clustering is inherently a difficult problem, both with respect to the construction of adequate obje...
In this paper, we propose a novel hybrid genetic algorithm (GA) that finds a globally optimal partit...
This paper introduces a hybrid genetic algorithm that uses fuzzy c-means clustering technique as a m...
Abstract. GA-based clustering algorithms often employ either simple GA, steady state GA or their var...
In this paper the performance of genetic algorithms for solving some clustering problems is investig...
Finding optimal clusterings is a difficult task. Most clustering methods require the number of clust...
Cluster analysis aims at finding subsets (clusters) of a given set of entities, which are homogeneou...
The genetic algorithm of clustering of analysis objects in different data domains has been offered w...
Evolutionary algorithms (EAs) are random search heuristics which can solve various optimization prob...
GA-based clustering algorithms often employ either simple GA, steady state GA or their variants and ...
GA-based clustering algorithms often employ either simple GA, steady state GA or their variants and ...
Abstract—In this paper, we propose a novel hybrid genetic algorithm (GA) that finds a globally optim...
Throughout the years, considerable efforts made to tackle the clustering problem. Yet, because of t...
In solving the clustering problem, traditional methods, for example, the K-means algorithm and its v...
Clustering is inherently a difficult problem, both with respect to the construction of adequate obje...
Clustering is inherently a difficult problem, both with respect to the construction of adequate obje...
In this paper, we propose a novel hybrid genetic algorithm (GA) that finds a globally optimal partit...
This paper introduces a hybrid genetic algorithm that uses fuzzy c-means clustering technique as a m...
Abstract. GA-based clustering algorithms often employ either simple GA, steady state GA or their var...
In this paper the performance of genetic algorithms for solving some clustering problems is investig...
Finding optimal clusterings is a difficult task. Most clustering methods require the number of clust...
Cluster analysis aims at finding subsets (clusters) of a given set of entities, which are homogeneou...
The genetic algorithm of clustering of analysis objects in different data domains has been offered w...
Evolutionary algorithms (EAs) are random search heuristics which can solve various optimization prob...
GA-based clustering algorithms often employ either simple GA, steady state GA or their variants and ...
GA-based clustering algorithms often employ either simple GA, steady state GA or their variants and ...
Abstract—In this paper, we propose a novel hybrid genetic algorithm (GA) that finds a globally optim...
Throughout the years, considerable efforts made to tackle the clustering problem. Yet, because of t...
In solving the clustering problem, traditional methods, for example, the K-means algorithm and its v...