This paper reviews weighted clustering ensemble methods.
problem Improving clustering results from individual methods.
method Different types of weights and approaches to determining weight values.
result Unified framework for selecting appropriate weighting mechanisms.
New method clusters hypergraphs using weighted random walks and Laplacians.
problem Clustering hypergraph data with edge-dependent weights.
method Random walks with edge-dependent vertex weights, constructing hypergraph Laplacians for clustering.
result Proposed methods outperform existing hypergraph clustering algorithms.
A new approach to learn weights for multi-view clustering.
problem Measuring the importance of each view in multi-view clustering.
method Proposes a re-weighted approach to learn intrinsic weights for multi-view clustering.
result The proposed approach is effective and practical for multi-view clustering.
A new fuzzy k-means algorithm for high-dimensional data with variable feature weights.
problem Clustering high-dimensional data with varying feature significance.
method Proposes a modified fuzzy k-means algorithm using two entropy terms to weight features.
result Improved clustering performance on various datasets compared to state-of-the-art methods.
Power weighted shortest paths improve clustering of high-dimensional data.
problem Clustering high-dimensional Euclidean data with disjoint low-dimensional manifolds.
method Use of power weighted shortest path distance functions and a fast algorithm.
result Higher clustering accuracy achieved through power weighted shortest paths.
The densest k-clique problem is solved via semidefinite programming for weighted graphs.
problem Clustering dense weighted graphs into disjoint subgraphs maximizing density.
method Solving a semidefinite relaxation to recover clusters with high probability.
result Clusters can be recovered from the solution of a semidefinite relaxation with high probability.
Proposes a weighted conformal approach for cluster label uncertainty.
problem Cluster label uncertainty in unlabeled data.
method Develops a conformal inference algorithm to correct label mismatch.
result Improves confidence set size in nonlinear and high-dimensional clustering.
New method clusters weighted directed networks using motifs.
problem Clustering directed networks fails to consider higher-order structure and edge weights.
method Motif-based weighted spectral clustering with new matrix formulae.
result Scalable and effective clustering on large graphs and real-world data.
Proposes a new model for clustering multiplex networks with compositional data.
problem Clustering multiplex networks with multiple types of relations and compositional data.
method Multiplex Dirichlet stochastic block model for compositional networks.
result Validated through simulation and applied to international export data.
DMFAW improves multi-view clustering with adaptive weights and feature selection.
problem Lack of effective feature selection and empirical hyperparameter selection in existing deep matrix factorization methods.
method Introduces Deep Matrix Factorization with Adaptive Weights (DMFAW) for multi-view clustering, incorporating feature selection and dynamically updating weights using Control Theory.
result DMFAW outperforms state-of-the-art methods in clustering performance.
A novel weighted distance improves fuzzy c-means clustering accuracy.
problem Improving fuzzy c-means clustering performance with weighted distances.
method Proposed Canberra Weighted Distance to enhance FCM algorithm.
result Experimental results show superior performance of the proposed method.
Proposes WM-NMF for better multi-view clustering.
problem Learning multi-view data with unequal view information content.
method Introduces a weighted multi-view NMF algorithm to learn view-specific and observation-specific weights.
result Achieves better clustering performance and handles noisy data.
New method clusters matrix-valued data by latent variables.
problem Clustering matrix-valued data with hidden structure.
method Latent variable model with hierarchical clustering.
result Algorithm attains clustering consistency in high dimensions.
A new method clusters signed networks using a modified MBO scheme.
problem Clustering signed networks with mixed positive and negative edge weights.
method Adapted MBO scheme for graph-based diffuse interface model.
result Method outperforms state-of-the-art approaches on various datasets.
Robust feature-weighted jump models for time-dependent clustering
problem Temporal clustering
method Robust feature-weighted jump model
result Accurate recovery of true cluster sequence and feature identification
Study of g-vector cones in cluster algebras from weighted orbifolds.
problem Determine the closure of g-vector cones in cluster algebras. method Analyzing g-vector cones in a cluster algebra defined from a weighted orbifold. result Closure of the union of g-vector cones is Rn except for specific weighted orbifolds. Improved accuracy in machine learning with Cross-Cluster Weighted Forests.
problem Improving accuracy in machine learning algorithms for datasets with clusters.
method Ensembling Random Forest learners trained on clusters determined by k-means.
result Significant improvements in accuracy and generalizability over traditional Random Forest.
The classical k-means algorithm for partitioning n points in Rd into k clusters is one of the most popular and widely spread clustering methods. The need to respect prescribed lower bounds on the cluster sizes has been observed in many scientific and business applications. In this paper, we present an…
Proposes a novel multi-view clustering method by aligning partitions.
problem Challenges of integrating multi-view information and information loss.
method Aligns partitions through rotation matrices and assigns weights to views.
result Significant improvement over state-of-the-art methods on real datasets.
Method decomposes streaming data into sparse and low-rank components from compressive measurements.
problem Online decomposing compressive streaming data efficiently.
method Solves n-ℓ1 cluster-weighted minimization to decompose sparse and low-rank components. result Outperforms existing methods for numerical and video data.
New method embeds phylogenetic trees for clustering, recovering evolutionary relationships.
problem Lack of a meaningful way to embed phylogenetic trees into a vector space.
method Split-weight embedding to fit clustering algorithms to phylogenetic trees.
result Split-weight embedding recovers meaningful evolutionary relationships in simulated and real data.
A new model clusters network nodes based on relative edge weights.
problem Clustering networks ignores node capacities, leading to biased results.
method Proposes a Dirichlet stochastic block model for composition-weighted networks.
result Validated on simulated and real-world networks, showing improved clustering accuracy.
Proposes a method for multi-view clustering that considers local structures and feature weights.
problem Challenges in effectively exploiting complementary information across multiple views.
method Simultaneously assigns weights to different features and captures local information in view-specific feature spaces.
result Achieves state-of-the-art performance on benchmark datasets.
New method clusters weighted networks and data with high accuracy.
problem Clustering weighted and directed networks with varying weights.
method Extends message passing algorithms to Potts model at critical temperature, solving marginals using belief propagation.
result Significantly outperforms existing algorithms in community detection and clustering tasks.
Deep k-Means compresses CNNs by clustering weights and re-training, reducing energy consumption.
problem High energy consumption and large parameter count in deep convolutions.
method Applying k-means clustering on convolutional layer weights, sharing K cluster centers, and re-training with hard assignments. result Significant reduction in energy consumption and compression ratio without accuracy loss.
This paper improves total variation based convex clustering for better data clustering.
problem Improving data clustering methods, especially for general data.
method Proposes a weighted sum-of-ℓ1-norm relating convex model for total variation based clustering. result Established exact clustering property applicable to general data, sharper than existing results.
Develops a new random forest method for clustered data with improved prediction and inference.
problem Improving prediction and inference accuracy for clustered data with within-cluster dependence.
method Clustered Random Forests, using weighted least squares estimators for leaf predictions.
result Optimal prediction and inference weights vary under covariate shift, necessitating user-chosen weights.
We define a class of Euclidean distances on weighted graphs, enabling to perform thermodynamic soft graph clustering. The class can be constructed form the "raw coordinates" encountered in spectral clustering, and can be extended by means of higher-dimensional embeddings (Schoenberg transformations). Geographical flow …
A new method for clustering functional data outperforms existing methods.
problem Clustering heterogeneous functional linear regression data.
method funWeightClust, a family of parsimonious models based on cluster weighted models.
result funWeightClust outperforms existing methods in simulations and real-world traffic analysis.
A family of parsimonious Gaussian cluster-weighted models is presented. This family concerns a multivariate extension to cluster-weighted modelling that can account for correlations between multivariate responses. Parsimony is attained by constraining parts of an eigen-decomposition imposed on the component covariance …
New concept of mixture complexity helps detect gradual clustering changes.
problem Determining the number of clusters in mixture models with overlaps and weight biases.
method Introducing mixture complexity (MC) as a new measure of cluster size, defined from information theory.
result MC can detect gradual clustering changes, allowing earlier detection and finer distinction.
Data clustering has received a lot of attention and numerous methods, algorithms and software packages are available. Among these techniques, parametric finite-mixture models play a central role due to their interesting mathematical properties and to the existence of maximum-likelihood estimators based on expectation-m…
The paper proves an infinite double bubble theorem in higher dimensions.
problem Characterizing minimizing partitions of infinite and finite volumes in Rn. method Proves a variant of the double bubble theorem for configurations with infinite and finite chambers.
result Locally minimizing (1,2)-clusters are unique in Rn for n≤7 and n≥8 under certain conditions. Develops algorithms for multi-way similarity clustering in hypergraphs.
problem Challenges of spectral clustering in multi-way similarity settings.
method Hypergraph Spectral Clustering (HSC) and Hypergraph Spectral Clustering with Local Refinement (HSCLR).
result Achieves optimal performance under the weighted stochastic block model.
New fuzzy clustering method for distribution-valued data using adaptive Wasserstein distances.
problem Clustering distribution-valued data with adaptive weights.
method Fuzzy c-means algorithms using adaptive L2 Wasserstein distances. result Adaptive distances improve clustering of distribution-valued data.
The clustering ensemble technique aims to combine multiple clusterings into a probably better and more robust clustering and has been receiving an increasing attention in recent years. There are mainly two aspects of limitations in the existing clustering ensemble approaches. Firstly, many approaches lack the ability t…
We formulate weighted graph clustering as a prediction problem: given a subset of edge weights we analyze the ability of graph clustering to predict the remaining edge weights. This formulation enables practical and theoretical comparison of different approaches to graph clustering as well as comparison of graph cluste…
Proposes Lasso Weighted k-means for sparse clustering of high-dimensional data.
problem Sparse clustering of high-dimensional data with variable feature weights.
method Introduces a lasso-based penalty term on feature weights for sparse clustering without distributional assumptions.
result Establishes strong consistency of the algorithm and competitive performance on real and synthetic datasets.
clusterBMA combines clustering results from multiple models using Bayesian model averaging.
problem Uncertainty in model selection for clustering.
method Bayesian model averaging to combine results from multiple clustering algorithms.
result ClusterBMA offers probabilistic cluster allocations and quantifies model-based uncertainty.
KLIC combines multiple datasets for clustering, down-weighting noisy data.
problem Robustness of COCA in noisy or conflicting datasets.
method Multiple Kernel Learning for Integrative Clustering.
result KLIC down-weights noisy datasets, improving clustering accuracy.
A new metric framework for weighted projective spaces improves clustering and analysis.
problem Proximity measurement in weighted projective spaces with intrinsic scaling and topology.
method Hierarchical clustering framework based on Finsler geometry, quotienting weighted scaling action.
result The constructed metric dF satisfies the triangle inequality, making it a genuine metric. Hierarchical clustering uses OWA operators to generalize linkage methods and avoid dendrogram inversions.
problem Avoiding unaesthetic inversions in hierarchical clustering dendrograms.
method OWA-based linkages combined with the Lance-Williams formula and conditions on weight generators.
result Conditions for weight generators to produce dendrograms without inversions.
Local graph clustering improves with noisy labels, enhancing accuracy and performance.
problem Local graph clustering with noisy labels for node information.
method Constructing a weighted graph with noisy labels and using diffusion-based clustering.
result Diffusion in the weighted graph yields more accurate recovery of target clusters.
A new clustering method for functional data using skewed distributions.
problem Clustering functional data with skewed distributions.
method Mixtures of functional linear regression models and three skewed multivariate distributions (variance-gamma, skew-t, normal-inverse Gaussian).
result The proposed method funWeightClustSkew performs well on simulated and real data.
This paper develops a multilayer spectral clustering method for heterogeneous data.
problem Clustering in multilayer graphs with varying layer weights and structures.
method Convex layer aggregation for multilayer spectral graph clustering (SGC).
result Phase transition analysis and automated cluster assignment with statistical guarantees.
New bounds for convex clustering under graph connectivity.
problem Understanding clustering performance under different graph connectivity structures.
method Random walks and concentration inequalities for random graph models.
result Improved rates of convergence for centroid recovery.
Machine learning uncovers hidden patterns in Calabi-Yau hypersurfaces.
problem Identifying and clustering Calabi-Yau hypersurfaces from weighted-P4s.
method Supervised and unsupervised machine learning techniques.
result High accuracy in predicting topological parameters and identifying hypersurfaces.
Developed a new weighted K-means algorithm for clustering Lego bricks of different shapes and colors.
problem Clustering data with large spread and different scales of measurement.
method Gap-ratio Weighted K-means algorithm, which weights each dimension based on the ratio of the biggest gap to the average of all gaps.
result The gap-ratio K-means algorithm outperformed other variants on the Lego bricks clustering problem and other datasets.