Bregman divergences in the \((m\times k)\)-partitioning problem

DOI10.1016/J.CSDA.2006.02.017zbMath1157.62569OpenAlexW1982421738MaRDI QIDQ1010403

J. Martínez

Publication date: 6 April 2009

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.csda.2006.02.017

zbMATH Keywords

confidentialityconvex partitiondata maskingBregman divergencesfixed cardinality partitioningfixed size micro-aggregationpythagorean property

Mathematics Subject Classification ID

Applications of statistics (62P99)

Related Items (2)

Importance partitioning in micro-aggregation ⋮ On the discrepancy measures for the optimal equal probability partitioning in Bayesian multivariate micro-aggregation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Importance partitioning in micro-aggregation
• Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems
• I-divergence geometry of probability distributions and minimization problems
• 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
• On the Optimality of Conditional Expectation as a Bregman Predictor

This page was built for publication: Bregman divergences in the \((m\times k)\)-partitioning problem