Enhanced Tensor Incomplete Multi-View Clustering with Dual Adaptive Weight

Abstract

In practical application, the gathered multi-view data typically misses samples, known as incomplete multi-view data. Most existing incomplete multi-view clustering methods obtain consensus information in multi-view data by completing incomplete data using zero, mean values, etc. These approaches often ignore the higher-order relationship and structural information between different views. To alleviate the above problems, we propose enhanced tensor incomplete multi-view clustering with dual adaptive weight (ETIMC), which can acquire the higher-order relationship, and structural information between multiple perspectives, adaptively recover the missing samples and distinguish the contribution degree of different views. Specifically, the embedded representations obtained from incomplete multi-view data are stacked into a third-order tensor to capture the higher-order relationship. Then, a consensus matrix can be drawn from these potential representations via a self-weighting mechanism. Additionally, we adaptively reconstruct the missing samples while capturing structural information by the hypergraph Laplacian item. Moreover, we integrate the embedded representation of each view, tensor constraints, hypergraph Laplacian regularization, and dual adaptive weighted mechanisms into a unified framework. Experimental results on natural and synthetic incomplete datasets show the superiority of ETIMC.

1. Introduction

Real-world data generally stems from multiple channels or sensors and is considered multi-view data. For example, people can be identified by their faces, fingerprints, and voices; doctors can diagnose patients in different ways, including interviews, tests, and X-rays. Fusing information from distinct perspectives or multiple ways can comprehensively analyze data, inspiring many multi-perspective clustering techniques. Multi-view clustering aims to separate data into their clusters by obtaining valuable knowledge from diverse viewpoints. So far, the proposed multi-perspective clustering approaches can be roughly divided into feature-driven (e.g., subspace-based [1,2,3]) and relationship-driven (e.g., graph-based [4,5,6]) methods. These methods can process complete data well. When there are missing samples, it is difficult for these methods to comprehensively capture the complementary information between different perspectives, resulting in the algorithm performance degradation.

Multi-view data obtained from different angles suffer from missing samples that are ubiquitous in reality. For example, in the questionnaire survey, many surveys are anonymous for privacy reasons. In disease diagnosis, the patient cannot undergo a comprehensive examination owing to force majeure. It is difficult for previous multi-view clustering methods to deal with incomplete multi-view data directly. Therefore, many incomplete multi-view clustering methods emerge. The work [7] is an earlier method to solve incomplete multi-view data, but it needs at least one complete view. The method proposed by Gao et al. [8] can handle the case of more than two perspectives, which uses the mean value of all samples to fill incomplete data while introducing interference factors such as noise in the filling process. To avoid the above problems, the method proposed by many scholars is to infer missing samples in learning. For example, the work [9] proposed a method, called incomplete multi-modal visual data grouping (IMG), IMG first completed data by Laplacian regularization to obtain structural information between perspectives, then bridges complete and incomplete instances. Wen et al. [10] introduced the incomplete multi-view tensor spectral clustering with missing-view inferring (IMVTSC-MVI), which incorporated the feature space-based missing-view inferring and manifold space-based similarity graph learning into a unified framework. However, IMG and IMVTSC-MVC use traditional graph theory to save the original data of geometric structure and lose important information to some extent. Our proposed ETIMC applies hypergraphs to obtain structural information from incomplete multi-view data. Hypergraphs can connect multiple vertices (more than two), thus exploring more comprehensive information.

The methods mentioned above are not flexible when tackling intricate incomplete multi-view data, so a suite of algorithms based on weighting mechanisms has been proposed to add distinct weights to missing and no missing samples. DAIMC [11] employs weighted NMF to solve the problem of incomplete data by assigning zero weight to missing samples in each view and appropriate weight to those that are not missing. After that, OSINN [12] proposed an interpretable Orthogonal Non-negative Matrix Factorization into a clustering layer. However, these methods are predefined weights and cannot adjust the weights adaptively according to changes in the model. Meanwhile, extra parameters will be introduced, thus increasing the cost of model tuning. In addition, the above method does not pay attention to the higher-order relationship between different perspectives, which is helpful to enhance the clustering performance because it can explore more abundant information. Therefore, Li et al. [13] proposed a novel tensor approach to capture block-diagonal structural and higher-order information from different views. Based on the higher-order relationship, it can acquire the membership degree between the observed sample and the missing instance and further obtain the consensus representation of separability. Zhang et al. [14] introduced an enhanced tensor low-rank and sparse representation recovery(ETLSRR), which constructed a three-way tensor by stacking graphs to explore higher-order relationships. To alleviate the negative influence of missing views and data noise, ETLSRR decomposed the tensor into two parts: a sparse tensor and an intrinsic tensor, which models the noise and underlying true data similarities, respectively. All the tensor methods mentioned above solve the minimization problem via the nuclear norm. Compared with the nuclear norm, the Schatten-p norm has an adjustable parameter p, which can reduce the proportion of large singular values in the objective function. Therefore, our work chooses the Schatten-p norm to solve the minimization problem of the tensor.

Inspired by the above analysis, this paper proposes an enhanced tensor incomplete multi-view clustering via dual adaptive weight (ETIMC). ETIMC can adaptively recover incomplete data, obtain consistent, structural, and higher-order information among recovered data, and allocate reasonable weights to different perspectives via an adaptive weighted mechanism. Figure 1 illustrates the entire framework of the proposed ETIMC. Specifically, we first stack the low-dimensional representations obtained by subspace learning into a third-order tensor to explore the higher-order relationship between perspectives and use the Schatten-p norm to solve the tensor to increase the flexibility and ensure the low-rank characteristics. We then learn the consensus representation from the obtained low-dimensional representation via an adaptive weighted mechanism. Subsequently, we apply adaptive hypergraph Laplacian constraints to recover missing samples and acquire higher-order structural information between perspectives. The highlights of this article are summarized as follows:

• The proposed ETIMC can obtain the higher-order information from the incomplete multi-view data, solving the tensor minimization problem with the Schatten-p norm to increase flexibility and ensuring the low-rank characteristics.
• The adaptive hypergraph Laplacian mechanism can recover the missing samples by hypergraph neighbors and preserve the higher-order local geometry structure of the original data.
• The proposed ETIMC considers the differences among multiple perspectives via a self-weighting mechanism, which contributes to identifying the contribution of each low-dimensional representation in learning consensus representations.

2. Related Work

Most previous multi-view clustering methods assume that the samples in each view are complete. However, in practical applications, data from different perspectives are usually missing, leading to the clustering performance deterioration. Currently, existing incomplete multi-view clustering methods are often divided into two categories. One is to complete the missing view and then perform the corresponding operation. For example, the work [7] proposes to fill in the incomplete perspective through the kernel method, but it needs at least one complete perspective as a reference. Therefore, there are some improved works filling in all missing views using 0 or the mean. For example, Gao et al. [8] filled in incomplete perspectives utilizing the mean of all samples. In addition, the work [15] introduced a multiple-kernel K-means approach with incomplete kernels (MKKM-IK), which applies the standard multiple-kernel clustering (MKC) algorithms to an interpolated kernel matrix, integrating interpolation and clustering into a unified learning process. The other is to learn the latent representation from incomplete multi-view data directly. For example, Wen et al. proposed a method, called adaptive graph completion based on incomplete multi-view clustering [16], which developed a joint framework for graph completion and consensus representation learning. Liu et al. [17] introduced a method of localized sparse incomplete multi-view clustering (LSIMVC), LSIMVC intends to learn a sparse and structured consensus latent representation from the incomplete multi-view data by optimizing a sparse regularized and novel graph embedded multi-view matrix factorization model. What our work has in common with the above methods is the processing of incomplete multi-view data. The difference is that our work is not limited to having a complete view, nor does it construct the missing data by filling in 0 or the mean. Our proposed ETIMC is to reconstruct the incomplete sample adaptively.

Research on incomplete multi-view clustering has increasingly shifted toward deep learning-based solutions, which can be broadly grouped into imputation-based, inference-based, and generative approaches. Early deep methods primarily focused on learning robust latent representations under missing-view scenarios. Wen et al. [18] introduced one of the first deep frameworks capable of adaptively extracting consensus information from view-specific latent embeddings, followed by Wen et al. [19], who further enhanced representation quality through a structured network designed to capture higher-order relationships. Subsequent works expanded the scope to inference-driven strategies. Lin et al. [20] established the connection between data recovery and consistency learning, employing contrastive loss to infer missing views, whereas Jin et al. [21] improved the reliability of such inference by aligning prototype sets to strengthen cross-view structural consistency. In parallel, imputation-oriented models explored feature-level reliability: Li et al. [22] adopted weighted imputation based on dual-view co-occurrence but overlooked differences in feature informativeness, which was subsequently addressed by Li et al. [23] through the incorporation of prototypes and attention mechanisms to enhance cross-view correlations. More recent efforts (2024–2025) have increasingly employed generative modeling to handle incomplete multi-view data. Wen et al. [24] pioneered the use of diffusion models for view generation, though such models remain limited for non-image modalities; Chen et al. [25] mitigated this issue by utilizing variational autoencoders to capture structural consensus in a modality-agnostic manner. Complementary advances, including dual-view representation learning [26] and adaptive cross-view modeling [27], continue to extend deep incomplete multi-view clustering toward more robust and expressive representation learning frameworks.

3. Methods

In this part, we first elaborate on the construction process of the proposed ETIMC, then give the entire optimization procedure of ETIMC, and finally provide the computational complexity of ETIMC.

3.1. Problem Formulation

Suppose ${\mathbf{Y}}_n^v\in R^{d_v\times N_v}$ is no missing instance of the vth view, where $d_v$ and $N_v$ are the dimension and sample size of the vth perspective, respectively. It is not easy to extract diversified information from multi-view data with missing samples. Therefore, we construct the following equation:

$${\mathbf{Y}}^v=[{\mathbf{Y}}_n^v,{\mathbf{Y}}_m^v]$$

(1)

where ${\mathbf{Y}}_m^v$ is the missing instances. By matrix transformation, we reconstruct Equation (1) as follows:

$${\mathbf{Y}}^v={\mathbf{Y}}_n^v{\mathbf{M}}_n^v+{\mathbf{Y}}_m^v{\mathbf{M}}_m^v$$

(2)

where ${\mathbf{M}}_n^v$ and ${\mathbf{M}}_m^v$ are projection matrices corresponding to ${\mathbf{Y}}_n^v$ and ${\mathbf{Y}}_m^v$, respectively.

Inspired by t-SVD-MSC [28], the tensor-based multi-view approach can capture higher-order information between different perspectives. Hence, we construct an incomplete multi-view clustering model based on tensors, which can be expressed as follows:

$$\begin{array}{c}\underset{{\mathbf{Y}}_m^v,{\mathbf{Z}}^v}{\min }{\displaystyle \sum _{v=1}^V}\Vert {\mathbf{Y}}^v-{\mathbf{Y}}^v{\mathbf{Z}}^v{\Vert }_F^2+\Omega \left(Ƶ\right)\hfill \\ s.t. Ƶ=\Phi \left({\mathbf{Z}}^1,{\mathbf{Z}}^2,\dots ,{\mathbf{Z}}^V\right)\hfill \end{array}$$

(3)

where $\Phi$ is the operation that fuses ${\mathbf{Z}}^v$ together. ${\mathbf{Z}}^v$ is the representation matrix from the the vth perspective. It describes the subspace structure of vth view, so satisfying the constraint $diag\left({\mathbf{Z}}^v\right)=0$. Additionally, we impose non-negative and symmetric constraints on ${\mathbf{Z}}^v$ to make ${\mathbf{Z}}^v$ more discriminant and preserve the potential relationship between data samples. Then we stack ${\mathbf{Z}}^v$ from each view into a third-order tensor $Ƶ$ to capture higher-order information between different views. We add a low-rank constraint for $Ƶ$ to obtain more valuable information because low-rank means that the elements are linearly related. However, the rank is non-convex while the nuclear norm is convex, so the nuclear norm is a convex approximation of the low-rank constraint. Based on the above considerations, Equation (3) is rewritten as follows:

$$\begin{array}{c}\underset{{\mathbf{Y}}_m^v,{\mathbf{Z}}^v}{\min }{\displaystyle \sum _{v=1}^V}\Vert {\mathbf{Y}}^v-{\mathbf{Y}}^v{\mathbf{Z}}^v{\Vert }_F^2+{\Vert Ƶ\Vert }_{*}\hfill \\ s.t.Ƶ=\Phi \left({\mathbf{Z}}^1,{\mathbf{Z}}^2,\dots ,{\mathbf{Z}}^V\right)\hfill \end{array}$$

(4)

Despite the fact that the nuclear norm can enforce the low-rank property of tensors and has been widely used in multi-view clustering, it ignores the differentiation among singular values. Since the nuclear norm penalizes all singular values equally, it inevitably shrinks the dominant singular components excessively, whereas larger singular values often capture more discriminative or informative structures in real-world multi-view data. To preserve the essential structural information in the representation matrices, it is desirable to shrink larger singular values less aggressively. This motivates us to employ the Schatten-p norm, which allows flexible control of the shrinkage degree on singular values by adjusting the parameter $0<p<1$. Moreover, the Schatten-p norm provides a much tighter and more accurate approximation to the tensor rank function compared with the convex nuclear norm. This property has been theoretically justified in Theorem 1.

Theorem 1

(Tight Low-Rank Approximation of Schatten-p Norm). Let $\mathcal{X}\in {\mathbb{R}}^{d_1\times d_2\times d_3}$ be a third-order tensor and ${\sigma }_i\left(\mathcal{X}\right)$ denote its mode-k singular values. For $0<p<1$, the Schatten-p norm ${\parallel \mathcal{X}\parallel }_{S_p}={\sum }_i{\sigma }_i{\left(\mathcal{X}\right)}^p$ is a strictly closer approximation to the tensor rank than the convex tensor nuclear norm. Specifically,

$${\parallel \mathcal{X}\parallel }_{S_p}^p\le {\parallel \mathcal{X}\parallel }_{*},\underset{p\to 0}{lim}{\parallel \mathcal{X}\parallel }_{S_p}^p=rank\left(\mathcal{X}\right).$$

Thus, minimizing the Schatten-p norm induces a stronger low-rank constraint and yields more robust structural recovery for incomplete multi-view data.

Building on Theorem 1, we extend the Schatten-p norm from the single-matrix case to the multi-view tensor setting. By jointly modeling ${\left\{{\mathbf{Z}}^{\mathbf{v}}\right\}}_{v=1}^V$ into a third-order tensor $Ƶ=\Phi \left({\mathbf{Z}}^1,\dots ,{\mathbf{Z}}^V\right)$, the Schatten-p regularization directly exploits the high-order correlations among multiple views while simultaneously enforcing low-rankness in each view-specific representation.

Therefore, Equation (4) can be rewritten into the Schatten-p-based optimization model,

$$\begin{array}{c}\underset{{\mathbf{Y}}_m^v,{\mathbf{Z}}^v}{\min }{\displaystyle \sum _{v=1}^V}\Vert {\mathbf{Y}}^v-{\mathbf{Y}}^v{\mathbf{Z}}^v{\Vert }_F^2+{\Vert Ƶ\Vert }_{Sp}^p\hfill \\ s.t.Ƶ=\Phi \left({\mathbf{Z}}^1,{\mathbf{Z}}^2,\dots ,{\mathbf{Z}}^V\right)\hfill \end{array}$$

(5)

Based on Theorem 1 and its natural extension to tensors, the multi-view Schatten-p norm is defined as

$${\Vert Ƶ\Vert }_{Sp}^p={\left(\sum _{v=1}^V\sum _{j=1}^{min(d,N)}{\sigma }_j{\left({Ƶ}^v\right)}^p\right)}^{{\displaystyle \frac{1}{p}}},0<p<1,$$

(6)

where ${\sigma }_j\left({\mathbf{Z}}^v\right)$ denotes the j-th singular value of the view-specific matrix ${\mathbf{Z}}^v$. This formulation simultaneously promotes low-rankness in each view and preserves their shared high-order structures across views.

Equation (5) can extract the specific-view and higher-order information from the incomplete multi-view data, which can obtain better performance. Motivated by [29], consistent information from different perspectives also contributes to performance. Therefore, the representation matrix obtained from each view learns the consensus matrix, and the specific model is shown as

$$\underset{\mathbf{S}}{\min }\lambda {\Vert {\mathbf{Z}}^v-\mathbf{S}\Vert }_F^2$$

(7)

where $\mathbf{S}$ is the consensus matrix. $\lambda$ is the parameter that needs to be adjusted, which is time-consuming and laborious. Hence, we have introduced an adaptive weighting mechanism to assign reasonable weights to different perspectives, and the model is defined as follows:

$$\underset{\mathbf{S}}{\min }{\alpha }_v{\Vert {\mathbf{Z}}^v-\mathbf{S}\Vert }_F^2$$

(8)

where ${\alpha }_v$ can be solved by Lagrangian function. Specifically refer to [30], the solution of ${\alpha }_v$ is described as follows:

$${\alpha }_v={\displaystyle \frac{1}{2\Vert {\mathbf{Z}}^v-\mathbf{S}{\Vert }_F}}$$

(9)

Motivated by [31], preserving the local geometric structure of the original samples is essential for improving clustering performance. Many previous methods impose a Laplacian constraint on the learned affinity matrix to encode structural information. However, the traditional graph Laplacian only models pairwise relations and therefore cannot capture richer high-order sample interactions.

To overcome this limitation, we incorporate a hyper-Laplacian regularization on the latent representation. Our motivation is twofold. First, based on the learned consensus representation $\mathbf{S}$, we construct a k-nearest-neighbor hypergraph to complete the relational structure of missing instances. Second, hypergraphs provide a mathematically more expressive framework: each hyperedge can connect multiple vertices simultaneously, enabling the model to encode group-level dependencies across views. This property leads to a high-order Laplacian operator of the form ${\mathbf{L}}_H={\mathbf{D}}_v-\mathbf{HW}{\mathbf{D}}_e^{-1}{\mathbf{H}}^{\top }$, where $\mathbf{H}$ denotes the incidence matrix, $\mathbf{W}$ is the diagonal hyperedge-weight matrix, and ${\mathbf{D}}_v$ and ${\mathbf{D}}_e$ represent the vertex and hyperedge degree matrices. Unlike its pairwise counterpart $\mathbf{L}=\mathbf{D}-\mathbf{A}$, the hyper-Laplacian retains a tensor-like aggregation of multi-way relations, providing a more faithful representation of the underlying geometric structure. By embedding this higher-order regularization into our model, we are able to better preserve cross-view structural consistency and accurately infer missing samples. Based on these considerations, we design the following model:

$$\underset{{\mathbf{Y}}_m^v}{\min }{\displaystyle \frac{1}{2}}\sum _{b\in B}\sum _{\left(i,j\right)\in b}{\displaystyle \frac{w\left(b\right)}{d\left(b\right)}}{\Vert {\mathbf{Y}}_{m,i}^v-{\mathbf{Y}}_j^v\Vert }_2^2$$

(10)

where B is the set of edges in the graph. And $w\left(b\right)$, $d\left(b\right)$, ${\mathbf{Y}}_{m,i}^v$, and ${\mathbf{Y}}_j^v$ are the weight of the edge, the degree of the edge, the ith missing sample, and the jth no missing sample, respectively. To facilitate matrix operation, Equation (11) can be reformulated as

$$\underset{{\mathbf{Y}}_m^v}{\min }{\gamma }_{v}Tr\left({\mathbf{Y}}^v{\mathbf{L}}_{hyper}{\mathbf{Y}}^{vT}\right)$$

(11)

where ${\mathbf{Y}}_{hyper}$ denotes the hyper-Laplacian constructed on $\mathbf{S}$. ${\gamma }_v$ is the second adaptive weighting proposed in this paper, which is used to reduce the cost of parameter tuning. Refer to [32]; ${\gamma }_v$ can be solved by the Lagrange function, and its solution is shown as

$${\gamma }_v={\displaystyle \frac{{\mathbf{C}}^v}{{\sum }_{v=1}^V{\mathbf{C}}^v}}$$

(12)

where ${\mathbf{C}}^v=Tr\left({\mathbf{Y}}^v{\mathbf{L}}_{hyper}{\mathbf{Y}}^{vT}\right)$.

By merging Equations (5), (8) and (11), the objective function of the proposed method is designed as follows:

$$\begin{array}{c}\underset{{\mathbf{Y}}_m^v,\mathbf{S},{\mathbf{Z}}^v}{\min }{\displaystyle \sum _{v=1}^V}\left(\Vert {\mathbf{Y}}^v-{\mathbf{Y}}^v{\mathbf{Z}}^v{\Vert }_F^2+{\gamma }_{v}Tr\left({\mathbf{Y}}^v{\mathbf{L}}_{hyper}{\mathbf{Y}}^{vT}\right)\right)\hfill \\ +\beta {\displaystyle \sum _{v=1}^V}{\alpha }_v{\Vert {\mathbf{Z}}^v-\mathbf{S}\Vert }_F^2+{\Vert Ƶ\Vert }_{Sp}^p\hfill \\ s.t.Z=\Phi \left({\mathbf{Z}}^1,{\mathbf{Z}}^2,\dots ,{\mathbf{Z}}^V\right),{\mathbf{Z}}^v\ge 0,{\mathbf{Z}}^v={\mathbf{Z}}^{vT}\hfill \end{array}$$

(13)

where $\beta$ is a hyperparameter utilized to equilibrate the consensus term. Here, the term ${\parallel Ƶ\parallel }_{S_p}^p$ corresponds to the Enhanced Tensor component, as the Schatten-p norm enforces a stronger multi-view low-rank tensor structure. Meanwhile, the two learnable weights ${\gamma }_v$ and ${\alpha }_v$ in the second and third terms implement the Dual Adaptive Weight mechanism, controlling the contributions of each view in hypergraph structure preservation and consensus learning, respectively.

3.2. Optimization

We adopt ADMM approach to resolve the matrix variable $\{{\mathbf{Z}}^v,\mathbf{S},{\mathbf{Y}}_m^v\}$ and tensor $Ƶ$ of the proposed ETIMC. For the convenience of the solution, we introduce the auxiliary tensor $\mathcal{T}$, and the Lagrange function of Equation (13) is shown as

$$\begin{array}{c}\mathcal{L}\left({\left\{{\mathbf{Z}}^v\right\}}_{v=1}^V;{\left\{{\mathbf{Y}}_m^v\right\}}_{v=1}^V;\mathbf{S};\mathcal{T};{\left\{{\gamma }_v,{\alpha }_v\right\}}_{v=1}^V\right)\hfill \\ ={\displaystyle \sum _{v=1}^V}\left(\Vert {\mathbf{Y}}^v-{\mathbf{Y}}^v{\mathbf{Z}}^v{\Vert }_F^2+{\gamma }_{v}Tr\left({\mathbf{Y}}^v{\mathbf{L}}_{hyper}{\mathbf{Y}}^{vT}\right)\right)+\beta {\displaystyle \sum _{v=1}^V}{\alpha }_v{\Vert {\mathbf{Z}}^v-\mathbf{S}\Vert }_F^2\hfill \\ +{\Vert \mathcal{T}\Vert }_{Sp}^p+〈\mathcal{H},Ƶ-\mathcal{T}〉+{\displaystyle \frac{\rho }{2}}{\Vert Ƶ-\mathcal{T}\Vert }_F^2\hfill \end{array}$$

(14)

(1) Fixed other matrix variables except ${\mathbf{Z}}^v$, the optimization problem of ${\mathbf{Z}}^v$ can be solved by the following formula:

$$\underset{{\mathbf{Z}}^v}{\min }\Vert {\mathbf{Y}}^v-{\mathbf{Y}}^v{\mathbf{Z}}^v{\Vert }_F^2+\beta {\alpha }_v{\Vert {\mathbf{Z}}^v-\mathbf{S}\Vert }_F^2+〈{\mathbf{H}}^v,{\mathbf{Z}}^v-{\mathbf{T}}^v〉+{\displaystyle \frac{\rho }{2}}{\Vert {\mathbf{Z}}^v-{\mathbf{T}}^v\Vert }_F^2$$

(15)

Let the derivative of Equation (15) in regard to ${\mathbf{Z}}^v$ be 0, and we can obtain the resolution of ${\mathbf{Z}}^v$ as

$${\mathbf{Z}}^v={\left({\mathbf{Y}}^{vT}{\mathbf{Y}}^v+\beta {\alpha }_v\mathbf{I}+{\displaystyle \frac{\rho }{2}}\mathbf{I}\right)}^{-1}\left({\displaystyle \frac{\rho }{2}}{\mathbf{T}}^v-{\displaystyle \frac{1}{2}}{\mathbf{H}}_v+\beta {\alpha }_v\mathbf{S}+{\mathbf{Y}}^{vT}{\mathbf{Y}}^v\right)$$

(16)

To better obtain the potential representation of the original data, ${\mathbf{Z}}^v$ is further optimized and the final solution of ${\mathbf{Z}}^v$ is

$${\mathbf{Z}}^v=\left({\overline{\mathbf{Z}}}^v+{\overline{\mathbf{Z}}}^{vT}\right)/2$$

(17)

where ${\overline{\mathbf{Z}}}^v={\mathbf{Z}}^v-diag\left(diag\left({\mathbf{Z}}^v\right)\right)$.

(2) Fixed other matrix variables except $\mathbf{S}$, $\mathbf{S}$ can be resolved by the following equation:

$$\underset{\mathbf{S}}{\min }\beta \sum _{v=1}^V{\alpha }_v{\Vert {\mathbf{Z}}^v-\mathbf{S}\Vert }_F^2$$

(18)

Let the derivative of Equation (18) in regard to $\mathbf{S}$ be 0, and we can obtain the resolution of $\mathbf{S}$ as

$$\mathbf{S}={\displaystyle \frac{{\sum }_{v=1}^V\beta {\alpha }_v{\mathbf{Z}}^v}{{\sum }_{v=1}^V\beta {\alpha }_v}}$$

(19)

(3) By fixing all matrix variables except ${\mathbf{Y}}_m^v$, the optimization problem can be formulated as

$$\begin{array}{cc}\hfill \underset{{\mathbf{Y}}_m^v}{\min } & \mathrm{Tr}\left(\left({\mathbf{Y}}_n^v{\mathbf{M}}_n^v+{\mathbf{Y}}_m^v{\mathbf{M}}_m^v\right){\mathbf{L}}_{hyper}{\left({\mathbf{Y}}_n^v{\mathbf{M}}_n^v+{\mathbf{Y}}_m^v{\mathbf{M}}_m^v\right)}^T\right)\hfill \\ \hfill & +{∥\left({\mathbf{Y}}_n^v{\mathbf{M}}_n^v+{\mathbf{Y}}_m^v{\mathbf{M}}_m^v\right)\left({\mathbf{Z}}^v-\mathbf{I}\right)∥}_F^2.\hfill \end{array}$$

(20)

Let us define $\mathbf{A}={\mathbf{Y}}_n^v{\mathbf{M}}_n^v+{\mathbf{Y}}_m^v{\mathbf{M}}_m^v$. Then the objective function can be rewritten as

$$\underset{{\mathbf{Y}}_m^v}{min}\mathrm{Tr}\left(\mathbf{A}{\mathbf{L}}_{hyper}{\mathbf{A}}^T\right)+{\parallel \mathbf{A}({\mathbf{Z}}^v-\mathbf{I})\parallel }_F^2.$$

(21)

The derivative of the first term with respect to ${\mathbf{Y}}_m^v$ is given by

$${\displaystyle \frac{\partial }{\partial {\mathbf{Y}}_m^v}}\mathrm{Tr}\left({\mathbf{A}}^T{\mathbf{L}}_{hyper}\mathbf{A}\right)=2{\mathbf{M}}_m^v{\mathbf{L}}_{hyper}\mathbf{A}.$$

(22)

Similarly, the derivative of the second term is

$${\displaystyle \frac{\partial }{\partial {\mathbf{Y}}_m^v}}{\parallel \mathbf{A}({\mathbf{Z}}^v-\mathbf{I})\parallel }_F^2=2{\mathbf{M}}_m^v\mathbf{A}({\mathbf{Z}}^v-\mathbf{I})({\mathbf{Z}}^{vT}-\mathbf{I}).$$

(23)

By summing the two derivatives and setting the result to zero, we obtain the gradient equation,

$${\mathbf{M}}_m^v\mathbf{A}\left({\mathbf{L}}_{hyper}+({\mathbf{Z}}^v-\mathbf{I})({\mathbf{Z}}^{vT}-\mathbf{I})\right)=0.$$

(24)

Solving this equation for ${\mathbf{Y}}_m^v$ yields the closed-form solution

$${\mathbf{Y}}_m^v=\left({\mathbf{Y}}_n^v{\mathbf{M}}_n^v{\mathbf{R}}^v{\mathbf{M}}_m^{vT}\right){\left({\mathbf{M}}_m^v{\mathbf{R}}^v{\mathbf{M}}_m^{vT}\right)}^{-1},$$

(25)

where ${\mathbf{R}}^v=({\mathbf{Z}}^v-\mathbf{I})({\mathbf{Z}}^{vT}-\mathbf{I})+{\mathbf{L}}_{hyper}$.

(4) By fixing the other matrix variables except tensor $\mathcal{T}$, the issue became

$$\begin{array}{c}\underset{\mathcal{T}}{argmin}{\Vert \mathcal{T}\Vert }_{Sp}^p+〈\mathcal{H},Ƶ-\mathcal{T}〉+{\displaystyle \frac{\rho }{2}}{\Vert Ƶ-\mathcal{T}\Vert }_F^2\hfill \\ =\underset{\mathcal{T}}{argmin}{\displaystyle \frac{1}{\rho }}{\Vert \mathcal{T}\Vert }_{Sp}^p+{\displaystyle \frac{1}{2}}\Vert Ƶ+{\displaystyle \frac{\mathcal{H}}{\rho }}-\mathcal{T}{\Vert }_F^2\hfill \end{array}$$

(26)

To solve $\mathcal{T}$, we need to introduce the following Theorem 2:

Theorem 2.

Assume $\mathcal{T}\in R^{d\times N\times V}$, make $\mathcal{T}=\mathcal{U}\ast \mathcal{S}\ast {\mathcal{V}}^T$, for the following equation $\underset{Ƶ}{argmin}{\displaystyle \frac{1}{2}}{\Vert Ƶ-\mathcal{T}\Vert }_F^2+\rho {\Vert Ƶ\Vert }_{Sp}^p$, We can obtain the solution of $Ƶ$ as

$${Ƶ}^{*}={\Gamma }_{\rho ,V}\left(\mathcal{T}\right)=\mathcal{U}\ast ifft\left({\mathbf{P}}_{\rho ,\mathcal{V}}\left(\overline{\mathcal{T}}\right)\right)\ast {\mathcal{V}}^T$$

(27)

where ${\mathbf{P}}_{\rho ,V}\left(\overline{\mathcal{T}}\right)\in R^{d\times N\times V}$ denotes the ith frontal slice ${\mathbf{P}}_{\rho ,V}\left({\overline{\mathcal{T}}}^i\right)$ that can be solved by the Lemma 1 of [33]. Hence, the solution of $\mathcal{T}$ in Equation (26) can be achieved by the following formula:

$${\mathcal{T}}^{*}={\Gamma }_{{\displaystyle \frac{1}{\rho }}}\left(Ƶ+{\displaystyle \frac{1}{\rho }}\mathcal{H}\right)$$

(28)

(5) Update the multiplier $\mathcal{H}$,

$$\mathcal{H}=\mathcal{H}+\rho \left(Ƶ-\mathcal{T}\right)$$

(29)

To sum up, the entire optimization procedure for solving Equation (13) is summarized in Algorithm 1.

Algorithm 1 Optimization procedure of ETIMC

1: Input: Incomplete data ${\left\{{\mathbf{Y}}_n^v\right\}}_{v=1}^V$, transfer matrices ${\left\{{\mathbf{M}}_n^v\right\}}_{v=1}^V$, ${\left\{{\mathbf{M}}_m^v\right\}}_{v=1}^V$, trade-off parameter $\beta$, number of clusters k.   2: Initialize: $t\leftarrow 1$; set ${\{{\mathbf{Y}}_m^v\leftarrow 0\}}_{v=1}^V$, ${\{{\mathbf{Z}}^v\leftarrow 0\}}_{v=1}^V$, $\mathbf{S}\leftarrow 0$, $Ƶ\leftarrow 0$, $\mathcal{T}\leftarrow 0$, $\mathcal{H}\leftarrow 0$;                    set uniform weights ${\alpha }_v={\gamma }_v=1/V$; tolerance $\sigma ={10}^{-6}$ and maximum iteration $T_{max}$.   3: while not converged and $t\le T_{max}$ do (1) Update view-specific representations   4:       for $v=1$ to V do   5:             Update ${\mathbf{Z}}^v$ by Equation (17).   6:       end for   7:       Construct tensor $Ƶ=\Phi ({\mathbf{Z}}^1,\dots ,{\mathbf{Z}}^V)$. (2) Update consensus representation and hypergraph   8:       Update $\mathbf{S}$ by Equation (19).   9:       Construct the hypergraph Laplacian ${\mathbf{L}}_{hyper}$. (3) Update missing samples 10:       for $v=1$ to V do 11:             Update ${\mathbf{Y}}_m^v$ by Equation (25). 12:       end for (4) ADMM tensor splitting 13:       Update tensor $\mathcal{T}$ by Equation (28). 14:       Update multiplier $\mathcal{H}$ by Equation (29). (5) Update adaptive weights 15:       Update ${\alpha }_v$ and ${\gamma }_v$ using Equations (9) and (12). (6) Convergence check 16:       Compute residual $r^{\left(t\right)}={\parallel Ƶ-\mathcal{T}\parallel }_F/{\parallel Ƶ\parallel }_F$. 17:       if $r^{\left(t\right)}\le \sigma$ then 18:             break 19:       end if 20:       $t\leftarrow t+1$. 21: end while 22: Apply spectral clustering on $\mathbf{S}$. 23: Output: Clustering labels.

3.3. Computational Complexity

For the proposed ETIMC, the main calculation cost involves ${\mathbf{Z}}^v$, ${\mathbf{Y}}_m^v$, and $\mathcal{T}$. Concretely, updating ${\mathbf{Z}}^v$ takes $O\left(V{N}^3\right)$ and solving the subproblem of ${\mathbf{Y}}_m^v$ costs $O\left(V{(N-N_c)}^3\right)$. Updating the tensor $\mathcal{T}$ involves two stages of costs, namely singular value decomposition, fft and ifft operations. Thus, the total cost is $O(VNlog\left(VN\right)+V^{2}N)$. In summary, the overall computational complexity of the proposed ETIMC is $O(V{N}^3+V{N}^3+VNlog\left(VN\right)+V^{2}N)$ for every iteration.

To provide a more concrete comparison, we further report the estimated running times of ETIMC and two representative baselines (EE-R and UEAF) under the same CPU environment. Based on their theoretical complexities—EE-R: $O\left(N{k}^2\right)$, UEAF: $O\left(2N^3\right)$, and ETIMC: $O\left(2V{N}^3\right)$—we convert the dominant operation counts into runtime estimates normalized by the same computational throughput.

Table 1. Runtime comparison (in seconds).

Dataset	EE-R	UEAF	ETIMC (Ours)
ThreeSources	0.12	1.47	4.33
BBCSport	0.18	1.72	4.63
BBC	0.39	3.85	11.79

summarizes the results on ThreeSources, BBCSport, and BBC. The empirical training times of ETIMC are 4.33 s, 4.63 s, and 11.79 s, respectively, which align well with the complexity-derived estimates and confirm that ETIMC’s runtime grows proportionally with dataset scale. Although ETIMC incurs higher computational overhead, the hypergraph Laplacian mechanism and tensor regularization significantly improve clustering performance, rendering the additional cost worthwhile.

4. Experiment

4.1. Experiment Settings

To estimate the presented ETIMC, we selected three natural incomplete multi-view datasets, including ThreeSources (http://mlg.ucd.ie/datasets/3sources.html, accessed on 17 January 2025), BBCSport (http://mlg.ucd.ie/datasets/bbc.html, accessed on 17 January 2025), and BBC (http://mlg.ucd.ie/datasets/bbc.html, accessed on 17 January 2025). Meanwhile, we also chose a commonly utilized complete multi-view dataset named ORL (https://cam-orl.co.uk/facedatabase.html, accessed on 17 January 2025) can be constructed as incomplete data. We develop incomplete multi-view datasets by distinct pairing ratios ($\tau ={\displaystyle \frac{N_s}{N}}$) ranging from 0.1 to 0.9, with a step size of 0.2, where $N_s$ is the number of instances, and N is a randomly picked pair of samples that can be found in all perspectives. To avoid cases where all views of a sample are missing, we generate missing entries under a random-missing mechanism while enforcing the constraint that each instance retains at least one available view. This ensures both the reproducibility of the experimental setup and the feasibility of downstream reconstruction. A summary of these datasets is shown in

Table 2. Summary of four real-world datasets.

Datasets	Size	Clusters	Views	Features
ThreeSources	416	6	3	3560,3631,3068
BBCSport	737	5	2	3183,3203
ORL	400	40	3	4096,3304,6750
BBC	2225	5	4	4659,4633,4665,4684

.

We select eleven multi-view methods to compare with the proposed ETIMC. The comparison methods include MIC: incomplete multi-view clustering by weighted non-negative matrix decomposition; MKKM and MKKM-MKC: learning consensus representation via kernel-based multi-view methods; AWP: the consensus representation is obtained from the embedded matrix by an adaptive mechanism; PIC: multi-view clustering methods by weight strategy and spectral perturbation theory; APMC: learning the consensus graph through the anchor graph; UEAF: unifying representation matrix learning and inferences of missing samples into one step to acquire important information from multiple views; EE-R: learning the consensus matrix from the low-dimension representation obtained by incomplete multi-view; FLSD: seeking an embedded representation and consensus representation of each perspective via graphs and semantic constraints. DDMVC [34]: it utilizes contrastive learning and diversity objectives to learn diverse and distinguishable representations. This method achieves consistency across all views while preserving, to some extent, the inherent semantic information of each view; RecFormer [35]: is an information-recovery–driven deep incomplete multi-view clustering model that jointly performs feature learning and missing-data reconstruction through a two-stage self-attention autoencoder and a recurrent graph reconstruction mechanism.

We pick six commonly utilized evaluation criteria to measure the quality of the proposed ETIMC. These criteria include accuracy (ACC), normalized mutual information (NMI), purity (PUR), adjusted rank index (AR), F-score, and Precision, respectively. All evaluation criteria follow the principle that a higher value represents a better clustering effect. All the experimental results are the average values of 10 experiments.

4.2. Clustering Performance

The clustering performance of our proposed ETIMC and comparison method is shown in

Table 3. Clustering performance on natural incomplete datasets.

Datasets	Methods	ACC	NMI	PUR	AR	F-Score	Precision
ThreeSources	MIC	42.6	34.1	44.7	7.90	30.7	22.1
	MKKM	82.0	68.6	82.0	63.8	70.1	72.0
	AWP	76.4	67.1	76.4	66.2	72.7	67.0
	MKKM-MKC	75.3	61.5	75.3	51.3	59.8	61.1
	PIC	87.5	72.6	87.5	72.6	77.5	77.7
	APMC	81.9	67.4	81.9	63.7	70.1	70.7
	UEAF	83.5	68.1	83.5	65.8	71.9	72.6
	EE-R	71.9	57.3	71.9	50.0	58.6	60.5
	FLSD	88.7	74.3	88.7	75.5	79.9	79.9
	DDMVC	60.4	41.7	63.3	38.5	6.3	4.9
	RecFormer	42.6	22.2	43.2	14.3	25.7	46.1
	ETIMC	89.9	76.1	89.9	78.1	82.0	82.0
BBCSport	MIC	54.8	48.0	59.8	37.2	54.5	46.3
	MKKM	85.2	67.8	85.2	66.4	73.9	77.6
	AWP	94.0	82.8	94.0	84.7	88.3	87.7
	MKKM-MKC	83.8	65.8	83.8	63.9	71.9	75.7
	PIC	74.4	74.5	78.2	60.9	72.0	59.2
	APMC	72.9	72.6	76.4	55.4	68.6	54.3
	UEAF	87.5	70.4	87.5	69.8	76.8	77.3
	EE-R	82.3	59.2	82.3	60.1	69.0	72.4
	FLSD	92.7	80.1	92.7	81.1	85.6	84.9
	DDMVC	56.8	37.9	59.4	26.5	9.4	9.9
	RecFormer	32.4	4.4	39.1	0.7	14.2	39.2
	ETIMC	94.2	83.7	94.2	84.7	88.3	88.7
BBC	MIC	44.4	30.2	44.6	11.0	36.9	25.7
	MKKM	92.6	79.2	92.6	83.0	86.5	86.1
	AWP	72.6	61.6	72.6	51.4	63.1	53.1
	MKKM-MKC	91.6	76.5	91.6	80.6	84.6	84.1
	PIC	73.6	66.4	78.0	62.0	70.3	65.0
	APMC	-	-	-	-	-	-
	UEAF	92.4	78.8	92.4	82.4	86.0	85.3
	EE-R	88.8	70.8	88.8	74.5	79.7	79.2
	FLSD	89.8	74.1	89.8	77.4	82.0	81.2
	DDMVC	62.8	44.6	64.4	45.7	9.8	13.7
	RecFormer	36.1	5.4	38.3	4.7	22.3	22.8
	ETIMC	93.6	82.2	93.6	85.3	88.3	88.3

. The best results are displayed in bold. From the table, we can draw the following conclusions:

• Compared with other methods, the proposed ETIMC can achieve optimal performance on these three natural incomplete datasets. For instance, ETIMC is 3.8%, 8.1%, 3.8%, 7.9%, 6.3%, and 7.1% higher in terms of ACC, NMI, PUR, AR, F-score, and Precision than the second-best algorithm in the BBC dataset. This result indicates that hypergraph regularization, Schatten-p norm, and adaptive mechanism contribute to improving the performance of incomplete multi-view clustering.
• The performance of MIC on the three datasets is poor, which indicates that simply completing the incomplete samples using 0 or the mean value is not conducive to improving the performance of incomplete multi-view clustering. This method may introduce unnecessary noise and obtain incorrect information, leading to performance degradation. On the contrary, FLSD processes incomplete multi-view data by saving the locality of missing samples, and it can obtain better clustering results in most circumstances. However, our proposed ETIMC is superior to FLSD, indicating that capturing higher-order information between multiple perspectives applies to processing multi-perspective data.
• PIC, AWP, and UEAF methods outperform other methods in most cases. The reason is that these three methods all apply an adaptive mechanism, indicating that assigning reasonable weights to different views is also beneficial to the clustering results. The ETIMC develops adaptive weights in consensus representation learning and the construction of incomplete data items, which promotes the performance of the whole algorithm to a certain extent.
• The clustering performance of DDMVC and RecFormer shows a clear decline compared with traditional methods, mainly because deep models are well suited for analyzing data distributions in large-scale datasets but face greater difficulty when learning from small-scale data. Consequently, ETIMC exhibits a clear advantage over deep approaches on small datasets.

To verify the impact of missing samples on clustering performance, we simulated incomplete data on the ORL complete dataset, and the results are shown in Figure 2. A careful interpretation of Figure 2 leads us to the following conclusions:

• In different miss rates, our proposed ETIMC is superior to other comparison methods. On the one hand, ETIMC applies a dual adaptive mechanism to capture consistent information in incomplete multi-view data and infer incomplete samples with hypergraph constraints. On the other hand, tensor and hypergraph constraints can explore the higher-order information in incomplete multi-view data, which promotes the clustering performance.
• Generally, as pairing ratios increase, the performances of incomplete data improve. However, the ORL dataset reaches the best when the pairing ratio is 0.5, mainly because the incomplete data may be disturbed by noise. Since the proposed ETIMC adopts the dual adaptive weight mechanism, the hypergraph Laplacian regularization, and tensor constraint to process the incomplete multi-view data. Therefore, ETIMC has the ability to process noise data.

4.3. Ablation Study

In the proposed ETIMC, we stack the embedded representations obtained into third-order tensors to obtain higher-order information in incomplete multi-view data. Additionally, we introduce a dual adaptive weighting mechanism to distinguish the contribution degree of different views and reduce the cost of parameter tuning. To verify the effectiveness of the higher-order relationship and the dual adaptive weighting mechanism, we conducted ablation experiments on three incomplete datasets, shown in Figure 3. We can observe from Figure 3 that the performance of the proposed ETIMC is superior to RT and RW in all datasets, where RT and RW, respectively denote the results after the removal of tensor constraints and the dual adaptive weighting mechanism.

4.4. Parameter Analysis

The proposed ETIMC involves a parameter $\beta$ in Equation (13) that needs to be adjusted. To explore the effect of $\beta$ on the overall clustering performance, we performed parametric analysis experiments on ThreeSources, BBCSport, and BBC incomplete datasets. We report how $\beta$ changes in the range of $\{0.001,0.005,0.010,0.05,0.1,0.5,1,2,5,10,50,100\}$, shown in Figure 4. As seen from Figure 4, ACC, PUR, and F-score change correspondingly with the constant change in $\beta$, indicating that ETIMC proposed in this paper is sensitive to $\beta$.

4.5. Convergence Analysis

To illustrate the convergence of the proposed ETIMC, Figure 5 shows the change in the value of the objective function with the number of iterations. As can be seen from Figure 5, the objective function values of all three natural incomplete data converge within 30 iterations, indicating that the proposed ETIMC has good convergence.

5. Conclusions

In this paper, we propose a new method called ETIMC that can tackle multi-view data with missing samples. Different from previous approaches, ETIMC integrates higher-order relational learning, consistent information learning, and inference of incomplete data into one framework. By utilizing tensor constraints, dual adaptive weighted mechanism, and hypergraph Laplacian constraints, ETIMC can infer the internal association information between the missing samples and the available samples, which is conducive to acquiring a more suitable consensus matrix for final clustering tasks. However, the tensor operations in ETIMC impose high computational and memory costs on large-scale data. Future work will focus on introducing complexity-reduction techniques to improve its scalability.