- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper addresses the multi-view clustering problem in the presence of heterogeneous noise, and proposes a new method called CGQRL, which aims to enhance the modeling of the relationships between samples by leveraging the quality of the features. Specifically, given multi-view data, CGQRL first measures the quality of the samples based on the dynamic quality estimation module. Then, the quality of the samples is incorporated into the subsequent sample relationship learning and cross-view relationship analysis to enhance the clustering performance.
Critical strengths
-
This paper ingeniously combines the adaptive construction of neighbor relationships with feature quality, enabling the structured information to be dynamically updated and capable of handling multi-view scenes with noise.
-
The experiments in the paper include a wide range of datasets and noise contamination rates, and the measurement indicators include ACC, NMI, ARI, and RI, providing compelling support for the effectiveness of the proposed method.
Critical weaknesses
-
Many details of the experiments are not explained clearly. For instance, in different experimental procedures, are the settings for pollution the same?
-
There is a lack of explanation regarding the reasons for the different performance of the method on different datasets.
Questions for authors
-
For each experiment, it was conducted five times. What were the settings for these five experiments? What were the differences in the pollution settings and the model settings among the five experiments?
-
As shown in Table 2, the improvement in clustering effect of the proposed method varies across different datasets. Why is this so?
-
When the given dataset contains mostly reliable samples with a relatively low proportion of noise, how does the proposed CGQRL method perform?
2 comments
Thanks for the response. After reading the response and the comments from other reviewers, I think my score is appropriate, and I am currently inclined to keep it as it is.
Experimental Protocol and Robustness
We sincerely appreciate your thoughtful questions regarding the construction of the experimental runs, the dataset-dependent performance gains, and the behavior of CGQRL under low corruption. These questions provide an important opportunity to clarify the fairness of our evaluation protocol and the conditions under which the proposed method is most effective. We address each question below.
Question 1. How are the five experimental runs constructed? Are corruption realizations independently resampled across runs, or do the runs share the same corrupted datasets and differ only in model initialization?
A1: Thank you for requesting this clarification. The corruption protocol approximates a realistic multi-view setting in which observation quality varies across samples and views, rather than imposing a binary division between entirely clean and entirely corrupted multi-view samples. Some sample-view observations remain unaffected, whereas others undergo mild to severe degradation caused by illumination changes, motion artifacts, sensor instability, or transmission noise.
We model corruption prevalence and severity separately. Within each view, a proportion ρ of sample-view observations is selected for perturbation. Each selected observation receives an intensity α∈{0.2,0.4,0.6,0.8,1.0} and is generated as
\qquad \epsilon_i^{(v)}\sim\mathcal{N}(0,I).$$ A smaller $\alpha$ retains more of the original observation, whereas a larger $\alpha$ represents more severe degradation. The protocol therefore varies both the location and severity of corruption at the sample-view level. For each dataset and corruption ratio, we generate five corruption realizations indexed by $s\in\{0,1,2,3,4\}$. The corruption seed determines the selected observations, perturbation intensities, and Gaussian noise values. Each realization is generated once, stored, and reused by all methods. Each method is trained once on each stored realization. In run $s$, all methods receive the same corruption file indexed by $s$, while the corresponding run-specific training seed controls parameter initialization and mini-batch ordering. Therefore, the five runs vary in both corruption realization and training randomness, while comparisons across methods remain paired under identical corrupted inputs. **Question 2. Could the authors explain why the performance gains differ across datasets?** **A2:** Thank you for raising this question. The gains vary across datasets because the available views differ in their structural information and in how strongly corruption disrupts the sample relations used for clustering. The datasets have markedly different configurations: HW2sources contains 2,000 samples represented by two views, whereas MSRCV16view contains 210 samples represented by six views; Mfeat also has six views but contains 2,000 samples. Thus, the number of observations available to establish relations, as well as the information supplied by each view, differs across datasets. Their measured responses to corruption are also distinct. As the corruption ratio increases from 0.1 to 0.7, CGQRL's ACC decreases by 13.10 points on HW2sources, 5.14 points on MSRCV16view, and 3.32 points on Mfeat. These differences suggest that the same corruption ratio does not disrupt the clustering structure equally across datasets, which helps explain why the observed gains vary. **Question 3. How does CGQRL perform when the corruption ratio is low and most observations remain reliable?** **A3:** Thank you for raising this question. The main experiments include $\rho=0.1$, and CGQRL remains competitive or superior in this regime. At $\rho=0.1$, CGQRL ranks first on 14 of the 24 dataset-metric combinations. It leads all four metrics on HW2sources, MSRCV16view, and MNIST-4, and achieves the best ACC and F1 on Mfeat. The gains are particularly clear on MSRCV16view, where CGQRL improves over the strongest baseline by 5.71, 7.50, 8.72, and 6.02 percentage points in ACC, NMI, ARI, and F1, respectively. On MNIST-4, the corresponding gains are 8.83, 5.71, 8.79, and 11.94 points. On Hdigit and COIL20, CGQRL remains close to the strongest baseline: its four metrics are within 1.00 point on Hdigit and within 1.02 points on COIL20. Thus, the method does not sacrifice performance when corruption is sparse, even when a strong baseline is already near saturation. These results show that the quality-to-relation mechanism remains effective when perturbations are sparse. Most sample-view evidence is unchanged, and the model preserves consistent relations while limiting the influence of perturbed observations. Gains are naturally smaller when baseline relations are already reliable or performance is near saturation.