Accurate Clustering Results Research Articles

Grouping Sales Levels Smartphone Of Offline Store Using BIRCH Clustering Algorithm

From 2020 to 2024, TM_Store and Jaya Com exhibited different sales patterns based on cluster analysis using the BIRCH algorithm. The background of this research is to provide strategic insights to both stores for improving their sales performance through data analysis. The sales data used includes brand, type, month, year, stock quantity, quantity sold, unit price, and total sales. The BIRCH method was chosen for its effectiveness in handling large datasets and providing accurate clustering results. The clustering results indicate a significant increase in the "Moderate" category, from 12 sales in 2020 to 354 sales in 2023. Meanwhile, the "Very High" category also saw an increase from 5 sales in 2020 to 97 sales in 2023, with sales in the "Very Low" category remaining high at 70 sales in 2023. On the other hand, Jaya Com was dominated by the "Very High" category, with a sharp increase from 25 sales in 2020 to 597 sales in 2023. The "High" category also showed significant growth, from 6 sales in 2020 to 98 sales in 2023. This data indicates that Jaya Com focuses on high-performance products, while TM_Store shows a more balanced distribution across various sales categories. Based on the analysis, Jaya Com had 1988 data points with 1984 cluster points, whereas TM_Store had 2012 data points with 1811 cluster points. Overall, the study concludes that the BIRCH algorithm can identify significant sales patterns in both stores, aiding in the development of more effective and efficient promotional strategies tailored to each sales category's performance.

Model-Based Co-Clustering in Customer Targeting Utilizing Large-Scale Online Product Rating Networks

Given the widely available online customer ratings on products, the individual-level rating prediction and clustering of customers and products are increasingly important for sellers to create targeting strategies for expanding the customer base and improving product ratings. However, the massive missing data problem is a significant challenge for modeling online product ratings. To address this issue, we propose a new co-clustering methodology based on a bipartite network modeling of large-scale ordinal product ratings. Our method extends existing co-clustering methods by incorporating covariates and ordinal ratings in the model-based co-clustering of a weighted bipartite network. We devise an efficient variational EM algorithm for model estimation. A simulation study demonstrates that our methodology is scalable for modeling large datasets and provides accurate estimation and clustering results. We further show that our model can successfully identify different groups of customers and products with meaningful interpretations and achieve promising predictive performance in a real application for customer targeting.

Selective multiple kernel fuzzy clustering with locality preserved ensemble

Multiple kernel fuzzy clustering (MKFC) has demonstrated promising performance in capturing the non-linear relationships within data. However, its effectiveness relies heavily on the appropriate selection of the fuzzification coefficient and kernel functions. To address this challenge, this paper proposes a novel clustering ensemble approach for improving the robustness and accuracy of the MKFC algorithm. The proposed method employs a multi-objective evolutionary optimization approach to heuristically select the optimal fuzzification and kernel coefficients. By employing the selected coefficients, the MKFC algorithm generates a diverse set of accurate candidate clustering results. Subsequently, a locality preserved ensemble mechanism is introduced to derive the final partition matrix, ensuring that all candidate clusterings within the Pareto non-dominated set contribute to the final consensus matrix. Moreover, this mechanism incorporates the knowledge about the locality of the dataset via a graph regularization term, thereby further enhancing the clustering performance. Comprehensive experiments conducted on widely adopted benchmark datasets demonstrate the superiority of the proposed method over the state-of-the-art approaches.

AHA-3WKM: The optimization of K-means with three-way clustering and artificial hummingbird algorithm

Clustering, as an essential technique in unsupervised learning, plays a pivotal role in the fields of data mining and machine learning. However, the classic K-means clustering algorithm has intrinsic drawbacks such as sensitivity to initial cluster centers, susceptibility to a local optimal solution, and challenges in handling data uncertainty. To address these problems, this paper proposes an artificial hummingbird algorithm (AHA)-based three-way K-means clustering algorithm, called AHA-3WKM. First, AHA is introduced to address the problems of sensitivity to initial cluster centers and local optima. Second, a fitness function of AHA is specifically constructed to find the best initial clustering centers so that the hummingbirds can search for high-quality food sources, i.e., the global optimum cluster centers. Third, a three-way clustering approach is utilized to capture information about data uncertainty. In this way, the results of clustering are divided into three distinct regions based on the relationship between objects and clusters. The experimental results demonstrate that AHA-3WKM has good performance, and enhances the stability and the accuracy of clustering results.

Optimized diagnosis of local anomalies in charge and discharge of solar cell capacitors

BackgroundWith the increasingly serious environmental pollution and natural environment damage, renewable energy such as solar cells have gradually become the key to change this situation. Therefore, the local abnormal diagnosis of the charge and discharge of solar cell capacitors is particularly important. ObjectiveTo extend the life of ultracapacitors by resolving the issue of their low detection rate and enhancing the capacity to recognize fault diagnosis factors. A novel approach to charging and discharging, as well as the diagnosis of local anomalies, is put forth, utilizing switching networks. MethodsBy controlling the capacitors of multiple solar cells and supercapacitors to work together, it is possible to compensate for the shortage of photovoltaic power. The performance of fault diagnosis is optimized by combining principal component analysis and binary K-means clustering, which completes the fault diagnosis of capacitors. ResultsThe experimental results show that the research method can increase the maximum output power of photovoltaic by 32.9% under multi-layer shadows. In the charging state of the training set, the number of abnormal capacitors is 6, and the number of normal capacitors is 12, and both of them are in accordance with the preset value. The number of abnormal capacitors and normal capacitors in the discharge state is the same as that in the charging state, which is also 6 and 12. ConclusionThe research method can effectively address the issue of unbalanced energy storage battery packs and minimize the impact of local shadows on photovoltaic systems. In comparison to fuzzy C-means clustering, this method requires fewer iterations, enables faster fault diagnosis, and produces more accurate clustering results. It can provide technical support for diagnosing local abnormalities in the charging and discharging of solar cell capacitors.

Fuzzy C Means Clustering Coupled with Firefly Optimization Algorithm for the Segmentation of Neurodisorder Magnetic Resonance Images

Medical image segmentation is a critical task in medical image analysis, and clustering algorithms can be utilized to achieve this goal. This research work focuses on the segmentation of neuro disorder magnetic resonance images using Otsu, K-means, and FCM coupled with the firefly optimization algorithm. Otsu is a classical thresholding algorithm that relies on a single threshold value to segment the images. K-Means is one of the simplest and most widely used clustering algorithms. It aims to partition data into K clusters, where each data point belongs to the cluster with the nearest mean. Fuzzy C-Means is an extension of K-Means, allowing data points to belong to multiple clusters with varying degrees of membership. In medical image segmentation, FCM was used to classify pixels or voxels into different tissue classes with soft boundaries, accounting for partial volume effects. Firefly Optimization helps in improving the convergence speed of the FCM algorithm. Firefly optimization is good at exploring the solution space and finding global optima. The combination of FCM and Firefly Optimization leads to more accurate clustering results. The performance evaluation was done by Renyi entropy and Shannon entropy, FCM coupled with the firefly optimization was found to exhibit superior results when compared with the Otsu and K-means clustering algorithms.

Spark-Based Label Diffusion and Label Selection Community Detection Algorithm for Metagenome Sequence Clustering

It is a challenge to assemble an enormous amount of metagenome data in metagenomics. Usually, metagenome cluster sequence before assembly accelerates the whole process. In SpaRC, sequences are defined as nodes and clustered by a parallel label propagation algorithm (LPA). To address the randomness of label selection from the parallel LPA during clustering and improve the completeness of metagenome sequence clustering, Spark-based parallel label diffusion and label selection community detection algorithm is proposed in the paper to obtain more accurate clustering results. In this paper, the importance of sequence is defined based on the Jaccard similarity coefficient and its degree. The core sequence is defined as the one with the largest importance in its located community. Three strategies are formulated to reduce the randomness of label selection. Firstly, the core sequence label diffuses over its located cluster and becomes the initial label of other sequences. Those sequences that do not receive an initial label will select the sequence label with the highest importance in the neighbor sequences. Secondly, we perform improved label propagation in order of label frequency and sequence importance to reduce the randomness of label selection. Finally, a merge small communities step is added to increase the completeness of clustered clusters. The experimental results show that our proposed algorithm can effectively reduce the randomness of label selection, improve the purity, completeness, and F-Measure and reduce the runtime of metagenome sequence clustering.

Clustering single-cell multimodal omics data with jrSiCKLSNMF.

Introduction: The development of multimodal single-cell omics methods has enabled the collection of data across different omics modalities from the same set of single cells. Each omics modality provides unique information about cell type and function, so the ability to integrate data from different modalities can provide deeper insights into cellular functions. Often, single-cell omics data can prove challenging to model because of high dimensionality, sparsity, and technical noise. Methods: We propose a novel multimodal data analysis method called joint graph-regularized Single-Cell Kullback-Leibler Sparse Non-negative Matrix Factorization (jrSiCKLSNMF, pronounced "junior sickles NMF") that extracts latent factors shared across omics modalities within the same set of single cells. Results: We compare our clustering algorithm to several existing methods on four sets of data simulated from third party software. We also apply our algorithm to a real set of cell line data. Discussion: We show overwhelmingly better clustering performance than several existing methods on the simulated data. On a real multimodal omics dataset, we also find our method to produce scientifically accurate clustering results.

Adaptive Density Spatial Clustering Method Fusing Chameleon Swarm Algorithm.

The density-based spatial clustering of application with noise (DBSCAN) algorithm is able to cluster arbitrarily structured datasets. However, the clustering result of this algorithm is exceptionally sensitive to the neighborhood radius (Eps) and noise points, and it is hard to obtain the best result quickly and accurately with it. To solve the above problems, we propose an adaptive DBSCAN method based on the chameleon swarm algorithm (CSA-DBSCAN). First, we take the clustering evaluation index of the DBSCNA algorithm as the objective function and use the chameleon swarm algorithm (CSA) to iteratively optimize the evaluation index value of the DBSCAN algorithm to obtain the best Eps value and clustering result. Then, we introduce the theory of deviation in the data point spatial distance of the nearest neighbor search mechanism to assign the identified noise points, which solves the problem of over-identification of the algorithm noise points. Finally, we construct color image superpixel information to improve the CSA-DBSCAN algorithm's performance regarding image segmentation. The simulation results of synthetic datasets, real-world datasets, and color images show that the CSA-DBSCAN algorithm can quickly find accurate clustering results and segment color images effectively. The CSA-DBSCAN algorithm has certain clustering effectiveness and practicality.

GRACE: Graph autoencoder based single-cell clustering through ensemble similarity learning.

Recent advances in single-cell sequencing techniques have enabled gene expression profiling of individual cells in tissue samples so that it can accelerate biomedical research to develop novel therapeutic methods and effective drugs for complex disease. The typical first step in the downstream analysis pipeline is classifying cell types through accurate single-cell clustering algorithms. Here, we describe a novel single-cell clustering algorithm, called GRACE (GRaph Autoencoder based single-cell Clustering through Ensemble similarity larning), that can yield highly consistent groups of cells. We construct the cell-to-cell similarity network through the ensemble similarity learning framework, and employ a low-dimensional vector representation for each cell through a graph autoencoder. Through performance assessments using real-world single-cell sequencing datasets, we show that the proposed method can yield accurate single-cell clustering results by achieving higher assessment metric scores.

Research on Efficient Work Innovation Effect Evaluation Based on Real-Time Online Public Opinion Data Classification and Detection Algorithm

Various heterogeneous network resources are collected through web crawlers, and after preprocessing such as data cleaning, they are written into the data center. And implement data mining technologies such as classification, clustering, association rules and anomaly detection. If an enterprise wants to maintain a good development ability and maintain a correct development trend, it must pay attention to and do a good job in ideological and political work, and take ideological and political work as the guiding light of its own operation and development. Improved the stability and accuracy of clustering results. The news topics are clustered to form topics, and the topic tracking technology is used to track specific news topics to achieve personalized services.

Fast spectral clustering with self-adapted bipartite graph learning

Spectral Clustering (SC) is a widespread used clustering algorithm in data mining, image processing, etc. It is a graph-based algorithm capable of handling arbitrarily distributed data. However, the distances of all samples in the high-dimensional space tend to be equal, so the similarity matrix of SC may not be reasonable in high-dimensional data. In addition, the similarity matrix and clustering results in SC are performed in two steps. To solve these problems, a novel joint clustering method called fast spectral clustering with self-adapted bipartite graph learning (FSBGL), is proposed. It is capable of obtaining low-dimensional representations from high dimensional data, thus decreasing the complexity and increase the efficiency of the algorithm. In contrast to traditional spectral clustering algorithms that obtain clustering results in a two-step process, FSBGL obtains clustering results directly from the concatenated components of the optimized similarity matrix while learning the optimized bipartite graph. This eliminates the effect of performing these two steps separately in SC. In effect, a more discriminative low-dimensional representation may be derived from the adaptively learned bipartite graph, while the better low-dimensional representation can continue to be used to learn the structure of the graph. The learning of the bipartite graph alternates with the iteration of the low-dimensional representation, which allows the algorithm to obtain more accurate clustering results. Furthermore, by means of a low-dimensional representation on the basis of fast spectral embedding, the algorithm has better performance on some large-scale datasets. The results of the experiment indicate that the FSBGL is better than other comparative methods in various data sets.

K-sets and k-swaps algorithms for clustering sets

We present two new clustering algorithms called k-sets and k-swaps for data where each object is a set. First, we define the mean of the sets in a cluster, and the distance between a set and the mean. We then derive the k-sets algorithm from the principles of classical k-means so that it repeats the assignment and update steps until convergence. To the best of our knowledge, the proposed algorithm is the first k-means based algorithm for this kind of data. We adopt the idea also into random swap algorithm, which is a wrapper around the k-means that avoids local minima. This variant is called k-swaps. We show by experiments that this algorithm provides more accurate clustering results than k-medoids and other competitive methods.

Multi-Scale Massive Points Fast Clustering Based on Hierarchical Density Spanning Tree

Spatial clustering is dependent on spatial scales. With the widespread use of web maps, a fast clustering method for multi-scale spatial elements has become a new requirement. Therefore, to cluster and display elements rapidly at different spatial scales, we propose a method called Multi-Scale Massive Points Fast Clustering based on Hierarchical Density Spanning Tree. This study refers to the basic principle of Clustering by Fast Search and Find of Density Peaks aggregation algorithm and introduces the concept of a hierarchical density-based spanning tree, combining the spatial scale with the tree links of elements to propose the corresponding pruning strategy, and finally realizes the fast multi-scale clustering of elements. The first experiment proved the time efficiency of the method in obtaining clustering results by the distance-scale adjustment of parameters. Accurate clustering results were also achieved. The second experiment demonstrated the feasibility of the method at the aggregation point element and showed its visual effect. This provides a further explanation for the application of tree-link structures.

Automatic Clustering of Indoor Area Features in Shopping Malls

The comprehensive expression of indoor maps directly affects the visualization effect of the map and the user’s map reading experience. Currently, only the points, lines, and polygons of outdoor maps are used as objects of cartographic generalization. Therefore, this study considers indoor map area features as generalization objects and deems the automatic clustering of the indoor area features of shopping malls as the research goal. The approach is used to construct an encoder-decoder clustering model, where the encoder consists of a graph convolutional network and its variant models. The results show that the proposed model framework effectively extracts the area features suitable for the indoor space clustering of shopping malls and improves clustering efficacy. Specifically, the model with the Relational Graph Convolutional Network as the encoder demonstrated the best performance, time complexity, and accuracy of clustering results, with accuracy up to 95%. This study extends the research object of cartographic generalization to indoor maps, enabling the automatic clustering of indoor area features, and proposes a clustering model for the important indoor scene of shopping malls. This is valuable for scholars interested in the cartographic generalization of indoor maps.

Functional clustering on a sphere via Riemannian functional principal components

We propose the functional clustering algorithm applicable to the sphere‐valued random curves, called ‐centres Riemannian functional clustering (kCRFC). It is based on Riemannian functional principal component scores and ‐centres functional clustering algorithm; thus, we can obtain accurate clustering results by reflecting the geometry of the sphere. Our method shows better clustering performances than existing multivariate functional clustering methods in various simulation settings. We apply the proposed method to the migration trajectories of Egyptian Vultures in the Middle East and East Africa and fruit fly behaviours, containing the curves lied on two‐dimensional and three‐dimensional sphere, respectively.

Fast subspace clustering by learning projective block diagonal representation

Block Diagonal Representation (BDR) has attracted massive attention in subspace clustering, yet the high computational cost limits its widespread application. To address this issue, we propose a novel approach called Projective Block Diagonal Representation (PBDR), which rapidly pursues a representation matrix with the block diagonal structure. Firstly, an effective sampling strategy is utilized to select a small subset of the original large-scale data. Then, we learn a projection mapping to match the block diagonal representation matrix on the selected subset. After training, we employ the learned projection mapping to quickly generate the representation matrix with an ideal block diagonal structure for the original large-scale data. Additionally, we further extend the proposed PBDR model (i.e., PBDRℓ1 and PBDR*) by capturing the global or local structure of the data to enhance block diagonal coding capability. This paper also proves the effectiveness of the proposed model theoretically. Especially, this is the first work to directly learn a representation matrix with a block diagonal structure to handle the large-scale subspace clustering problem. Finally, experimental results on publicly available datasets show that our approaches achieve faster and more accurate clustering results compared to the state-of-the-art block diagonal-based subspace clustering approaches, which demonstrates its practical usefulness.

Effectively Clustering Single Cell RNA Sequencing Data by Sparse Representation.

Clustering analysis has been widely used in analyzing single-cell RNA-sequencing (scRNA-seq) data to study various biological problems at cellular level. Although a number of scRNA-seq data clustering methods have been developed, most of them evaluate the similarity of pairwise cells while ignoring the global relationships among cells, which sometimes cannot effectively capture the latent structure of cells. In this paper, we propose a new clustering method SPARC for scRNA-seq data. The most important feature of SPARC is a novel similarity metric that uses the sparse representation coefficients of each cell in terms of the other cells to measure the relationships among cells. In addition, we develop an outlier detection method to help parameter selection in SPARC. We compare SPARC with nine existing scRNA-seq data clustering methods on twelve real datasets. Experimental results show that SPARC achieves the state of the art performance. By further analyzing the cell similarity data derived from sparse representations, we find that SPARC is much more effective in mining high quality clusters of scRNA-seq data than two traditional similarity metrics. In conclusion, this study provides a new way to effectively cluster scRNA-seq data and achieves more accurate clustering results than the state of art methods.

Application of Statistical K-Means Algorithm for University Academic Evaluation.

With the globalization of higher education, academic evaluation is increasingly valued by the scientific and educational circles. Although the number of published papers of academic evaluation methods is increasing, previous research mainly focused on the method of assigning different weights for various indicators, which can be subjective and limited. This paper investigates the evaluation of academic performance by using the statistical K-means (SKM) algorithm to produce clusters. The core idea is mapping the evaluation data from Euclidean space to Riemannian space in which the geometric structure can be used to obtain accurate clustering results. The method can adapt to different indicators and make full use of big data. By using the K-means algorithm based on statistical manifolds, the academic evaluation results of universities can be obtained. Furthermore, through simulation experiments on the top 20 universities of China with the traditional K-means, GMM and SKM algorithms, respectively, we analyze the advantages and disadvantages of different methods. We also test the three algorithms on a UCI ML dataset. The simulation results show the advantages of the SKM algorithm.

Fast Fuzzy Clustering Based on Anchor Graph

Fuzzy clustering is one of the most popular clustering approaches and has attracted considerable attention in many fields. However, high computational cost has become a bottleneck which limits its applications in large-scale problems. Moreover, most fuzzy clustering algorithms are sensitive to noise. To address these issues, a novel fuzzy clustering algorithm, called fast fuzzy clustering based on anchor graph (FFCAG), is proposed. The FFCAG algorithm integrates anchor-based similarity graph construction and membership matrix learning into a unified framework, such that the prior knowledge of anchors can be further utilized to improve clustering performance. Specifically, FFCAG first constructs an anchor-based similarity graph with a parameter-free neighbor assignment strategy. Then, it designs a quadratic programming model to learn the membership matrix of anchors, which is very different from traditional fuzzy clustering algorithms. More importantly, a novel balanced regularization term is introduced into the objective function to produce more accurate clustering results. Finally, we adopt an alternating optimization algorithm with guaranteed convergence to solve the proposed method. Experimental results performed on synthetic and real-world datasets demonstrate the proposed FFCAG can significantly reduce the computational time with comparable, even superior, clustering performance, compared with state-of-the-art algorithms.