A new algorithm for computing the minimal enclosing sphere in feature space

Authors:
Chonghui Guo;Mingyu Lu;Jiantao Sun;Yuchang Lu
Affiliations:
Department of Applied Mathematics, Dalian University of Technology, Dalian, China;Department of Computer Science, Tsinghua University, Beijing, China;Department of Computer Science, Tsinghua University, Beijing, China;Department of Computer Science, Tsinghua University, Beijing, China
Venue:
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part II
Year:
2005

Citing 4
Cited 0

Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
Fast training of support vector machines using sequential minimal optimization

Advances in kernel methods
Fast and Robust Smallest Enclosing Balls

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Support vector clustering

The Journal of Machine Learning Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of computing the minimal enclosing sphere (MES) of a set of points in the high dimensional kernel-induced feature space is considered. In this paper we develop an entropy-based algorithm that is suitable for any Mercer kernel mapping. The proposed algorithm is based on maximum entropy principle and it is very simple to implement. The convergence of the novel algorithm is analyzed and the validity of this algorithm is confirmed by preliminary numerical results.