Learning Algorithm for Enclosing Points in Bregmanian Spheres


We discuss the problem of finding a generalized sphere that encloses points originating from a single source. The points contained in such a sphere are within a maximal divergence from a center point. The divergences we study are known as the Bregman divergences which include as a special case both the Euclidean distance and the relative entropy. We cast… (More)
DOI: 10.1007/978-3-540-45167-9_29


2 Figures and Tables

Slides referencing similar topics