- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes a way to merge several base clusterings (Eq. (5)). The main new perspective is to introduce a learnable weight vector . Then the authors developed an optimization procedure to solve the problem (5).
Critical strengths
None
Critical weaknesses
Overall, the contribution appears primarily incremental. The method combines cluster-label mapping, adaptive partitiion weights, and regularization within a joint framework. There is no substantial conceptual advance from combining these components.
The paper claims "two granularity weighting", but the cluster level mapping Z merely assigns each base cluster to a target cluster. It does not weight or suppress unreliable clusters. The claim that both unreliable partitiion and individual clusters are downweighted is therefore not suppored.
The relationship in Eq (10) is straightforward and elementray, no need to have a theorem. Moreover, the regularizer does not establish the claimed exclusion of trivial solutions.
Each base cluster is mapped as a whole to one target cluter. If it contains samples from several true classes, that partition's contribution cannot separate them. The abstract says "a partition that is more accurate and more robust than any single one", which is quite non-rigious.
Monotonic decrease and a lower bound establish convergence of the objective sequence. They do not establish convergence to a useful clustering, a global optimum, or even convergence of all optimization variables.
Questions for authors
For hard memberships, the structural term explicitly favors equally sized clusters. The paper needs controlled experiments with unequal cluster sizes and rare groups to establish when this prefrerence helps or harms performance.
Ablations, generator comparisons, and parameter sensitivity are reported only on Pendigits. There are no controlled tests that progressively introduce unreliable partitions, correlated error, or class imbalance.
Initialization uses base-cluster centers computed in the original feature space. Consequently, the implemented procedure requires more than the base clustering lables, contrary to the motivation that consensus uses only labels.