Bregman divergences in the (m k)-partitioning problem

DOI10.1016/J.CSDA.2006.02.017zbMATH Open1157.62569OpenAlexW1982421738MaRDI QIDQ1010403FDOQ1010403

Authors: 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

Recommendations

• On the discrepancy measures for the optimal equal probability partitioning in Bayesian multivariate micro-aggregation
• Importance partitioning in micro-aggregation
• Quantization and clustering with Bregman divergences
• Clustering with Bregman divergences.
• Clustering with diversity

zbMATH Keywords

confidentialityconvex partitiondata maskingBregman divergencesfixed cardinality partitioningfixed size micro-aggregationpythagorean property

Mathematics Subject Classification ID

Applications of statistics (62P99)

Cites Work

• Title not available (Why is that?)
• Clustering with Bregman divergences.
• Title not available (Why is that?)
• Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems
• Title not available (Why is that?)
• I-divergence geometry of probability distributions and minimization problems
• Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory
• On the Optimality of Conditional Expectation as a Bregman Predictor
• General entropy criteria for inverse problems, with applications to data compression, pattern classification, and cluster analysis
• Importance partitioning in micro-aggregation

Cited In (3)

• Title not available (Why is that?)
• On the discrepancy measures for the optimal equal probability partitioning in Bayesian multivariate micro-aggregation
• Importance partitioning in micro-aggregation

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)