- Rating
- 4(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes RMTC-GL for incomplete multi-view clustering. The method first constructs a Spearman correlation graph based on the feature rankings of observed samples, fitting observed associations and recovering missing ones through masking constraints. It then encourages diversity by imposing pairwise overlapping penalties on cross-view graph structures, and combines the recovered view-specific graphs with a shared consensus graph into a tensor, applying joint regularization via tensor nuclear norm. The authors solve the problem using alternating optimization and compare their method with nine others across six datasets and three missing rates, additionally providing ablation studies, parameter sensitivity analysis, and convergence analysis.
Critical strengths
- This paper addresses a promising research question in multi-view learning: when recovering missing information, one should not only leverage consistency across views but also avoid making all recovered views completely identical. This research motivation is well justified, and graph modeling provides a clear framework for discussing this issue.
- The experiments cover a broad range. Performance improvements on multiple datasets, along with ablation results for different components, indicate that the proposed framework deserves further investigation.
Critical weaknesses
1.Diversity constraints directly penalize the overlap of view graph structures, but it does not specify how to avoid weakening the consistency that is beneficial for clustering.
2.The additional contribution of tensor reorganization, compared with conventional low-rank regularization and consensus graph learning, is not clear enough.
3.In Table 2, the OIMC-IAGD on BBC4 and GUITAR on COIL show duplicate values, which need to be checked by the authors.
4.Some graph update formulas are inconsistent with the objective function, and it needs to be clarified which update method was actually implemented.
Questions for authors
1.Which differences does the diversity term aim to preserve in the view graph structures? How does it avoid weakening connections that correctly reflect the same clustering structure across different views?
2.What information can the proposed 'view-consensus graph' tensor construction capture that simple graph alignment or conventional low-rank tensor models cannot? Can this be verified experimentally on its own?
3.Please explain the repeated values in Table 2 and indicate whether, if there is an error in result compilation, correcting it would change the comparison conclusions between methods. Also, please clarify whether the graph updates in the actual implementation are consistent with the objective function in the paper.
2 comments
Raise my rating
My concerns have basically been addressed, and I decide to raise my rating to 4.
Please leave some comments for the authors!
Thank you for your thoughtful reviews. When you have a chance, please read the authors’ responses to your comments and update the discussion with your assessment. Please note whether your concerns have been addressed and briefly mention any remaining questions.