On the smallest enclosing information disk

Information Processing Letters

Volumn 105, Issue 3, 2008, Pages 93-97

  Nielsen, Frank ^a   Nock, Richard ^b  

^a SONY COMPUTER SCIENCE LABORATORIES INC   (Japan)

^b UNIVERSITÉ DES ANTILLES ET DE LA GUYANE   (France)

Author keywords

Algorithms; Computational information geometry; Divergence; Smallest enclosing ball

Indexed keywords

COMPUTATIONAL GEOMETRY; INFORMATION ANALYSIS; MAGNETIC DISK STORAGE; PROBLEM SOLVING; SET THEORY; STATISTICAL METHODS;

COMPUTATIONAL INFORMATION GEOMETRY; DIVERGENCE; SMALLEST ENCLOSING BALL;

DATA PROCESSING;

EID: 36749067272     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.08.007     Document Type: Article

References (5)

1. Amari S.-I., and Nagaoka H. Methods of Information Geometry. Translations of Mathematical Monographs vol. 191 (2000), AMS. 0821805312
2. Banerjee A., Merugu S., Dhillon I.S., and Ghosh J. Clustering with Bregman divergences. Journal of Machine Learning Research 6 (2005) 1705-1749
3. Matoušek J., Sharir M., and Welzl E. A subexponential bound for linear programming. Algorithmica 16 4-5 (1996) 498-516
4. Nock R., and Nielsen F. Fitting the smallest enclosing Bregman ball. European Conference on Machine Learning. Lecture Notes in Computer Science vol. 3720 (2005), Springer 649-656
5. Welzl E. Smallest enclosing disks (balls and ellipsoids). New Results and New Trends in Computer Science. Lecture Notes in Computer Science vol. 555 (1991), Springer 359-370