Communications in Mathematical Sciences · 2008 · 29 citations · 12 references
Natural SciencesComputer ScienceComputational GeometryInformation TheoryOptimizationConvex AnalysisConvex GeometryConvex OptimizationDifferential GeometryMetric GeometryMetric SpacesBregman DivergenceConvex FunctionsDistance MetricsDivergence MinimizationKullback-leibler Divergence
Bregman divergences are generalizations of the well known Kullback-Leibler divergence. They are based on convex functions and have recently received great attention. We present a class of "squared root metrics" based on Bregman divergences. They can be regarded as natural generalization of Euclidean distance. We provide necessary and sufficient conditions for a convex function so that the square root of its associated average Bregman divergence is a metric.
12
Clustering with Bregman Divergences
Arindam Banerjee, Srujana Merugu, Inderjit S. Dhillon et al. · 2004 · 1.5K citations
Elements of Information Theory
Simon J. D. Phoenix · Journal of Modern Optics · 1992 · 1.4K citations