Skip to main content

Enclosing Machine Learning for Class Description

  • Conference paper
Advances in Neural Networks – ISNN 2007 (ISNN 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4491))

Included in the following conference series:

Abstract

A novel machine learning paradigm, i.e. enclosing machine learning based on regular geometric shapes was proposed. It adopted regular minimum volume enclosing and bounding geometric shapes (sphere, ellipsoid, and box) or their unions and so on to obtain one class description model and thus imitate the human “Cognizing” process. A point detection and assignment algorithm based on the one class description model was presented to imitate the human “Recognizing” process. To illustrate the concept and algorithm, a minimum volume enclosing ellipsoid (MVEE) strategy for enclosing machine learning was investigated in detail. A regularized minimum volume enclosing ellipsoid problem and dual form were presented due to probable existence of zero eigenvalues in regular MVEE problem. To solve the high dimensional one class description problem, the MVEE in kernel defined feature space was presented. A corresponding dual form and kernelized Mahalanobis distance formula was presented. We investigated the performance of the enclosing learning machine via benchmark datasets and compared with support vector machines (SVM).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Li, Y.H., Wei, X.K., Liu, J.X.: Engineering Applications of Support Vector Machines, 1st edn. Weapon Industry Press, Beijing (2004)

    Google Scholar 

  2. Li, Y.H., Wei, X.K.: Fusion Development of Support Vector Machines and Neural Networks. Journal of Air Force Engineering University 4, 70–73 (2005)

    Google Scholar 

  3. Wei, X.-K., Li, Y.-H., Feng, Y.: Comparative Study of Extreme Learning Machine and Support Vector Machine. In: Wang, J., Yi, Z., Żurada, J.M., Lu, B.-L., Yin, H. (eds.) ISNN 2006. LNCS, vol. 3971, pp. 1089–1095. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Wei, X.K., Li, Y.H.: Enclosing Machine Learning: Concepts and Algorithms. Technique Report AFEC-2006-1, Air Force Engineering University, Xi’an, China (2006)

    Google Scholar 

  5. Vandenberghe, L., Boyd, S., Wu, S.P.: Determinant Maximization with Linear Matrix Inequality Constraints. SIAM Journal on Matrix Analysis and Applications 2, 499–533 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  6. Tax, D.M.J., Duin, R.P.W.: Support Vector Domain Description. Pattern Recognition Letters 20, 1191–1199 (1999)

    Article  Google Scholar 

  7. Fischer, K., Gärtner, B., Kutz, M.: Fast Smallest-Enclosing-Ball Computation in High Dimensions. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 630–641. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Kumar, P., Mitchell, J.S.B., Yıldırım, E.A.: Approximate Minimum Enclosing Balls in High Dimensions Using Core-sets. The ACM Journal of Experimental Algorithmics 8(1), 1–29 (2003)

    MathSciNet  MATH  Google Scholar 

  9. Sun, P., Freund, R.M.: Computation of Minimum Volume Covering Ellipsoids. Operations Research 5, 690–706 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  10. Panigrahy, R.: Minimum Enclosing Polytope in High Dimensions. Preprints (2004), available at http://arxiv.org/abs/cs.CG/0407020

  11. Kumar, P., Yıldırım, E.A.: Minimum Volume Enclosing Ellipsoids and Core-sets. Journal of Optimization Theory and Applications 126(1), 1–21 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  12. Shawe-Taylor, J., Williams, C., Cristianini, N., Kandola, J.S.: On the Eigenspectrum of the Gram Matrix and Its Relationship to the Operator Eigenspectrum. In: Cesa-Bianchi, N., Numao, M., Reischuk, R. (eds.) ALT 2002. LNCS (LNAI), vol. 2533, pp. 23–40. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  13. Dolia, A.N., Page, S.F., White, N.M., Harris, C.J.: D-optimality for Minimum Volume Ellipsoid with Outliers. In: Proceedings of the Seventh International Conference on Signal/Image Processing and Pattern Recognition (UkrOBRAZ2004), pp. 73–76 (2004)

    Google Scholar 

  14. Sturm, J.F.: Using SeDuMi 1.02, A MATLAB Toolbox for Optimization over Symmetric Cones. Optimization Methods and Software 11-12, 625–653 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  15. Löfberg, J.: YALMIP: A Toolbox for Modeling and Optimization in MATLAB (2006), http://control.ee.ethz.ch/~joloef

  16. Structural Integrity and Damage Assessment Network, http://www.sidanet.org

  17. Chang, C.C., Lin, C.J.: LIBSVM: a Library for Support Vector Machines (2001), http://www.csie.ntu.edu.tw/~cjlin/libsvm

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wei, X., Löfberg, J., Feng, Y., Li, Y., Li, Y. (2007). Enclosing Machine Learning for Class Description. In: Liu, D., Fei, S., Hou, ZG., Zhang, H., Sun, C. (eds) Advances in Neural Networks – ISNN 2007. ISNN 2007. Lecture Notes in Computer Science, vol 4491. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72383-7_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72383-7_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72382-0

  • Online ISBN: 978-3-540-72383-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics