- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes HCCIMC, a framework for incomplete contrastive multi-view clustering. It constructs a global consensus graph and aggregates multi-order random-walk representations to recover missing-view features. A neighborhood consistency contrastive learning module further selects reliable positive pairs using cross-view structural agreement. Experiments on four benchmark datasets demonstrate competitive clustering performance under different missing rates, supported by ablation and sensitivity analyses.
Critical strengths
- The paper addresses two important challenges in incomplete multi-view clustering: unreliable missing-view completion and insufficient positive-pair supervision. The proposed framework establishes a clear connection between these problems.
- The integration of high-order consensus propagation and cross-view neighborhood consistency is technically meaningful, enabling the exploitation of structural relationships for representation learning.
- Experiments across four datasets and multiple missing rates demonstrate strong clustering performance. The ablation and parameter sensitivity analyses further support the effectiveness of the main components.
Critical weaknesses
- The methodological novelty is somewhat limited, as high-order graph propagation and neighborhood-based contrastive learning have been explored in prior studies. The distinction from closely related approaches is not sufficiently established.
- The paper lacks direct evaluation of missing-view completion quality and positive-pair reliability, making it difficult to verify the effectiveness of the proposed high-order consensus mechanisms.
- The framework involves quadratic computational complexity with respect to the number of samples, but practical runtime, memory consumption, and scalability are not adequately evaluated.
Questions for authors
- Could the authors further clarify the methodological differences between HCCIMC and existing high-order graph propagation approaches, particularly their respective contributions to missing-view recovery?
- Could the authors provide direct evaluations of completion accuracy and positive-pair precision to substantiate the reliability of the proposed mechanisms?
- Could the authors provide runtime and memory comparisons with representative baselines to demonstrate the scalability of the proposed framework?
2 comments
W3: Scalability and computational efficiency.
Thank you for raising these important concerns. To further evaluate the scalability of HCCIMC, we conducted additional experiments on two larger-scale datasets, NoisyMNIST and CIFAR10, containing 70,000 and 50,000 samples, respectively.
We acknowledge that graph-based methods may incur considerable computational and memory overhead, particularly when constructing dense sample-wise affinity matrices and performing repeated graph operations. This limitation was also observed in our practical evaluations. Specifically, Mask-IMvC and GHICMC encountered out-of-memory (OOM) errors when processing NoisyMNIST. For reference, a single dense 70,000 × 70,000 float32 matrix requires approximately 18.25 GiB of GPU memory. We also observed substantial runtime overhead in SCVT, where its 500-epoch alignment stage required approximately 18 hours.
To address these computational challenges, we adopt a memory-efficient sparse graph construction and propagation strategy in our large-scale implementation, which consists of three key operations:
(1) Chunk-wise Similarity Computation. We divide the similarity computation process into chunks of 512 samples, avoiding the simultaneous allocation of the entire dense pairwise similarity matrix and thereby reducing peak GPU memory consumption.
(2) Top-K Neighborhood Sparsification. We retain only the Top-10 nearest neighbors for each sample and discard the remaining connections, constructing sparse neighborhood graphs whose storage requirements scale approximately linearly with the number of samples.
(3) Sparse Graph Representation and GPU-based Propagation. We use sparse representations for subsequent consensus graph construction and multi-order information propagation, avoiding unnecessary dense matrix operations and reducing downstream memory and computational costs.
Table 1. Clustering performance comparison on NoisyMNIST under different missing rates.
| Method | A(.1) | N(.1) | R(.1) | A(.3) | N(.3) | R(.3) | A(.5) | N(.5) | R(.5) | A(.7) | N(.7) | R(.7) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| DCP | 0.9871 | 0.9608 | 0.9718 | 0.7906 | 0.8632 | 0.7818 | 0.7785 | 0.8354 | 0.7585 | 0.8408 | 0.8167 | 0.7819 |
| CPSPAN | 0.5597 | 0.5906 | 0.4409 | 0.6274 | 0.5993 | 0.4654 | 0.6492 | 0.6219 | 0.5060 | 0.5395 | 0.5890 | 0.4466 |
| DVIMC | 0.9825 | 0.9524 | 0.9620 | 0.9220 | 0.8835 | 0.8623 | 0.9475 | 0.8765 | 0.8894 | 0.9189 | 0.8297 | 0.8329 |
| RPCIC | 0.8697 | 0.7675 | 0.7446 | 0.7615 | 0.6697 | 0.6196 | 0.5386 | 0.4960 | 0.4033 | 0.2608 | 0.2115 | 0.0951 |
| Mask-IMvC | O/M | O/M | O/M | O/M | O/M | O/M | O/M | O/M | O/M | O/M | O/M | O/M |
| HSACC | 0.9896 | 0.9679 | 0.9771 | 0.9581 | 0.9233 | 0.9380 | 0.9255 | 0.8592 | 0.8550 | 0.8889 | 0.7905 | 0.7773 |
| GHICMC | O/M | O/M | O/M | O/M | O/M | O/M | O/M | O/M | O/M | O/M | O/M | O/M |
| Ours | 0.9906 | 0.9705 | 0.9794 | 0.9782 | 0.9386 | 0.9527 | 0.9625 | 0.9033 | 0.9197 | 0.9421 | 0.8609 | 0.8777 |
Note: A, N, and R denote ACC, NMI, and ARI, respectively
Table 2. Training time of HCCIMC on NoisyMNIST under different missing rates.
| Missing Rate | Pre-train (s) | Contrastive (s) | Total (s) |
|---|---|---|---|
| 0.1 | 3725 | 6484 | 10215 |
| 0.3 | 4126 | 6594 | 10725 |
| 0.5 | 3842 | 6887 | 10735 |
| 0.7 | 4183 | 7028 | 11216 |
Overall, our additional experiments demonstrate that HCCIMC can effectively handle large-scale incomplete multi-view data. The proposed sparse computation strategies alleviate memory consumption and computational overhead, improving its practical scalability. Experiments on CIFAR-10 are still ongoing, and the results will be reported once completed.
W1: Methodological differences from existing high-order graph propagation approaches.
Thank you for raising this important question. We emphasize that higher-order propagation is not inherently more reliable, as increasing the propagation order may also introduce noisy or misleading structural relationships. Therefore, rather than simply relying on higher-order information, HCCIMC introduces an observation-constrained multi-order calibration mechanism specifically designed for missing-view recovery.
Specifically, HCCIMC first integrates cross-view consensus and view-specific structures to generate complementary multi-order representations through random walks. More importantly, instead of directly aggregating these representations or assigning fixed propagation weights, HCCIMC introduces an observation-constrained objective (Eq. (10)) to adaptively learn the contribution of each propagation order by minimizing the reconstruction discrepancy on observed samples. Ridge and entropy regularization further stabilize the optimization. The learned weights are then transferred to missing samples to recover their representations (Eq. (11)). Therefore, HCCIMC uses observed representations as explicit calibration references to determine how multi-order structural information contributes to missing-view recovery.
W2: Direct evaluation of completion accuracy and positive-pair precision.
Thank you for this valuable suggestion. To directly evaluate the reliability of HCCM, we measure the similarity between recovered representations and their original counterparts exclusively on masked sample-view pairs, without involving subsequent encoding or contrastive learning. Specifically, we report Cosine Similarity, MAE, and MSE on MSRA-6view and Hdigit under four missing rates (0.1, 0.3, 0.5, and 0.7).
Importantly, HCCM is not intended to exactly reconstruct the original view data, but rather to infer high-quality missing-view representations that preserve meaningful structural information and cross-view consistency for downstream clustering. Therefore, whether the original views can be reconstructed is not an appropriate criterion for evaluating our method, as view reconstruction is not our objective.
Table 1. Direct evaluation of HCCM completion quality under different missing rates.
The results show that HCCM maintains relatively stable representation similarity across different missing rates. Although reconstruction errors generally increase with more severe incompleteness, the recovered representations retain substantial similarity to their original counterparts.
Table 2. Average multi-order positive-pair precision on MSRA-6view under different missing rates.
To quantify positive-pair precision, we first construct multi-order neighborhood sets independently for each view, combining first-order and higher-order neighbors. We then obtain the cross-view consistent positive-pair set by taking the intersection of the neighborhood sets from two views. For evaluation, we exclude self-pairs and compare the selected sample pairs against their ground-truth labels. A pair is considered correct if the two samples share the same class label. Positive-pair precision is calculated as the ratio of correctly selected pairs to all selected pairs.
The results show that the proposed multi-order positive-pair selection mechanism maintains high semantic precision across different missing rates. Although the precision gradually decreases as the missing rate increases, it remains above 81% even under 70% missingness. This indicates that the cross-view consistency constraint effectively identifies semantically reliable positive pairs despite substantial view incompleteness, supporting the effectiveness of the proposed MNCCL mechanism.