Robust Tri-Factor Decomposition Tames Noisy Multi-View Clustering at Scale

Every time you scroll through a photo feed, watch a video, or browse a product catalog, you generate data that describes the same underlying object from several angles at once. A single image can be characterized by its pixels, its texture statistics, its shape descriptors, and its semantic tags. Machine learning researchers call each of these descriptions a “view,” and the task of grouping objects into categories by combining all views simultaneously is known as multi-view clustering. It is one of the workhorses of unsupervised learning, and a new study published in Applied Intelligence by Shaojun Shi, Jiahao Zhao, and Yibing Liu of Xi’an University of Posts and Telecommunications proposes a fresh mathematical engine for it, one designed to survive the noise, scale, and imbalance that plague real-world datasets.

The core problem the team attacks is deceptively simple to state. Traditional multi-view clustering methods, especially those built on graph constructions that measure pairwise similarities between every pair of samples, become computationally prohibitive as datasets grow. Matrix factorization approaches, which compress data into low-dimensional coefficient matrices, alleviate this scalability bottleneck to some extent, but they carry their own baggage. According to the authors, three limitations recur across the literature: most factorization-based methods fail to account for the pervasive noise that contaminates large-scale data, degrading discriminative capability precisely where robustness matters most; they typically treat views of varying quality as equally trustworthy, wasting the rich information carried by high-quality views; and they separate the learning of clustering partitions from the learning of coefficient matrices, so the final grouping cannot guide the representations it depends on.

The proposed method, Robust Tri-Factor Decomposition for Multi-view Clustering, or RTFDMC, addresses all three weaknesses within a single optimization framework. The first ingredient is a choice of norm. When constructing the coefficient matrices that encode how samples relate to cluster centroids, RTFDMC incorporates the l2,1-norm rather than the conventional Frobenius norm. The l2,1-norm sums the Euclidean lengths of the rows of a matrix, which means it penalizes entire noisy samples rather than spreading error evenly across all entries. In practical terms, this makes the model robust to sample-specific corruption: outliers and corrupted feature vectors contribute less to the objective, so the learned coefficients stay discriminative even in complex noisy environments where Frobenius-norm models would be significantly degraded.

The second ingredient is a self-supervised weighting mechanism. Not all views are created equal. A texture descriptor might be highly informative for classifying plant leaves, while a shape descriptor might carry little discriminative signal for the same task. Most factorization-based pipelines weight all views identically, which prevents full exploitation of the rich information in high-quality views. RTFDMC instead learns view weights automatically from the data itself, in a self-supervised fashion, so the optimization process amplifies views that agree with the emerging cluster structure and dampens views that disagree. This auto-weighted strategy, a theme the authors connect to recent work on self-weighted contrastive fusion and adaptive anchor methods, means the model does not require a hand-tuned parameter per view, which matters enormously when the number of views is large.

The third and arguably most elegant ingredient is the tri-factor decomposition itself. Standard matrix factorization approximates a data matrix as the product of two factors, typically a basis matrix and a coefficient matrix. Tri-factorization inserts a third factor in the middle, an indicator-like matrix that explicitly represents the cluster assignment structure. In RTFDMC, this middle factor tightly couples the clustering partition with representation learning: the partition is not a post-processing step bolted onto the coefficients, but a variable optimized jointly with them. The authors argue that this coupling allows the clustering partition to guide discriminative coefficient learning, improving the discriminative capability of the coefficient matrices and, in turn, the final clustering performance. It is a feedback loop in linear algebra form.

Optimizing a model with three coupled matrix factors, an l2,1-norm, and learned view weights is not trivial. The team develops an iterative algorithm that alternates between updating each factor while holding the others fixed, a strategy common in non-negative matrix factorization research, where each subproblem admits a closed-form or efficiently solvable update. The convergence behavior of such alternating schemes has been studied extensively in the factorization literature, and the authors position their solver within this tradition. The computational profile is what makes the approach suitable for large-scale scenarios: because the method operates on factorized coefficient matrices rather than full pairwise similarity graphs, its complexity scales far more gently with the number of samples than graph-based multi-view clustering methods, which the authors note often become unsuitable for large-scale data.

To validate the design, the researchers ran comprehensive experiments on eight benchmark datasets spanning a remarkable diversity of data types. These include the UCI One-hundred plant species leaves dataset, the UCI Multiple Features dataset of handwritten digit descriptions, the Caltech101 and Caltech256 image collections, the NUS-WIDE web image database, the Animals with Attributes (AwA) dataset, and a YouTube multi-view video games dataset. Together these benchmarks cover biological measurements, computer vision features, web multimedia, and video metadata, providing a stress test for the method’s claim to mine complementary and consistent information across very different kinds of views.

The experimental results, the authors report, validate the effectiveness of the proposed method across these benchmarks. The combination of noise suppression via the l2,1-norm, adaptive view weighting, and the joint optimization of partitions and coefficients is what drives the performance gains, and the ablation logic implied by the design suggests each component contributes: remove the robust norm and noise degrades the coefficients, remove the weighting and low-quality views dilute the signal, remove the tri-factor coupling and the partition stops informing the representation. The study also connects to a vibrant research frontier, citing recent advances in learnable graph filters, one-step spectral clustering, consensus graph learning, contrastive deep multi-view clustering, and scalable anchor-based methods presented at venues such as NeurIPS, ACM Multimedia, CVPR, and AAAI.

What makes this work resonate beyond the factorization community is the broader lesson about robustness in unsupervised learning. As datasets grow, noise does not merely persist; it becomes pervasive, and models that assume clean, equally informative inputs quietly fail. The RTFDMC design embodies a counter-philosophy: build the assumptions about noise, view quality, and cluster structure directly into the objective function, so that the optimizer itself learns to discount corruption and exploit agreement. The tri-factor structure, in particular, offers a template that other representation learning pipelines could adopt, since the idea of an explicit assignment factor mediating between data and coefficients generalizes beyond clustering.

The research, published in Applied Intelligence (volume 56, article number 499) and available under DOI 10.1007/s10489-026-07499-1, was supported in part by the National Natural Science Foundation of China, the Young Talent Fund of the Association for Science and Technology in Shaanxi, the Xi’an University of Posts and Telecommunications Innovation Fund, the Spark Program of Earthquake Sciences, and Shaanxi provincial research programs. For practitioners deploying multi-view clustering on noisy, large-scale data, the message of the study is encouraging: with the right norm, the right weighting, and the right factorization, the discriminative structure hiding inside messy multi-view data can be pulled out efficiently, robustly, and at scale.

Subject of Research: Robust tri-factorization-based multi-view clustering with l2,1-norm noise suppression and self-supervised view weighting

Article Title: Robust tri-factor decomposition for multi-view clustering

Article References: Shi, S., Zhao, J., & Liu, Y. (2026). Robust tri-factor decomposition for multi-view clustering. Applied Intelligence, 56(16), Article 499. https://doi.org/10.1007/s10489-026-07499-1

Image Credits: AI Generated

DOI: 10.1007/s10489-026-07499-1

Keywords: multi-view clustering, matrix factorization, tri-factor decomposition, l2,1-norm, robust learning, self-supervised weighting, auto-weighted, unsupervised learning, Applied Intelligence, large-scale data, noise suppression, cluster partition