- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
In this manuscript, the authors argue that existing multi-view clustering methods primarily focus on cross-view relationships while overlooking structural diversity within individual views. To address this issue, they propose LIVC, which aims to exploit intra-view complementarity in high-dimensional multi-view clustering. LIVC constructs raw, main, and graph branches for each view and coordinates their representations through contrastive learning. It then performs granularity-aligned cross-view enhancement using attention and gating mechanisms, followed by low-rank bilinear fusion. The resulting representations are clustered using K-means. Experiments on five multi-omics benchmarks demonstrate strong clustering performance.
Critical strengths
1.LIVC presents a well-designed framework. Although it builds on conventional techniques such as PCA and KNN, the integration strategy is thoughtful.
2.LIVC achieves strong clustering performance on the evaluated multi-omics benchmarks, demonstrating its effectiveness in high-dimensional, small-sample settings.
Critical weaknesses
1.The motivation of this manuscript is that “relying on a single representation may therefore fail to capture these structures (heterogeneous and complementary structural patterns) simultaneously”. However, it seems not so straightforward to me. In existing MVC research, one important motivation for modeling inter-view complementarity is that excessive emphasis on consistency may suppress view-specific information. However, the manuscript does not establish an equally clear motivation for intra-view complementarity. I think more clarifications are necessary to establish the significance of this concept.
2.It is also unclear how interactive view expansion enhances complementarity within views. In IVE, each view is expanded to three branches: raw branch, main branch and graph branch. However, there is limited evidence on whether the three branches are complementary. Since both the main and graph branches are derived from the original view, which is also retained as a separate branch, the proposed expansion seems closer to feature engineering or representation enhancement.
Questions for authors
1.Why is it necessary to explicitly construct multiple intra-view representations rather than learning these structural properties directly from the original data? What limitations of single-representation learning does LIVC specifically address with intra-view complementarity?
2.What evidence supports the claim that the three branches capture complementary, rather than largely redundant, information?
3.Eq. (5) and Eq. (6) primarily encourage consistency across branches and views, while Eq. (10) aggregates the transformed representations through attention. How does this process specifically identify or exploit complementary information, rather than simply combining multiple representations?
4.LIVC is only evaluated on multi-omics benchmarks which may be highly similar in structures. Since LIVC is proposed as a general method for high-dimensional multi-view clustering, more heterogeneous benchmarks should be included.
3 comments
Reply to Reviewer saW3 (Part 2 of 2)
Q2:
We conduct two analyses to examine whether the three branches capture complementary rather than largely redundant information.
First, the neighborhood analysis examines same-class relationships identified by the three learned branch representations. Main and Graph identify distinct same-class KNN edges absent from the learned Raw representation, with their overlap accounting for only 3.57%–4.50% of the newly identified same-class edges across five datasets. Moreover, the fused representation consistently retains a higher proportion of newly identified same-class edges than different-class edges, suggesting that these structural differences are relevant to clustering rather than merely arbitrary variations.
Second, the frozen-representation prediction experiments evaluate the incremental discriminative value of combining branches. For example, on STAD, adding Graph to Raw+Main reduces held-out prediction log-loss by 0.0184 ± 0.0033 nats, with positive gains across all five seeds. Although the gains vary across datasets, these results suggest that the learned branches are not merely redundant copies but expose distinct clustering-relevant relationships that can provide additional predictive value.
Please refer to Dpyw W1 for the detailed experimental results.
Q3:
The contrastive objectives in Eqs. (5) and (6) encourage sample-level semantic consistency rather than forcing different branches to become identical. Since Raw, Main, and Graph are constructed with distinct structural inductive biases, they can retain different neighborhood relationships while learning semantically aligned representations.
Complementary information is exploited through the subsequent enhancement and aggregation mechanisms. Specifically, same-granularity cross-view attention identifies relevant information from corresponding branches across views, while learnable gates adaptively regulate its contribution. In Eq. (10), the enhanced Raw representation serves as the semantic anchor, and attention selectively integrates information from the enhanced Main and Graph branches. The residual formulation preserves the Raw representation while incorporating additional global and local structural cues. Furthermore, the reconstruction objectives encourage information preservation throughout this process.
Therefore, contrastive learning establishes semantic correspondence, whereas attention, gating, and residual aggregation enable adaptive exploitation of different structural perspectives. Although these mechanisms do not explicitly maximize structural novelty, the complementary neighborhood relationships and incremental discriminative gains provide empirical support for their effectiveness. Please refer to Dpyw W1 for the detailed analysis.
Q4:
To evaluate LIVC beyond multi-omics datasets, we conduct additional experiments on the Yale face-image dataset, which differs substantially from the biological data used in the original evaluation. Yale contains 165 samples, 15 clusters, and 3 views, with feature dimensions of 4096, 3304, and 6750, respectively. This provides an additional high-dimensional multi-view setting with different data characteristics.
We compare LIVC with 11 representative multi-view clustering methods. As shown in the following table, results are reported as ACC/NMI/PUR (%) over five random seeds.
| Method | ACC (%) | NMI (%) | PUR (%) |
|---|---|---|---|
| GMAE | 47.03 ± 15.47 | 52.30 ± 15.14 | 48.00 ± 15.21 |
| MCSF | 62.91 ± 0.51 | 69.52 ± 0.71 | 62.91 ± 0.51 |
| MISCC | 27.52 ± 1.31 | 39.59 ± 1.39 | 30.30 ± 0.94 |
| WAH-MVC | 18.79 ± 6.73 | 19.35 ± 10.30 | 18.91 ± 6.71 |
| GMVC | 31.27 ± 1.82 | 36.70 ± 2.61 | 32.61 ± 1.93 |
| SSLNMVC | 36.36 ± 4.20 | 41.11 ± 7.05 | 37.58 ± 4.75 |
| AEMVC | 60.00 ± 4.98 | 61.27 ± 4.76 | 60.24 ± 4.97 |
| DMVC-MIC | 29.82 ± 0.79 | 37.89 ± 0.98 | 32.36 ± 0.33 |
| SCMVC | 44.12 ± 6.81 | 49.46 ± 6.20 | 45.21 ± 6.78 |
| ACCMVC | 38.42 ± 4.75 | 43.86 ± 2.97 | 39.88 ± 4.23 |
| SEM | 29.70 ± 4.73 | 38.01 ± 3.94 | 31.39 ± 4.87 |
| LIVC | 63.76 ± 0.59 | 68.92 ± 1.35 | 63.76 ± 0.59 |
On Yale, LIVC achieves the highest ACC (63.76%) and PUR (63.76%), while its NMI (68.92%) is close to the best result of 69.52% obtained by MCSF. These results show that LIVC remains competitive on a high-dimensional face-image dataset with substantially different characteristics from multi-omics data, providing additional evidence of its applicability beyond the original benchmarks.
I appreciate the authors' efforts in addressing my concerns. Their clarification of the motivation behind intra-view complementarity, particularly the difficulty of simultaneously capturing heterogeneous structural relationships without explicit structural constraints, addresses my primary concern. The additional experimental evidence further supports their claims. Therefore, I am willing to raise my rating to 3.
Reply to Reviewer saW3 (Part 1 of 2)
Thanks for your careful review. We are glad to address your questions one by one.
W1:
We thank the reviewer for highlighting the need to clarify our motivation. Inter-view complementarity primarily concerns information differences across views, whereas intra-view complementarity concerns heterogeneous structural patterns within the same view. In high-dimensional data, global principal variations, local neighborhood relationships, and potentially discriminative fine-grained information may coexist, but different representations emphasize these structures differently. PCA reconstruction highlights dominant global structure while potentially suppressing low-variance discriminative information; KNN smoothing enhances local neighborhood consistency but may blur cluster boundaries. Meanwhile, the Raw branch preserves original information, although its learned embedding may not adequately express all clustering-relevant relationships. Therefore, intra-view complementarity addresses the limitations of relying on a single structural perspective, rather than introducing new information absent from the original data.
Main and Graph identify distinct same-class neighborhood relationships absent from the learned Raw representation, with only 3.57%–4.50% overlap among their newly identified edges. Please refer to
DpywW1 for the detailed neighborhood complementarity analysis. These observations support our motivation that a single learned representation may not adequately express different clustering-relevant structural relationships within the same view.W2:
We thank the reviewer for this important observation. We acknowledge that PCA reconstruction and KNN smoothing are deterministic transformations of the original view and do not introduce new information. However, the purpose of IVE is not to generate additional raw information, but to expose different clustering-relevant structural relationships through complementary inductive biases. Specifically, Raw preserves original information, Main emphasizes global principal structure, and Graph highlights local neighborhood relationships. These representations are encoded through a shared view-specific encoder and coordinated by intra-view contrastive learning, enabling subsequent modules to exploit their distinct structural characteristics.
To evaluate whether these structural transformations provide useful complementary information, we conduct additional experiments. The frozen-representation prediction experiments show that combining different branches can provide additional discriminative value. For example, adding Graph to Raw+Main on STAD reduces held-out prediction log-loss by 0.0184 ± 0.0033 nats, with positive gains across all five seeds. Please refer to
DpywW1 for details. Furthermore, the branch-combination ablation shows that the full three-branch configuration improves CESC ACC from 51.35% (Raw only) to 93.92%, outperforming both two-branch variants. Please refer toDpywQ1 for details.Although these transformations constitute structural feature engineering, their incremental predictive contributions and clustering improvements support the practical value of jointly exploiting different structural representations within LIVC.
Q1:
The key limitation of single-representation learning is not insufficient expressive capacity, but the difficulty of simultaneously capturing heterogeneous structural relationships without explicit structural constraints. In high-dimensional, small-sample settings, a single encoder trained directly on raw features may favor dominant patterns while insufficiently representing local neighborhood relationships or subtle discriminative information. Consequently, some clustering-relevant structures present in the original data may remain inadequately expressed in the learned representation.
LIVC addresses this limitation by explicitly introducing complementary structural inductive biases rather than relying entirely on implicit structure discovery. Specifically, Raw preserves original information. The Main branch uses PCA reconstruction to emphasize global principal structure, while the Graph branch uses KNN smoothing to highlight local neighborhood relationships. These branches provide distinct structural perspectives before encoding, while the shared view-specific encoder enables coordinated representation learning and subsequent integration.
Thus, explicit multi-branch construction does not introduce new information or imply that a single encoder is inherently incapable of learning these structures. Instead, it reduces reliance on implicit structural discovery and mitigates the risk of overlooking clustering-relevant relationships. The neighborhood complementarity analysis further supports this motivation. Please refer to
DpywW1 for details.