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 map**. 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Berg, M.: Computational geometry: algorithms and application. Springer, New york (1997)
Elzinga, D.J., Hearn, D.W.: The minimum covering sphere problem. Management Science 19, 96–104 (1972)
Schölkopf, B., Burges, C., Vapnik, V.: Extracting support data for a given task. In: Fayyad, U.M., Uthurusamy, R. (eds.) Proceedings First International Conference on Knowledge Discovery & Data Mining, pp. 252–257. AAAI Press, Menlo Park (1995)
Megiddo, N.: Linear-time algorithms for linear programming in R 3 and related problems. SIAM J. Comput. 12, 759–776 (1983)
Welzl, E.: Smallest enclosing disks (balls and ellipses). In: Maurer, H. (ed.) New Results and New Trends in Computer Science. LNCS, vol. 555, pp. 359–370. Springer, Heidelberg (1991)
Gärtner, B.: Fast and robust smallest enclosing balls. In: Nešetřil, J. (ed.) ESA 1999. LNCS, vol. 1643, pp. 325–338. Springer, Heidelberg (1999)
Vapnik, V.: Statistical learning theory. John wiley & Sons, New York (1998)
Ben-Hur, A., Horn, D., Siegelmann, H.T., Vapnik, V.: Support vector clustering. Journal of Machine Learning Research 2, 125–137 (2001)
Horn, D.: Clustering via Hibert space. Physica A 302, 70–79 (2001)
Platt, J.: Fast training of support vector machines using sequential minimal optimization. In: Scholkopf, B., Burges, C.J.C., Smola, A.J. (eds.) Advances in Kernel Methods — Support Vector Learning, pp. 185–208. MIT Press, Cambridge (1999)
Li, X.S.: An information entropy for optimization problems. Chinese Journal of Operations Research 8(1), 759–776 (1989)
Templeman, A.B., Li, X.S.: An maximum entropy approach to constrained non-linear programming. Engineering Optimization 12, 191–205 (1987)
Kress, R.: Numerical analysis. Springer, New York (1998)
Blake, C.L., Merz, C.J.: UCI repository of machine learning databases, available at (1998), at http://www.ics.uci.edu/~mlearn/MLRepository.html
Polak, E., Royset, J.O., Womersley, R.S.: Algorithms for adaptive smoothing for finite minimax problem. Journal of Optimization Theory and Applications 119(3), 459–484 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guo, C., Lu, M., Sun, J., Lu, Y. (2005). A New Algorithm for Computing the Minimal Enclosing Sphere in Feature Space. In: Wang, L., **, Y. (eds) Fuzzy Systems and Knowledge Discovery. FSKD 2005. Lecture Notes in Computer Science(), vol 3614. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11540007_24
Download citation
DOI: https://doi.org/10.1007/11540007_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28331-7
Online ISBN: 978-3-540-31828-6
eBook Packages: Computer ScienceComputer Science (R0)