- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes Multi-Granularity Relational Learning for Incomplete Multi-View Clustering (MGRL-IMVC). The framework learns from incomplete observations without imputing missing features by integrating three relational granularities. Unified-space relational learning mines potential positive and negative pairs, cross-view structural learning weights contrastive constraints using neighborhood affinity concentration, and soft prototype alignment estimates cross-view cluster correspondences through co-occurrence of soft assignments. Experiments on five benchmarks under different missing rates demonstrate competitive clustering performance.
Critical strengths
-
The paper explores multi-granularity relational learning for incomplete multi-view clustering, integrating sample-level relations, neighborhood structures, and cluster-level semantics without explicit missing-view imputation.
-
The soft prototype alignment mechanism uses commonly observed samples to estimate cross-view prototype correspondences, providing a reasonable approach to addressing inconsistent cluster assignments across views.
-
The experiments cover five datasets under different missing rates. The ablation studies and visualizations provide empirical evidence for the benefits of combining multiple relational objectives.
Critical weaknesses
-
The structural reliability score (W_{ii}) in Eq. (6) measures the concentration of a normalized affinity distribution rather than the correctness of cross-view relations. Incorrect but concentrated affinities can receive equally high weights, making its interpretation as relation reliability insufficiently justified.
-
Eq. (7) scales only the positive logit by (W_{ii}), whose effect depends on the sign of the cosine similarity. For negative similarities, decreasing (W_{ii}) can increase the positive softmax probability. This behavior complicates its interpretation as consistently suppressing unreliable relations.
-
The positive and negative relations in Eq. (4) are mined from the evolving unified representation space, where cross-view comparability is not guaranteed during early training. Incorrect relations may therefore be reinforced through subsequent contrastive optimization. No direct analysis of mined-relation quality or its evolution is provided.
-
The prototype alignment mechanism lacks important optimization details, including the K-means refresh schedule and gradient treatment of prototypes and correspondence weights. Moreover, the unnormalized co-occurrence matrix (R) makes the alignment loss dependent on the number of co-observed samples, while Fig. 3 does not directly establish prototype-matching correctness.
Questions for authors
-
How can distinguish a concentrated affinity on the correct counterpart from an equally concentrated affinity on the wrong sample?
-
How is the reliability-weighting behavior in Eq. (7) justified when the positive cosine similarity is negative?
-
Can the authors report the precision and recall of mined positive and negative relations throughout training to verify that relation quality improves?
-
How frequently are K-means prototypes updated, which quantities receive gradients, and can the authors provide quantitative prototype-matching accuracy?