- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes PCGBAL, a framework for completely unaligned multi-view clustering that couples pseudo-correspondence discovery with representation learning. Its main contribution is to use evolving cross-view matches as supervision for both instance-level and cluster-level learning. Masked graph reconstruction learns view-specific structural representations; reciprocal-neighbor matching and self-paced selection identify pseudo-correspondences; and feature synchronization with prototype-based instance-to-cluster alignment refines the representations used for subsequent matching. For final clustering, auxiliary-view representations are softly aligned to the template view, concatenated, and processed by k-means. Experiments on eight benchmark datasets against seven competing methods report competitive clustering performance, with component ablations providing further support for the design.
Critical strengths
The paper is well organized and reports strong clustering performance. The motivation, method, and experimental evaluation follow a clear logical progression, making the overall framework easy to understand. In the reported comparisons with seven state-of-the-art methods, PCGBAL achieves the highest ACC on all eight datasets. Component ablations across the eight datasets further support the main design choices, while the template-view and hyperparameter analyses provide useful information about the method’s behavior.
Critical weaknesses
The paper reports average results without showing the variability across runs. Section 4.2 states that each experiment is repeated ten times. Please include standard deviations or confidence intervals in the result tables to assess stability, particularly when improvements over baselines are small.
Questions for authors
-
Why is the within-view graph neighborhood size fixed at k=5 across all datasets? Appendix E.2 studies κ for cross-view matching, but this differs from the k used to construct the MTMM graphs. Please explain the rationale for k=5 and whether clustering performance is sensitive to this choice.
-
Could the cluster-balance regularizer harm clustering when the selected pairs are correct but unevenly distributed across classes? Self-paced selection may select more pairs from easier-to-match classes, so correct matching does not imply a uniform class distribution. Equation (8) still pushes the average cluster probabilities toward a uniform distribution. Please explain whether this could interfere with correct predictions and why this target is appropriate.
-
Could the authors provide quantitative metrics to directly evaluate the accuracy of the discovered cross-view correspondences? Figure 2 presents clustering performance at different unaligned rates, but the final clustering results do not directly show whether these correspondences are accurate. Please report additional metrics, such as pairing precision or the proportion of same-class pairs, to better substantiate the reliability of the discovered correspondences.
Response to Reviewer eTtT
Reviewer 3 (eTtT)
We thank the reviewer for the constructive comments.
W1. Mean and Standard Deviation of Experimental Results over Ten Runs
Each experiment was repeated ten times, and ACC, NMI, and Purity are reported as mean ± standard deviation (%). Representative results on Handwritten are shown below.
The main text reports mean values, while the revised appendix provides means and standard deviations for all metrics across all datasets.
Q1. Rationale and Sensitivity of the Within-View Neighborhood Size
The parameter k denotes the number of nearest neighbors used to construct each within-view k-NN graph. We fix k=5 to preserve local structure while limiting noisy edges. To validate this choice, we conduct a sensitivity analysis of k∈{3,5,10,15,20} on seven completely unaligned datasets. Representative results (%) on Handwritten and UCI3view are shown below.
The results show that k=5 achieves the highest ACC and Purity with competitive NMI, supporting our fixed setting. The analysis has been added to the revised manuscript.
Q2. Cluster-Balance Regularization under Class Imbalance
The regularizer βKL(pˉu∥uK) acts as a soft constraint to prevent cluster collapse rather than enforcing equal class proportions. Since pˉu is computed over all samples, unevenly selected pseudo-correspondences do not directly determine the regularization term. However, the uniform prior may affect clustering when the true class distribution is imbalanced.
To investigate this effect, we construct balanced (80,80,80,80,80) and imbalanced (200,100,50,25,25) subsets from Hdigit, each containing 400 samples. We vary β while keeping other settings fixed. The comparison results (%) are shown below.
The results indicate that appropriately weighted cluster balancing can remain effective under unequal class proportions, although its effectiveness depends on the regularization strength. The experiment and analysis have been added to the revised ablation section.
Q3. Quantitative Evaluation of Cross-View Correspondences
We evaluate active cross-view candidates on the completely unaligned Handwritten dataset. A candidate is semantically correct when both samples belong to the same ground-truth class. Let P be the fixed candidate pool, S⊆P its same-class candidates, and Ac the active candidates at epoch c. Semantic recall and coverage are defined as SRc=∣S∣∣Ac∩S∣ and Coveragec=∣P∣∣Ac∣, respectively. The results are shown below, with the first 100 epochs serving as warm-up.
As training progresses, more same-class relations are recovered. The corresponding analysis has been added to the revised ablation study.