PRCut optimizes an upper bound on the expected graph ratio-cut via probabilistic assignments and stochastic gradients, beating spectral relaxation and matching state-of-the-art deep clustering on image benchmarks.
Dhillon, Yuqiang Guan, and Brian Kulis
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Deep Clustering via Probabilistic Ratio-Cut Optimization
PRCut optimizes an upper bound on the expected graph ratio-cut via probabilistic assignments and stochastic gradients, beating spectral relaxation and matching state-of-the-art deep clustering on image benchmarks.