Fast Learning of Generalized Minimum Enclosing Ball for Large Datasets

DOI10.3724/SP.J.1004.2012.01831MaRDI QIDQ4926315zbMATH OpenFDO

Authors Wenjun Hu, Juan Wang, Wenhao Ying, Shitong Wang

Publication date 20 June 2013

Published in Acta Automatica Sinica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/SP.J.1004.2012.01831

zbMATH Keywords

large datasetscore vector machinegeneralized minimum enclosing ball

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Fast affinity learning algorithms for heterogeneous space large scale datasets using minimum enclosing ball
• APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
• Scaling up minimum enclosing ball with total soft margin for training on large datasets
• Algorithms - ESA 2003
• Minimum enclosing ball for domain adaptation
• Approximate minimum enclosing balls in high dimensions using core-sets
• Learning algorithms for enclosing points in Bregmanian spheres.
• On approximating the smallest enclosing Bregman Balls

Cited in

(2)

• Fast affinity learning algorithms for heterogeneous space large scale datasets using minimum enclosing ball
• Scaling up minimum enclosing ball with total soft margin for training on large datasets

This page was built for publication: Fast Learning of Generalized Minimum Enclosing Ball for Large Datasets

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