Learning algorithms for enclosing points in Bregmanian spheres.

DOI10.1007/B12006MaRDI QIDQ5305865zbMATH OpenOpenAlexFDO

Authors Koby Crammer, Yoram Singer

Publication date 23 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b12006

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• On approximating the smallest enclosing Bregman Balls
• Smallest enclosing spheres and Chernoff points in Bregman geometry
• On the smallest enclosing information disk
• Clustering with Bregman divergences.
• Learning continuous latent variable models with Bregman divergences

Cited in

(6)

• On the smallest enclosing information disk
• On approximating the smallest enclosing Bregman Balls
• Languages as hyperplanes: grammatical inference with string kernels
• Fast Learning of Generalized Minimum Enclosing Ball for Large Datasets
• Smallest enclosing spheres and Chernoff points in Bregman geometry
• Learning continuous latent variable models with Bregman divergences

This page was built for publication: Learning algorithms for enclosing points in Bregmanian spheres.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5305865)