- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper proposes DiFuMVC, a multi-view clustering framework that integrates information across views through distribution modeling and performs efficient clustering via spectral computation on a compact graph. The framework has three stages: distributional representation describes groups discovered in each view through kernel mean embeddings; distribution fusion uses shared reference objects to compute cross-view point-to-distribution similarities while preserving view-specific geometry; and distribution-driven clustering assembles these relationships into a bipartite graph, performs spectral computation on its compact distribution side, and transfers the result to samples. Experiments on 15 benchmark datasets report competitive clustering performance and runtime.
Critical strengths
-
The design makes use of group information while keeping spectral computation efficient. Each group representation aggregates information from all its members, allowing cross-view fusion to use distributional information that a single representative point may miss. Performing the spectral step on a small matrix also reduces its computational cost.
-
The reported clustering performance and runtime are encouraging. The method achieves competitive clustering results with fast reported runtimes across multiple benchmarks. The ablation results favoring group representations over single-point representatives also support the use of information from group members.
Critical weaknesses
-
The explanation that only one Food101 view contains useful information lacks direct evidence. To examine whether fusion across views is beneficial, Section 4.3 compares the full model with a variant that removes connections between views. The latter performs slightly better on some Food101 clustering metrics, which the authors explain by stating that only one view provides useful information while the other two introduce noise. However, the method is intended to improve clustering by exploiting information from multiple views. When adding cross-view fusion instead reduces performance on some metrics, the authors attribute this to noise in the other two views. Could this instead reflect the proposed fusion mechanism's failure to exploit useful information from those views, rather than those views being inherently uninformative?
-
The presentation of the method is poor. The authors organize the method into distributional representation, distribution fusion, and distribution-driven clustering, providing an overall framework from input data to final clusters. However, the detailed description in Section 3 introduces many mathematical symbols in succession. Readers must repeatedly revisit their definitions to understand what each step takes as input and produces as output, making it difficult to connect the equations into a complete procedure. Consequently, readers struggle to grasp the main ideas the authors intend to convey.
Questions for authors
-
What rule is used to assign the remaining samples to the retained groups? Section 3.2.2 performs this assignment before constructing the distribution representations. The rule determines which samples contribute to each representation and is therefore necessary for reproducing the method.
-
What values of ψ and τ were used in the experiments? The main text does not provide the values of the reference-sample count ψ and grouping threshold τ, or show how the clustering results change when these parameters vary. Their impact on the reported performance is therefore difficult to assess.
Rebuttal
We thanks for your review and feedback.
W1: Among the 86,796 samples in the Food101, all class-text rows are identical and description text has only 397 distinct feature rows. Any deterministic classifier using only one view must predict identically for identical inputs. Its accuracy is therefore bounded by the sum of majority-class counts within feature-equivalence groups, divided by sample count. This gives ceilings of 1.09% for class text and 8.45% for description text. These are direct representation bottlenecks, independent of DiFuMVC’s fusion mechanism. The phrase “both text views are noise” nevertheless needs precision. Description-text empirical mutual information with labels is 0.363 nats, above the maximum of 0.131 across 100 label permutations, so it contains nonzero information (low information). Table 13 uses Full to compare the variants: Full NMI is 52.84, self-only and image-only are 53.22 and 53.30, and Full differs by −0.18, −0.14, and +1.67 points in NMI, ARI, and F1, while exceeding fixed Point by 8.93 NMI points. On the other three datasets, the Full reference exceeds fixed self-only by 4.13, 1.68, and 4.20 NMI points; on Food101, it exceeds the best tested LMVSC by 11.11 points.
W2: Thank you for your suggestion; we have added the description to the revised version.
Q1: Assignment uses initial KMEs computed from retained components, not the final KMEs that have yet to be estimated. The order is: retain components; average their member features; assign remaining samples by maximum inner product; recompute KMEs from all members of each expanded nonempty group; construct the fusion graph.
Q2: The appendix already contains parameter and sensitivity studies.