A hybrid clustering technique combining a novel genetic algorithm with K-Means

Boosting k-means clustering with symbiotic organisms search for automatic clustering problems

Kmeans clustering algorithm is an iterative unsupervised learning algorithm that tries to partition the given dataset into k pre-defined distinct non-overlapping clusters where each data point belongs to only one group. However, its performance is affected by its sensitivity to the initial cluster centroids with the possibility of convergence into local optimum and specification of cluster number as the input parameter. Recently, the hybridization of metaheuristics algorithms with the K-Means algorithm has been explored to address these problems and effectively improve the algorithm’s performance. Nonetheless, most metaheuristics algorithms require rigorous parameter tunning to achieve an optimum result. This paper proposes a hybrid clustering method that combines the well-known symbiotic organisms search algorithm with K-Means using the SOS as a global search metaheuristic for generating the optimum initial cluster centroids for the K-Means. The SOS algorithm is more of a parameter-free metaheuristic with excellent search quality that only requires initialising a single control parameter. The performance of the proposed algorithm is investigated by comparing it with the classical SOS, classical K-means and other existing hybrids clustering algorithms on eleven (11) UCI Machine Learning Repository datasets and one artificial dataset. The results from the extensive computational experimentation show improved performance of the hybrid SOSK-Means for solving automatic clustering compared to the standard K-Means, symbiotic organisms search clustering methods and other hybrid clustering approaches.

A Differential Evolution Algorithm With Adaptive Niching and K-Means Operation for Data Clustering

Clustering, as an important part of data mining, is inherently a challenging problem. This article proposes a differential evolution algorithm with adaptive niching and k -means operation (denoted as DE_ANS_AKO) for partitional data clustering. Within the proposed algorithm, an adaptive niching scheme, which can dynamically adjust the size of each niche in the population, is devised and integrated to prevent premature convergence of evolutionary search, thus appropriately searching the space to identify the optimal or near-optimal solution. Furthermore, to improve the search efficiency, an adaptive k -means operation has been designed and employed at the niche level of population. The performance of the proposed algorithm has been evaluated on synthetic as well as real datasets and compared with related methods. The experimental results reveal that the proposed algorithm is able to reliably and efficiently deliver high quality clustering solutions and generally outperforms related methods implemented for comparisons.

Integrating the Eigendecomposition Approach and k-Means Clustering for Inferring Building Functions with Location-Based Social Media Data

Understanding the relationship between human activity patterns and urban spatial structure planning is one of the core research topics in urban planning. Since a building is the basic spatial unit of the urban spatial structure, identifying building function types, according to human activities, is essential but challenging. This study presented a novel approach that integrated the eigendecomposition method and k-means clustering for inferring building function types according to location-based social media data, Tencent User Density (TUD) data. The eigendecomposition approach was used to extract the effective principal components (PCs) to characterize the temporal patterns of human activities at building level. This was combined with k-means clustering for building function identification. The proposed method was applied to the study area of Tianhe district, Guangzhou, one of the largest cities in China. The building inference results were verified through the random sampling of AOI data and street views in Baidu Maps. The accuracy for all building clusters exceeded 83.00%. The results indicated that the eigendecomposition approach is effective for revealing the temporal structure inherent in human activities, and the proposed eigendecomposition-k-means clustering approach is reliable for building function identification based on social media data.

K-Means-Based Nature-Inspired Metaheuristic Algorithms for Automatic Data Clustering Problems: Recent Advances and Future Directions

K-means clustering algorithm is a partitional clustering algorithm that has been used widely in many applications for traditional clustering due to its simplicity and low computational complexity. This clustering technique depends on the user specification of the number of clusters generated from the dataset, which affects the clustering results. Moreover, random initialization of cluster centers results in its local minimal convergence. Automatic clustering is a recent approach to clustering where the specification of cluster number is not required. In automatic clustering, natural clusters existing in datasets are identified without any background information of the data objects. Nature-inspired metaheuristic optimization algorithms have been deployed in recent times to overcome the challenges of the traditional clustering algorithm in handling automatic data clustering. Some nature-inspired metaheuristics algorithms have been hybridized with the traditional K-means algorithm to boost its performance and capability to handle automatic data clustering problems. This study aims to identify, retrieve, summarize, and analyze recently proposed studies related to the improvements of the K-means clustering algorithm with nature-inspired optimization techniques. A quest approach for article selection was adopted, which led to the identification and selection of 147 related studies from different reputable academic avenues and databases. More so, the analysis revealed that although the K-means algorithm has been well researched in the literature, its superiority over several well-established state-of-the-art clustering algorithms in terms of speed, accessibility, simplicity of use, and applicability to solve clustering problems with unlabeled and nonlinearly separable datasets has been clearly observed in the study. The current study also evaluated and discussed some of the well-known weaknesses of the K-means clustering algorithm, for which the existing improvement methods were conceptualized. It is noteworthy to mention that the current systematic review and analysis of existing literature on K-means enhancement approaches presents possible perspectives in the clustering analysis research domain and serves as a comprehensive source of information regarding the K-means algorithm and its variants for the research community.

Gene Expression Analysis through Parallel Non-Negative Matrix Factorization

Genetic expression analysis is a principal tool to explain the behavior of genes in an organism when exposed to different experimental conditions. In the state of art, many clustering algorithms have been proposed. It is overwhelming the amount of biological data whose high-dimensional structure exceeds mostly current computational architectures. The computational time and memory consumption optimization actually become decisive factors in choosing clustering algorithms. We propose a clustering algorithm based on Non-negative Matrix Factorization and K-means to reduce data dimensionality but whilst preserving the biological context and prioritizing gene selection, and it is implemented within parallel GPU-based environments through the CUDA library. A well-known dataset is used in our tests and the quality of the results is measured through the Rand and Accuracy Index. The results show an increase in the acceleration of 6.22× compared to the sequential version. The algorithm is competitive in the biological datasets analysis and it is invariant with respect to the classes number and the size of the gene expression matrix.

Enhancing web search result clustering model based on multiview multirepresentation consensus cluster ensemble (mmcc) approach

Existing text clustering methods utilize only one representation at a time (single view), whereas multiple views can represent documents. The multiview multirepresentation method enhances clustering quality. Moreover, existing clustering methods that utilize more than one representation at a time (multiview) use representation with the same nature. Hence, using multiple views that represent data in a different representation with clustering methods is reasonable to create a diverse set of candidate clustering solutions. On this basis, an effective dynamic clustering method must consider combining multiple views of data including semantic view, lexical view (word weighting), and topic view as well as the number of clusters. The main goal of this study is to develop a new method that can improve the performance of web search result clustering (WSRC). An enhanced multiview multirepresentation consensus clustering ensemble (MMCC) method is proposed to create a set of diverse candidate solutions and select a high-quality overlapping cluster. The overlapping clusters are obtained from the candidate solutions created by different clustering methods. The framework to develop the proposed MMCC includes numerous stages: (1) acquiring the standard datasets (MORESQUE and Open Directory Project-239), which are used to validate search result clustering algorithms, (2) preprocessing the dataset, (3) applying multiview multirepresentation clustering models, (4) using the radius-based cluster number estimation algorithm, and (5) employing the consensus clustering ensemble method. Results show an improvement in clustering methods when multiview multirepresentation is used. More importantly, the proposed MMCC model improves the overall performance of WSRC compared with all single-view clustering models.

Bottleneck prediction of urban road network based on improved PSO algorithms and fuzzy control

Traffic bottleneck refers to the road section or node that often causes the propagation or spread of traffic congestion in the road network, which is the source of the whole road network congestion. In this paper, the author analyzes the bottleneck prediction of urban road network based on improved PSO algorithms and fuzzy control. This paper analyzes the factors and characteristics of the main road of the system, proposes the traffic coordination control of the main road based on the delay model, and carries on the statistical simulation to the actual traffic data, develops the basic theory of the traffic coordination control which is more effective than the traditional timing control strategy. Compared with the traditional model, the algorithm considers the waiting time of the red light at the intersection. For the congested road section, it can better calculate the travel time of the vehicle, making the results more accurate and more applicable. The results of this study can provide a strong theoretical basis and prediction scheme for the traffic management and control of the road network in the target area.

Analysis of athletes’ stadium stress source based on improved layered K-means algorithm

Most of the research on stressors is in the medical field, and there are few analysis of athletes’ stressors, so it can not provide reference for the analysis of athletes’ stressors. Based on this, this study combines machine learning algorithms to analyze the pressure source of athletes’ stadium. In terms of data collection, it is mainly obtained through questionnaire survey and interview form, and it is used as experimental data after passing the test. In order to improve the performance of the algorithm, this paper combines the known K-Means algorithm with the layering algorithm to form a new improved layered K-Means algorithm. At the same time, this paper analyzes the performance of the improved hierarchical K-Means algorithm through experimental comparison and compares the clustering results. In addition, the analysis system corresponding to the algorithm is constructed based on the actual situation, the algorithm is applied to practice, and the user preference model is constructed. Finally, this article helps athletes find stressors and find ways to reduce stressors through personalized recommendations. The research shows that the algorithm of this study is reliable and has certain practical effects and can provide theoretical reference for subsequent related research.

Pruning High-Similarity Clusters to Optimize Data Diversity when Building Ensemble Classifiers

Diversity is a key component for building a successful ensemble classifier. One approach to diversifying the base classifiers in an ensemble classifier is to diversify the data they are trained on. While sampling approaches such as bagging have been used for this task in the past, we argue that since they maintain the global distribution, they do not create diversity. Instead, we make a principled argument for the use of [Formula: see text]-means clustering to create diversity. Expanding on previous work, we observe that when creating multiple clusterings with multiple [Formula: see text] values, there is a risk of different clusterings discovering the same clusters, which would in turn train the same base classifiers. This would bias the ensemble voting process. We propose a new approach that uses the Jaccard Index to detect and remove similar clusters before training the base classifiers, not only saving computation time, but also reducing classification error by removing repeated votes. We empirically demonstrate the effectiveness of the proposed approach compared to the state of the art on 19 UCI benchmark datasets.

Cellular Automata Based Model for E-Healthcare Data Analysis

E-healthcare is warm area of research and a number of algorithms have been applied to classify healthcare data. In the healthcare field, a large amount of clinical data is generated through MRI, CT scans, and other diagnostic tools. Healthcare analytics are used to analyze the clinical data of patient records, disease diagnosis, cost, hospital management, etc. Analytical techniques and data visualization are used to get the real time information. Further, this information can be used for decision making. Also, this information is useful for the better treatment of patients. In this work, an improved big bang-big crunch (BB-BC) based clustering algorithm is applied to analyze healthcare data. Cluster analysis is an important task in the field of data analysis and can be used to understand the organization of data. In this work, two healthcare datasets, CMC and cancer, are used and the proposed algorithm obtains better results when compared to MEBB-BC, BB-BC, GA, PSO and K-means algorithms. The performance of the improved BB-BC algorithm is also examined against benchmark clustering datasets. The simulation results showed that proposed algorithm improves the clustering results significantly when compared to other algorithms.

A novel unsupervised change detection approach based on reconstruction independent component analysis and ABC-Kmeans clustering for environmental monitoring

In this paper, I propose a new unsupervised change detection method for optical satellite imagery. The proposed technique consists of three phases. In the first stage, difference images are calculated using four different functions. Two of the functions were first used in this study. In the second stage, using Reconstruction Independent Component Analysis, this four-difference matrix is projected to one feature. In the last stage, clustering is performed. Kmeans tuned by Artificial Bee Colony (ABC-Kmeans) clustering technique has been developed and proposed by following a different strategy in the clustering phase. The effectiveness of the proposed approach was examined using two different datasets, Sardinia and Mexico. Quantitative evaluation was performed in two stages. In the first stage, proposed method was compared with different unsupervised change detection algorithms using False Alarm, Missed Alarm, Total Error, and Total Error Rate metrics which are calculated using ground truth image in dataset. In the second experimental study, the proposed approach is compared in detail with PCA-Kmeans approach, which is quite often preferred for similar studies, using the Mean Squared Error, Peak Signal to Noise Ratio, Structural Similarity Index, and Universal Image Quality Index metrics. According to quantitative and qualitative analysis, proposed approach can produce quite successful results using optical remote sensing data.

Detecting and Learning Unknown Fault States by Automatically Finding the Optimal Number of Clusters for Online Bearing Fault Diagnosis

This paper proposes an online fault diagnosis system for bearings that detect emerging fault modes and then updates the diagnostic system knowledge (DSK) to incorporate information about the newly detected fault modes. New fault modes are detected using k-means clustering along with a new cluster evaluation method, i.e., multivariate probability density function’s cluster distribution factor (MPDFCDF). In this proposed model, a heterogeneous pool of features is constructed from the signal. A hybrid feature selection model is adopted for selecting optimal feature for learning the model with existing fault mode. The proposed online fault diagnosis system detects new fault modes from unknown signals using k-means clustering with the help of proposed MPDFCDF cluster evaluation method. The DSK is updated whenever new fault modes are detected and updated DSK is used to classify faults using the k-nearest neighbor (k-NN) classifier. The proposed model is evaluated using acoustic emission signals acquired from low-speed rolling element bearings with different fault modes and severities under different rotational speeds. Experimental results present that the MPDFCDF cluster evaluation method can detect the optimal number of fault clusters, and the proposed online diagnosis model can detect newly emerged faults and update the DSK effectively, which improves the diagnosis performance in terms of the average classification performance.

Overlapping clustering of gene expression data using penalized weighted normalized cut

Clustering has been widely conducted in the analysis of gene expression data. For complex diseases, it has played an important role in identifying unknown functions of genes, serving as the basis of other analysis, and others. A common limitation of most existing clustering approaches is to assume that genes are separated into disjoint clusters. As genes often have multiple functions and thus can belong to more than one functional cluster, the disjoint clustering results can be unsatisfactory. In addition, due to the small sample sizes of genetic profiling studies and other factors, there may not be sufficient evidence to confirm the specific functions of some genes and cluster them definitively into disjoint clusters. In this study, we develop an effective overlapping clustering approach, which takes account into the multiplicity of gene functions and lack of certainty in practical analysis. A penalized weighted normalized cut (PWNCut) criterion is proposed based on the NCut technique and an <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:msub><mml:mi>L</mml:mi> <mml:mn>2</mml:mn></mml:msub> </mml:math> norm constraint. It outperforms multiple competitors in simulation. The analysis of the cancer genome atlas (TCGA) data on breast cancer and cervical cancer leads to biologically sensible findings which differ from those using the alternatives. To facilitate implementation, we develop the function pwncut in the R package NCutYX.