Bregman divergences in the -partitioning problem
Authors:
- G. KokolakisGKG. Kokolakis
- Ph. NanopoulosPNPh. Nanopoulos
- D. FouskakisDFD. Fouskakis
- 1 November 2006
- journal article
- Published by Elsevier in Computational Statistics & Data Analysis
- Vol. 51 (2) , 668-678
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On the Optimality of Conditional Expectation as a Bregman PredictorIEEE Transactions on Information Theory, 2005
- Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theoryThe Annals of Statistics, 2004
- Practical data-oriented microaggregation for statistical disclosure controlIEEE Transactions on Knowledge and Data Engineering, 2002
- Additive models, boosting, and inference for generalized divergences1999
- Why Least Squares and Maximum Entropy? An Axiomatic Approach to Inference for Linear Inverse ProblemsThe Annals of Statistics, 1991
- Enhancing Access to Microdata While Protecting Confidentiality: Prospects for the FutureStatistical Science, 1991
- General entropy criteria for inverse problems, with applications to data compression, pattern classification, and cluster analysisIEEE Transactions on Information Theory, 1990
- Security-control methods for statistical databases: a comparative studyACM Computing Surveys, 1989
- $I$-Divergence Geometry of Probability Distributions and Minimization ProblemsThe Annals of Probability, 1975
- The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programmingUSSR Computational Mathematics and Mathematical Physics, 1967