- Rating
- 3
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
CORE is a scalable multi-view clustering method that jointly learns sample-anchor representations and an anchor-level topology. Cross-view information is captured by applying tensor regularization to the view-specific representations, while spectral connectivity is imposed on the anchor graph to encourage cluster-oriented structure. The optimization is performed in the compact anchor space, which avoids constructing full sample-wise graphs. Experiments on ten multi-view datasets show strong clustering results and competitive computational efficiency.
Critical strengths
-
The use of an anchor-level topology provides an effective way to incorporate explicit structural information without constructing expensive sample-wise graphs. This design preserves the advantages of graph-based clustering while keeping the computational cost manageable for larger datasets.
-
The spectral connectivity constraint gives the learned anchor graph a clear clustering-oriented objective. Rather than relying only on cross-view consistency, CORE explicitly encourages the topology to reflect latent cluster structure, which is a meaningful addition to conventional anchor-based multi-view clustering.
-
CORE achieves strong performance across datasets with substantially different sample sizes and numbers of clusters, while maintaining competitive running time. The consistency of these results suggests that the proposed framework provides a favorable balance between clustering effectiveness and computational efficiency.
Critical weaknesses
-
The learned anchor topology is mainly evaluated through qualitative visualization, while its structural quality is not quantitatively analyzed. Since spectral connectivity is a key component of CORE, additional evidence on the resulting graph structure would further support the effectiveness of the topology learning strategy.
-
The number of anchors is selected from a predefined candidate set, but its influence on clustering performance and computational efficiency is not explicitly investigated. A more detailed analysis of the trade-off associated with different anchor numbers would improve the practical understanding of CORE.
Questions for authors
-
Can the authors provide quantitative analysis of the learned anchor topology, such as the number of connected components or the Laplacian spectrum, to complement the current visualization results?
-
How sensitive is CORE to the number of anchors , and how does affect the trade-off between clustering performance and computational efficiency?
-
The spectral embedding is learned to enforce the cluster-aware structure of the anchor topology, while the final clustering is performed on the concatenated sample-anchor representations. Can the authors further clarify the role of ?
-
Can the authors provide further discussion on how the anchor number is selected in practice and whether a similar range of works consistently across datasets with different scales and numbers of clusters?
3 comments
The added explanations and experiments address my concerns. I therefore keep my score.
Follow-up on our responses
Dear Reviewer 76ky,
Thank you again for your careful review and constructive suggestions. We appreciate your acknowledgment that our additional explanations and experiments have addressed your concerns regarding topology validation, anchor-number sensitivity, and spectral embedding.
We will incorporate these additional results and clarifications into the revised manuscript. We also appreciate your decision to maintain a positive assessment of our work.
Thank you very much for your time and consideration.
Best regards,
The Authors
We sincerely thank the reviewer for the careful evaluation and valuable feedback. The questions regarding topology validation and anchor selection are particularly helpful, and we have conducted additional experiments to address them.
W1 & Q1: Quantitative Validation of the Learned Topology.
We agree that visualization alone is insufficient to fully demonstrate the structural quality of the learned anchor topology. Following the reviewer's suggestion, we conducted an additional quantitative analysis of the Laplacian spectrum and connected components, comparing CORE with a variant that removes spectral connectivity while retaining adaptive topology learning. The results are summarized below:
The results demonstrate that CORE achieves the desired number of connected components with near-zero smallest c eigenvalues and a clear eigengap, whereas removing spectral connectivity produces a single connected component. This confirms that spectral regularization effectively guides the learned topology toward the expected cluster-oriented structure, providing quantitative evidence beyond the existing visualizations. We will include this analysis in the final version.
W2 & Q2: Anchor-Number Sensitivity and Performance–Efficiency Trade-off.
We thank the reviewer for the valuable suggestion regarding anchor-number sensitivity. To investigate the influence of m on clustering performance and computational efficiency, we conducted additional experiments on BDGP and NUS with m/c∈{2,3,5,10}, while keeping the remaining settings unchanged. The results are reported below:
The results reveal different sensitivity patterns across datasets. On BDGP, a relatively small anchor set is sufficient to characterize the underlying structure, resulting in stable clustering performance as m increases. In contrast, NUS benefits from additional anchors, which provide greater capacity to capture complex structural relationships. Meanwhile, the running time increases with m on both datasets. These observations highlight the importance of balancing structural representation capacity and computational efficiency. We will include these additional results and further discuss this trade-off in the final version.
Q3: Role of the Spectral Embedding F.
The spectral embedding F∈Rm×c serves as an anchor-level structural variable rather than the final sample-level clustering representation. Specifically, minimizing Tr(F⊤LGF) under F⊤F=Ic selects the eigenvectors corresponding to the smallest eigenvalues of LG, characterizing the connectivity structure of the anchor graph. The pairwise distances between the rows of F further participate in updating G, encouraging cluster-oriented relationships among anchors.
The structural information encoded by F is subsequently transferred to Bv through Laplacian regularization. Since the final clustering requires sample-level assignments, the refined representations are concatenated as H=[B1,…,BV], followed by SVD and k-means. Consequently, F provides cluster-aware structural guidance during optimization, while H integrates the refined multi-view representations for final clustering. We will clarify their distinct roles in the revised manuscript.
Q4: Practical Selection of Anchor Numbers.
In practice, we recommend m∈{2c,3c,5c,10c} as a candidate range, with the selection guided by clustering stability, graph spectral properties, and computational cost. As illustrated by the sensitivity results on BDGP and NUS, different datasets may favor different anchor ratios. Furthermore, ensemble clustering across multiple anchor settings could potentially integrate structural information at different granularities and reduce dependence on a single anchor number. We will further investigate this direction in future work.
Overall, we appreciate the reviewer's constructive feedback and hope our responses reinforce your favorable assessment of the paper.