Clustering Results Research Articles

Fast adaptively balanced min-cut clustering

Min-cut clustering is a typical graph clustering method, which has been extensively applied for pattern recognition, data analysis and image processing. However, min-cut has trivial solutions, which leads to skewed clustering performance. Spectral clustering (SC) alleviates this by relaxing indicator matrix into continuous embedding and then discretizes the embedding. However, there are two primary challenges in SC, which are high computational complexity and two-stage process. To resolve these issues, a fast adaptively balanced min-cut clustering model (FBMC) is proposed, which directly solves the discrete indicator matrix without any post-processing. We utilize the bipartite graph to accelerate the construction of affinity graph and process of optimization. Besides, the balance factors are added in the model, which could alleviate skewed clustering results. Two specific methods are proposed, in which one adds a balance factor to all clusters while the other assigns balance factors to each cluster separately, referred to as FBMC1 and FBMC2. What is more, a one-step optimization is proposed to solve FBMC1 and FBMC2, the complexity of which is linear of time. Finally, comprehensive experiments results highlight the superior performance of our proposed method.

CSMDC: Exploring consistently context semantics for multi-view document clustering

Multi-view document clustering, which aims to discover clustering partitions based on multiple document views, has attracted increasing research interest. However, the potential advantages of incorporating context semantics to enhance multi-view document clustering are yet to be fully explored. To address the above limitation, we propose a deep multi-view document clustering model that explores consistent context semantics called CSMDC which consists of three modules. Specifically, a novel view-translator is designed to convert non-contextual document views into contextual views. With its help, all document views can be processed to obtain their semantic representations within the view-translator representation learning module. Then the data-based view consistency self-supervising module is developed to fine-tune the semantic representations of document views by jointly incorporating view-wise representation relevance and consistent clustering assignments. Additionally, the task-based document clustering module is employed to simultaneously improve the view semantic representations and document clustering results. To the best of our knowledge, this is the first study to explicitly apply consistent context semantics under the guidance of data-based and task-based objectives in multi-view document clustering. Comprehensive experimental results demonstrated the effectiveness of the proposed model.

EVALUATION OF VARIOUS COTTON GENOTYPES THROUGH GENETIC DIVERSITY ANALYSIS

Fifty-two varieties/strains of cotton were studied to explore the genetic divergence in the yield trials at Cotton Research Station, Faisalabad. The study aimed to identify strains with earliness, CLCuD tolerance, and superior yield with better fiber quality. Correlation analysis showed significant positive association of seed cotton yield (SCY) with boll number, boll weight(g), ginning out turn (GOT) and fiber length, while significant negative association with leaf curl disease and first flower appearance date was observed. Principal components analysis revealed that four out of 11 principal component showed Eigen value ˃1. The contribution of these PCs towards total variability was 76.8% with PC-1 with maximum (44.4%), followed by PC-2 (12.2%), PC-3 (10.9 %) and PC-4 (9.3%). Traits including yield, bolls number, boll weight and plant height exhibited noteworthy positive factor loading in PC-1, while cotton leaf curl virus, days to first boll opening and first flower had maximum negative loadings. The findings of cluster analysis indicated that the genotypes present in cluster V (FH-1131, FH-1133, FH-1214, FH-525, FH-453, FH-333, FH-1132, FH-1135, FH-416, FH-1134 and FH-938) have excellent combination of all desirable traits viz., earliness, fiber quality, seed cotton yield (SCY) and its contributing traits. As apparent from the results of cluster and principal components analyses, topmost genotypes based on genetic divergence data may also be tested in provincial and national yield trials because they have combination of better yield and quality parameters.

Customer Segmentation Using the K-means Clustering Algorithm and Recency Frequency Monetary Model at Pharmaceutical Product Wholesaler

PT Kimia Farma Trading and Distribution (KFTD) is a company engaged in the distribution and trading services of Indonesian health products, on a national scale. In 2022, the company aims to increase sales to be awarded as one of the top 3 national pharmaceutical product distributors by 2024. Their current strategy is to provide customers with delayed payment permission and integrated complaint services. However, the offers and services are the same for all customers which does not consider customer track record hence it is not cost-effective. One way to increase sales is by enhancing customer satisfaction and loyalty by implementing Customer Relationship Management (CRM) strategies. Several strategies can be carried out, namely analysis of associations related to pharmaceutical products, and analysis of customer segmentation and clustering of products. The method used in this study was the K-means clustering algorithm combined with the Recency Frequency Monetary (RFM) model. Experiments showed that the optimal clustering results are 4 therefore they are categorized into 4 customer segments, namely Superstar, Golden, Typical, and Occasional Customers.

Constrained Density-Based Spatial Clustering of Applications with Noise (DBSCAN) using hyperparameter optimization

This article proposes a hyperparameter optimization method for density-based spatial clustering of applications with noise (DBSCAN) with constraints, termed HC-DBSCAN. While DBSCAN is effective at creating non-convex clusters, it cannot limit the number of clusters. This limitation is difficult to address with simple adjustments or heuristic methods. We approach constrained DBSCAN as an optimization problem and solve it using a customized alternating direction method of multipliers Bayesian optimization (ADMMBO). Our custom ADMMBO enables HC-DBSCAN to reuse clustering results for enhanced computational efficiency, handle integer-valued parameters, and incorporate constraint functions that account for the degree of violations to improve clustering performance. Furthermore, we propose an evaluation metric, penalized Davies–Bouldin score, with a computational cost of O(N). This metric aims to mitigate the high computational cost associated with existing metrics and efficiently manage noise instances in DBSCAN. Numerical experiments demonstrate that HC-DBSCAN, equipped with the proposed metric, generates high-quality non-convex clusters and outperforms benchmark methods on both simulated and real datasets.

Improved Cell Allocation Strategies Using K-Means Clustering in Congested 6TiSCH Environments.

The 6TiSCH protocol (IEEE 802.15.4e) is crucial for the Industrial Internet of Things (IIoT), utilizing a time-slotted channel hopping (TSCH) mode based on node distribution. In this study, we propose an innovative cell allocation strategy based on node position clustering using the K-means algorithm, specifically designed to address congestion and optimize resource distribution in the 6TiSCH network. Our mechanism effectively groups nodes into clusters, allowing for dynamic adjustment of cell capacities in congested areas by analyzing traffic patterns and the spatial distribution of nodes. This clustering approach enhances the efficiency of slot frame utilization and minimizes communication delays by reducing interference and improving routing stability. The proposed strategy leverages the clustering results to improve cell usage efficiency and reduce communication latency between nodes. By tailoring cell allocation to the specific traffic needs of each cluster, we significantly reduce packet loss, manage congestion more effectively, and enhance data transmission reliability. We evaluated the clustering method using the K-means algorithm through experiments with the 6TiSCH simulator. Additionally, we considered using objective functions in Routing Protocol for Low-Power and Lossy Networks (RPL), such as OF0 and MRHOF, to assess clustering results and their impact on throughput and packet delivery. Our method resulted in significantly improved average performance metrics. Under the OF0 routing protocol, we achieved a 30.01% latency reduction, a 15.95% faster joining time, an 8% higher packet delivery ratio, and a 13.82% throughput increase. Similarly, we observed a 12.34% improvement in packet delivery ratio, 21.06% latency reduction, 12.68% faster joining time, and 25.97% higher throughput speed with the MRHOF routing protocol. These findings highlight the effectiveness of the improved cell allocation strategy in congested 6TiSCH environments, offering a better solution for enhancing network performance in IIoT applications.

Grid-Based DBSCAN Clustering Accelerator for LiDAR’s Point Cloud

Autonomous robots operate on batteries, rendering power efficiency essential. The substantial computational demands of object detection present a significant burden to the low-power cores employed in these robots. Therefore, we propose a grid-based density-based spatial clustering of applications with a noise (DBSCAN) clustering accelerator for light detection and ranging (LiDAR)’s point cloud to accelerate computational speed and alleviate the operational burden on low-power cores. The proposed method for DBSCAN clustering leverages the characteristics of LiDAR. LiDAR has fixed positions where light is emitted, and the number of points measured per frame is also fixed. These characteristics make it possible to impose grid-based DBSCAN on clustering a LiDAR’s point cloud, mapping the positions and indices where light is emitted to a 2D grid. The designed accelerator with the proposed method lowers the time complexity from O(n2) to O(n). The designed accelerator was implemented on a field programmable gate array (FPGA) and verified by comparing clustering results, speeds, and power consumption across various devices. The implemented accelerator speeded up clustering speeds by 9.54 and 51.57 times compared to the i7-12700 and Raspberry Pi 4, respectively, and recorded a 99% reduction in power consumption compared to the Raspberry Pi 4. Comparisons of clustering results also confirmed that the proposed algorithm performed clustering with high visual similarity. Therefore, the proposed accelerator with a low-power core successfully accelerated speed, reduced power consumption, and effectively conducted clustering.

The genome of Eleocharis vivipara elucidates the genetics of C3-C4 photosynthetic plasticity and karyotype evolution in the Cyperaceae.

Eleocharis vivipara, an amphibious sedge in the Cyperaceae family, has several remarkable properties, most notably its alternate use of C3 photosynthesis underwater and C4 photosynthesis on land. However, the absence of genomic data has hindered its utility for evolutionary and genetic research. Here, we present a high-quality genome for E. vivipara, representing the first chromosome-level genome for the Eleocharis genus, with an approximate size of 965.22 Mb mainly distributed across 10 chromosomes. Its Hi-C pattern, chromosome clustering results, and one-to-one genome synteny across two subgroups indicates a tetraploid structure with chromosome count 2n = 4x = 20. Phylogenetic analysis suggests that E. vivipara diverged from Cyperus esculentus approximately 32.96 million years ago (Mya), and underwent a whole-genome duplication (WGD) about 3.5 Mya. Numerous fusion and fission events were identified between the chromosomes of E. vivipara and its close relatives. We demonstrate that E. vivipara has holocentromeres, a chromosomal feature which can maintain the stability of such chromosomal rearrangements. Experimental transplantation and cross-section studies showed its terrestrial culms developed C4 Kranz anatomy with increased number of chloroplasts in the bundle sheath (BS) cells. Gene expression and weighted gene co-expression network analysis (WGCNA) showed overall elevated expression of core genes associated with the C4 pathway, and significant enrichment of genes related to modified culm anatomy and photosynthesis efficiency. We found evidence of mixed nicotinamide adenine dinucleotide - malic enzyme and phosphoenolpyruvate carboxykinase type C4 photosynthesis in E. vivipara, and hypothesize that the evolution of C4 photosynthesis predates the WGD event. The mixed type is dominated by subgenome A and supplemented by subgenome B. Collectively, our findings not only shed light on the evolution of E. vivipara and karyotype within the Cyperaceae family, but also provide valuable insights into the transition between C3 and C4 photosynthesis, offering promising avenues for crop improvement and breeding.

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.

K-Means text clustering method based on Decision Grey Wolf Optimization

Aiming at the problem that the traditional algorithm is easy to fall into local optimum in the process of text clustering, which leads to inaccurate text clustering results, a text clustering method based on decision grey wolf optimization K-Means is proposed to cluster the text data set and the standard UCI data set respectively. Afterword segmentation, stop words removal, feature extraction, and text vectorization of text data, the powerful optimization ability of the Decision Gray Wolf Optimization (DGWO) algorithm is used for global optimization, and the clustering center in K-Means algorithm is replaced by the location of wolves. The position of the wolf group is updated by iterative optimization to obtain the optimal clustering center, to perform text clustering. The experimental results show that compared with the traditional method, the precision, recall, and F-Measure of the text data clustering are improved by 49.22%, 51.15%, and 48.98% respectively. The precision, recall, and F-Measure of UCI data clustering are increased by 23.92%, 25.40%, and 24.70% respectively, and the text clustering results are more reliable.

Adaptive channel-weight dual-constrained semi-supervised EEG clustering

When processing Electroencephalography(EEG) for applications such as brain disease diagnosis, rehabilitation, and brain–computer interfaces, we encounter challenges related to missing labels or incorrect annotations. These challenges may arise from subjective factors, technical limitations, or data quality issues. In traditional EEG processing, unsupervised clustering algorithms are commonly used; however, due to the lack of labels, these methods may struggle to fully leverage latent information, resulting in uncertainty and instability in clustering outcomes. To address this issue, we propose a semi-supervised clustering method tailored for partially labeled EEG signals, named Adaptive Channel-weight Dual-constrained Semi-supervised EEG Clustering (ACDSEEGc). This method incorporates dual constraints: a connectivity constraint for the interconnections between EEG points and a neighborhood constraint for the spatial neighborhood relationships among EEG data points. Additionally, it integrates channel weights to emphasize information from important channels. The objective function of ACDSEEGc integrates cross-entropy evaluation, channel weight learning, pseudo-label learning, connectivity constraint, and least squares error minimization. Our aim is to maximize the use of limited prior knowledge to achieve better EEG clustering results. Experimental validation demonstrates that ACDSEEGc effectively produces superior clustering outcomes compared to state-of-the-art standard unsupervised and semi-supervised EEG/time-series clustering algorithms. Furthermore, we conducted sensitivity experiments and ablation studies to verify the performance of ACDSEEGc under different settings.

Identification of generator coherency in power systems with wind farm

In the context of the "dual carbon" goal, the penetration rate of new energy represented by wind power is gradually increasing. The large-scale grid connection of wind power makes the power system more complex and uncertain. The output of wind farms changes the system flow, indirectly affecting the power angle characteristics of synchronous generators, and thereby changing the coherence between generators. Affects synchronous generator homology identification. This paper proposes a generator homology identification method for power systems containing wind farms, in response to the problem that the existing methods for identifying unit homology have not taken into account the adverse effects of wind farms on identification results. Translate the influence of wind farms on the homology of synchronous generators into the contraction admittance matrix as a static electrical distance indicator; Select dynamic data reflecting the homology of synchronous generators after disturbance, and form four dynamic indicators to measure the power angle increment curve between each generator: Euclidean distance, Chebyshev distance, grey correlation, and correlation coefficient; By using the combination weighting method to determine the weights of each indicator, a comprehensive similarity matrix is formed, and the optimal clustering results are determined using fuzzy system clustering and F-statistical values. Finally, the effectiveness of the proposed method was verified using EPRI-9 node system, EPRI-36 node system, and IEEE68 node system as examples.© 2017 Elsevier Inc. All rights reserved.

Cluster-based Graph Collaborative Filtering

Graph Convolution Networks (GCNs) have significantly succeeded in learning user and item representations for recommendation systems. The core of their efficacy is the ability to explicitly exploit the collaborative signals from both the first- and high-order neighboring nodes. However, most existing GCN-based methods overlook the multiple interests of users while performing high-order graph convolution. Thus, the noisy information from unreliable neighbor nodes ( \(e.g.\) , users with dissimilar interests) negatively impacts the representation learning of the target node. Additionally, conducting graph convolution operations without differentiating high-order neighbors suffers the over-smoothing issue when stacking more layers, resulting in performance degradation. In this paper, we aim to capture more valuable information from high-order neighboring nodes while avoiding noise for better representation learning of the target node. To achieve this goal, we propose a novel GCN-based recommendation model, termed Cluster-based Graph Collaborative Filtering (ClusterGCF). This model performs high-order graph convolution on cluster-specific graphs, which are constructed by capturing the multiple interests of users and identifying the common interests among them. Specifically, we design an unsupervised and optimizable soft node clustering approach to classify user and item nodes into multiple clusters. Based on the soft node clustering results and the topology of the user-item interaction graph, we assign the nodes with probabilities for different clusters to construct the cluster-specific graphs. To evaluate the effectiveness of ClusterGCF, we conducted extensive experiments on four publicly available datasets. Experimental results demonstrate that our model can significantly improve recommendation performance.

Spectral ensemble clustering with doubly stochastic co-association matrix

Although co-association (CA) matrix-based spectral ensemble clustering (SEC) has achieved significant success, it faces two persistent challenges: (1) CA matrix-based SEC may result in imbalanced cluster outcomes, and (2) SEC encounters difficulties due to the high time and space complexity resulting from the quadratic scaling of the CA matrix with the number of data points. To tackle these issues, we propose a doubly stochastic co-association (DSCA) matrix construction method. We have theoretically demonstrated that DSCA matrix-based SEC can achieve a more balanced cluster outcome compared to CA matrix-based SEC. Leveraging the DSCA matrix, we introduce two novel methods: Fast SEC (FSEC) and Approximate SEC (ASEC). FSEC efficiently solves the normalized cut on the DSCA matrix as it is symmetric and doubly stochastic. In ASEC, we employ random samples rather than the entire big dataset for ensemble clustering. After obtaining the ensemble clustering result of benchmark random sample, the approximate ensemble clustering result for all data points is derived using our newly proposed probability nearest neighbors (PNN) algorithm. Experimental results on both real-world and synthetic datasets are evaluated in terms of accuracy (ACC), normalized mutual information (NMI), purity, F1-score, and adjusted rand index (ARI) and confirm the scalability and effectiveness of the proposed FSEC and ASEC.

Analysis of the impact of the volumes of state commissioning on the economy’s availability of specialists in certain professions

In Ukraine, there are imbalances between the specialities of graduates of higher education institutions and the needs of the market, so the issue of studying the possibilities of state influence on increasing the popularity of strategically necessary professions for the development of the country through the state-commissioned education is relevant. The purpose of the study was to determine how changes in the volume of state orders affect the choice of professions and competitive scores, and to develop recommendations for optimising the national policy in the field of financing specialities important for the country’s economic development. Clustering of specialities by the number of applicants enrolled for training was carried out, trends in changes in clusters in dynamics for 2018-2023 were considered, forecast models for changes in the number of applicants for each of the clusters were constructed, and correlation dependencies were determined on the impact of changes in the volume of state orders on attracting capable applicants to the speciality. The results of clustering, the visualisation of which is carried out using graphical methods, to a certain extent determine the popularity of the relevant professions and specialisations among applicants, including the level of sensitivity of the choice of applicants to the influence of external factors. It was determined that fluctuations in the number of applicants in small specialities occur within 1% despite significant changes in the share of state-funded places financed by budgetary funds, but in the cluster of specialities with a large number of applicants, such fluctuations are within 10%. The practical significance of the study lies in the possibility of using the constructed models for each speciality to determine their sensitivity to the impact of changes in the amount of funding for state-commissioned education, which would optimise the distribution of financial resources for training specialists for sectors of the economy

Exploratory factor analysis for machining error data of compressor blades based on dimensionality-reduced statistical analysis method

Abstract Various machining errors inevitably occur on aero-engine compressor blades, including leading-edge contour error, trailing-edge contour error, camber contour error, and more. The current complexity surrounding the numerous ma-chining error types and their obscure interrelationships imposes immense effort for aerodynamic analysis and hin-ders overall error control. Thus, elucidating error correlations to achieve error dimensionality reduction is imperative. This study pioneers a dimensionality reduction approach via factor analysis to conduct a comprehensive statistical analysis of 13 types of blade machining errors. The proposed technique can categorize the 13 errors into three groups, each dominated by a distinct common factor. To validate the accuracy of the extracted factors, the factor scores of the three identified latent factors are computed. Cluster analysis is then performed on the factor scores, and the clustering results are visualized by t-Distributed Stochastic Neighbor Embedding (t-SNE). Furthermore, boot-strap resampling establishes the 95% confidence intervals for the factor scores. Capitalizing on the grouping struc-ture uncovered by factor analysis, multiple linear regression models are built for the errors within each group, and then, a preliminary conjecture is made about the potential key error types for each group of errors based on the re-gression coefficients. This hypothesis is then evidenced by the statistical analysis of cross-section profile error data of 28 blades. The present work can not only optimize machining processes but also relax tolerance requirements and diminish the effort of aerodynamic analysis.

Electron diffraction of foam-like clusters between xenon and helium in superfluid helium droplets.

We report electron diffraction results of xenon clusters formed in superfluid helium droplets, with droplet sizes in the range of 105-106 atoms/droplet and xenon clusters from a few to a few hundred atoms. Under four different experimental conditions, the diffraction profiles can be fitted using four atom pairs of Xe. For the two experiments performed with higher helium contributions, the fittings with one pair of Xe-He and three pairs of Xe-Xe distances are statistically preferred compared with four pairs of Xe-Xe distances, while the other two experiments exhibit the opposite preference. In addition to the shortest pair distances corresponding to the van der Waals distances of Xe-He and Xe-Xe, the longer distances are in the range of the different arrangements of Xe-He-Xe and Xe-He-He-Xe. The number of independent atom pairs is too many for the small xenon clusters and too few for the large clusters. We consider these results evidence of xenon foam structures, with helium atoms stuck between Xe atoms. This possibility is confirmed by helium time-dependent density functional calculations. When the impact parameter of the second xenon atom is a few Angstroms or longer, the second xenon atom fails to penetrate the solvation shell of the first atom, resulting in a dimer with a few He atoms in between the two Xe atoms. In addition, our results for larger droplets point toward a multi-center growth process of dopant atoms or molecules, which is in agreement with previous proposals from theoretical calculations and experimental results.

The algorithm for denoising point clouds of annular forgings based on Grassmann manifold and density clustering

Abstract In the industrial sector, annular forgings serve as critical load-bearing components in mechanical equipment. During the production process, the precise measurement of the dimensional parameters of annular forgings is of paramount importance to ensure their quality and safety. However, owing to the influence of the measurement environment, the manufacturing process of annular forgings can introduce varying degrees of noise, resulting in inaccurate dimensional measurements. Therefore, researching methods for three-dimensional point cloud data to eliminate noise in annular forging point clouds is of significant importance for improving the accuracy of forging measurements. This paper presents a denoising approach for three-dimensional point cloud data of annular forgings based on Grassmann manifold and density clustering (GDAD). First, within the Grassmann manifold, the core points for density clustering are determined using density parameters. Second, density clustering is performed within the Grassmann manifold, with the Cauchy distance replacing the Euclidean distance to reduce the impact of noise and outliers on the analysis results. Finally, a search tree model was constructed to filter out incorrect point cloud clusters. The fusion of clustering results and the search tree model achieved denoising of point cloud data. Simulation experiments on annular forgings demonstrate that GDAD effectively eliminates edge noise in annular forgings and performs well in denoising point-cloud models with varying levels of noise intensity.

The Application of Big Data in the Management of Ideological and Political Education in the Development of Education Network

Based on a brief analysis of the current situation of university education management and research on intelligent algorithms, this article constructs a university education management system based on big data. For the clustering and prediction modules in higher education management, corresponding algorithms are used for optimization design. A fuzzy clustering algorithm based on entropy weight is proposed to address the shortcomings of the C-means clustering algorithm. This algorithm adds weighting coefficients on the basis of improvement and continuously updates the clustering centers. The prediction module uses Apriori algorithm to map and compress the target transaction database, reduces the number of candidate item sets through pruning process, and designs simulation experiments to measure the performance of the algorithm. The simulation results show that the clustering results of this algorithm are closer to the actual clustering situation, with shorter running time and better algorithm performance.

COPS: A novel platform for multi-omic disease subtype discovery via robust multi-objective evaluation of clustering algorithms.

Recent research on multi-view clustering algorithms for complex disease subtyping often overlooks aspects like clustering stability and critical assessment of prognostic relevance. Furthermore, current frameworks do not allow for a comparison between data-driven and pathway-driven clustering, highlighting a significant gap in the methodology. We present the COPS R-package, tailored for robust evaluation of single and multi-omics clustering results. COPS features advanced methods, including similarity networks, kernel-based approaches, dimensionality reduction, and pathway knowledge integration. Some of these methods are not accessible through R, and some correspond to new approaches proposed with COPS. Our framework was rigorously applied to multi-omics data across seven cancer types, including breast, prostate, and lung, utilizing mRNA, CNV, miRNA, and DNA methylation data. Unlike previous studies, our approach contrasts data- and knowledge-driven multi-view clustering methods and incorporates cross-fold validation for robustness. Clustering outcomes were assessed using the ARI score, survival analysis via Cox regression models including relevant covariates, and the stability of the results. While survival analysis and gold-standard agreement are standard metrics, they vary considerably across methods and datasets. Therefore, it is essential to assess multi-view clustering methods using multiple criteria, from cluster stability to prognostic relevance, and to provide ways of comparing these metrics simultaneously to select the optimal approach for disease subtype discovery in novel datasets. Emphasizing multi-objective evaluation, we applied the Pareto efficiency concept to gauge the equilibrium of evaluation metrics in each cancer case-study. Affinity Network Fusion, Integrative Non-negative Matrix Factorization, and Multiple Kernel K-Means with linear or Pathway Induced Kernels were the most stable and effective in discerning groups with significantly different survival outcomes in several case studies.