- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes a discrete co-evolution framework for multi-view clustering (DCoE). The method jointly refines multi-resolution view partitions and a discrete consensus, with theoretical conditions for one-hot local maximizers of the relaxed consensus problem. Experiments show competitive results against baselines.
Critical strengths
- Discrete updates use exact reassignment gains, while group statistics avoid constructing large similarity matrices. This improves computational efficiency.
- The paper derives sufficient conditions for one-hot local maximizers of the relaxed consensus problem and verifies these conditions experimentally.
- DCoE achieves the best ACC on eleven datasets against thirteen baselines. Ablation studies and runtime comparisons further support its effectiveness and efficiency.
Critical weaknesses
- The mutual refinement of view partitions and consensus in DCoE has also been explored in CMVC [1]. What is the main difference between the two methods?
- The partition hypergraph consistency term in Eq. (3) is closely related to category utility, with an additional term depending on consensus cluster sizes. What is the benefit of using the hypergraph formulation?
- The relaxed assignments in Table 5 are already close to one-hot, while DCoE and Relaxed-F use different optimization methods. It is unclear whether the improvement in Table 3 comes from direct discrete optimization or the difference between the solvers.
- Table 3 shows improvements over Fixed-G, but it is unclear whether consensus feedback can correct noisy or inaccurate view partitions. Could the authors provide more evidence of this process?
- The ablation study does not separately examine the contributions of multiple resolutions and adaptive weights. Comparisons with a single resolution and fixed weights would be useful.
- The running times of DCoE in Table 4 are identical to its optimization times in Appendix A.6 (Table 6). Does the reported time include initialization and preprocessing?
ref: [1] Hongfu Liu and Yun Fu. 2018. Consensus Guided Multi-View Clustering. ACM Trans. Knowl. Discov. Data 12, 4, Article 42 (August 2018), 21 pages. https://doi.org/10.1145/3182384
Questions for authors
See the weakness.