Bregman divergences in the (m k)-partitioning problem
From MaRDI portal
Publication:1010403
Recommendations
Cites work
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- Clustering with Bregman divergences.
- Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory
- General entropy criteria for inverse problems, with applications to data compression, pattern classification, and cluster analysis
- I-divergence geometry of probability distributions and minimization problems
- Importance partitioning in micro-aggregation
- On the Optimality of Conditional Expectation as a Bregman Predictor
- Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems
Cited in
(3)
This page was built for publication: Bregman divergences in the \((m\times k)\)-partitioning problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010403)