Evolutionary computing based hybrid bisecting clustering algorithm for multidimensional data

Abstract

The emerging technologies and data centric applications have been becoming an integral part of business intelligence, decision process and numerous daily activities. To enable efficient pattern classification and data analysis, clustering has emerged as a potential mechanism that classifies data elements based on respective feature homogeneity. Although K-Means clustering has exhibited appreciable performance for data clustering, it suffers to enable optimal classification with high dimensional data sets. Numerous optimization efforts including genetic algorithm (GA) based clustering also require further optimization to avoid local minima issues. In this paper, an improved Canonical GA based Bisecting K-Means algorithm (CGABC) has been developed. The proposed model incorporates min-max normalization based feature normalization of the high dimensional data sets, which is followed by T-Test analysis that significantly reduces data dimensions based on feature similarity of the data elements. The fitness value has been assigned based on inter-cluster (heterogeneous distance) and within-cluster (homogeneous distance) distances. To enable optimal features and process parameter selection, particularly cluster centers information, the conventional GA has been modified by applying multistage reproduction process, enhanced crossover and mutation. By incorporating the optimized cluster center information the Bisecting K-Means clustering has been performed, which has exhibited optimal solution for highly accurate and efficient clustering with high dimensional data sets.

Improved Self-Adaptive ACS Algorithm to Determine the Optimal Number of Clusters

“…Step 5 Selection of the best ant: The best ant in the current iteration is called the best iteration solution, which produces the highest value of CH as a post-objective function by using Equation (3). The value of CH indicates the current optimal k in the current iteration.…”

“…Thus, the classification technique cannot be applied. The outcome of clusters produced is based on internal criteria, which measure the similarity of members within each cluster and among clusters [3]. Clustering methods can generally be classified into deterministic and optimization approaches.…”

Deep Learning Approaches with Optimum Alpha for Energy Usage Forecasting

“…This method rescales the data by subtracting the minimum value and dividing by the range (maximum value minus minimum value). The resulting values are then within the range of 0 to 1 [25]. Min-Max scaling preserves the relative relationships between the data points and is particularly useful when the distribution of the data is known to be bounded as in (5).…”