- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper studies aligned multi-modal graphs whose modality-specific optimal partitions may differ. Its target is their common refinement: each consensus cluster is a non-empty intersection of one cluster from every modality. Algorithm 1 computes the bottom k_i eigenvectors of each normalized Laplacian, concatenates the vertex embeddings, and applies k-means. The design aims to preserve complementary distinctions without forcing identical partitions. The paper claims an indicator-space approximation theorem and a clustering-error guarantee under strong clusterability and balance assumptions. It also proposes cost-threshold estimation of k and a practical signature-based merging heuristic. Validation comprises synthetic SBMs and three real-source datasets modified by zeroing features of selected classes, with an additional contrastive-representation variant. The empirical results are promising in these settings.
Critical strengths
1.A clear formulation for complementary modalities. Defining consensus clusters as the common refinement provides an explicit target when different modalities reveal distinct, meaningful aspects of the same samples.
2.A transparent method with encouraging reported results. Spectral-embedding concatenation followed by k-means is straightforward to implement and inspect. The experiments demonstrate potential benefits in the constructed settings, and Ours+CRL reports the highest ACC on all three modified real-source datasets.
Critical weaknesses
1.The specific contribution of the proposed clustering mechanism is not sufficiently isolated. The core algorithm combines modality-specific spectral embeddings through concatenation and k-means, but the experiments omit the directly relevant baseline of independently clustering each modality and intersecting the resulting partitions. This comparison is particularly important because the practical heuristic itself uses independent clustering assignments to merge clusters. Furthermore, the strongest results come from Ours+CRL, which adds an existing representation-learning component. Without comparing alternative clustering methods on the same learned features, the results do not establish how much improvement comes from the proposed clustering mechanism.
2.The experimental evidence is narrower than the intended application scope. The real-source datasets are modified by zeroing features of selected classes to create modality-specific cluster mergers, while the synthetic experiments cover a limited range of partition structures. These controlled settings do not sufficiently establish effectiveness under naturally occurring differences between modalities. More fundamentally, common refinement preserves every modality-specific distinction, including potentially irrelevant ones; the paper provides limited evidence that the resulting finer partition is a useful target in realistic applications. This limits the practical significance and generalizability of the reported gains.
Questions for authors
1.Can the authors compare against intersecting independently recovered modality partitions and ablate the signature-based merging heuristic? For Ours+CRL, can alternative clustering methods be evaluated on the same learned representations to isolate the contribution of the proposed method?
2.Can the authors provide evidence beyond class-dependent feature zeroing, including more general crossed partitions and a naturally complementary real-data setting? How should common refinement be interpreted when some modality-specific distinctions are irrelevant to the intended task?