- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes the anchor-based multi-view clustering framework (HONR). The proposed method adopts random walks to capture indirect sample–anchor connections and construct a compact tensor for clustering. Experiments (including ablation and convergence analyses) show some advantages of the method.
Critical strengths
- S1. The proposed HONR incorporates high-order neighbor information via anchors. The computational complexity scales linearly with the number of samples under fixed settings.
- S2. Across seven benchmark datasets, HONR achieves competitive clustering results against eight baselines. Ablation studies also show the effectiveness of different components.
Critical weaknesses
- W1. HONR mainly combines existing techniques, including random walks, tensor recovery, and view regularization. The transition tensor and view graph are fixed before optimization, leaving limited novelty in their integration.
- W2. In Eq. (3), transitions from different orders are directly summed before tensor construction. The resulting tensor captures aggregated information, with limited distinction between individual orders.
- W3. The regularizer in Eq. (5) encourages consistency between similar views. Its ability to model heterogeneous view relationships is not sufficiently demonstrated.
- W4. Current ablations provide limited comparisons with alternative transition constructions and rank penalties. Runtime and memory comparisons are also missing despite the scalability claim.
- W5. Section 4.1 uses a bounded penalty parameter, while Theorems 4.1 and 4.2 require summable reciprocals of this parameter. The stated convergence conditions appear inconsistent with a finite upper bound.
Questions for authors
Please see the weaknesses above.