Skip to main content

The Kernelized Geometrical Bisection Methods

  • Conference paper
  • 1267 Accesses

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

Abstract

In this paper, we developed two new classifiers: the kernelized geometrical bisection method and its extended version. The derivation of our methods is based on the so-called “kernel trick” in which samples in the input space are mapped onto almost linearly separable data in a high-dimensional feature space associated with a kernel function. A linear hyperplane can be constructed through bisecting the line connecting the nearest points between two convex hulls created by mapped samples in the feature space. Computational experiments show that the proposed algorithms are more competitive and effective than the well-known conventional methods.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Vapnik, V.N.: The Nature of Statistical Learning Theory. Springer, New York (1998)

    Google Scholar 

  2. Vapnik, V.N.: Statistical Learning Theory. John Wiley and Sons, New York (1998)

    MATH  Google Scholar 

  3. Burges, C.J.C.: A Tutorial on Support Vector Machines for Pattern Recognition. Data mining and Knowledge Discovery 2(2), 144–152 (1998)

    Article  Google Scholar 

  4. Bennett, K.P., Bredensteiner, E.: Geometry in Learning. Web Manuscript (1996), http://www.rpi.edu/~bennek

  5. Keerthi, S.S., Shevade, S.K., Bhattacharyya, C., et al.: A Fast Iterative Nearestpoint Algorithm for Support Vector Machine Chassifier Design. IEEE Transactions on Neural Networks 11(1), 124–136 (2000)

    Article  Google Scholar 

  6. Bennett, K., Bredensteiner, E.: Duality and Geometry in SVM classifiers. In: Proc. of Seventeenth Intl. Conference on Machine Learning, pp. 57–64. Morgan Kaufmann, San Francisco (2000)

    Google Scholar 

  7. Boser, B.E., Guyon, I.M., Vapnik, V.: A Training Algorithm for Optimal Margin Classifiers. In: Proc. 5th Annu. ACM Workshop on Computational Learning Theory, Pittsburgh, USA, pp. 144–152 (1992)

    Google Scholar 

  8. John, S.T., Nello, C.: Kernel Methods for Pattern Analysis. China Machine Press, Beijing (2005)

    Google Scholar 

  9. Blake, C.L., Merz, C.J.: UCI Repository of Machine Learning Databases (2005), http://www.ics.uci.edu/~mlearn/databases/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Derong Liu Shumin Fei Zengguang Hou Huaguang Zhang Changyin Sun

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Liu, X., Cao, S., Gao, J., Zhang, J. (2007). The Kernelized Geometrical Bisection Methods. In: Liu, D., Fei, S., Hou, Z., Zhang, H., Sun, C. (eds) Advances in Neural Networks – ISNN 2007. ISNN 2007. Lecture Notes in Computer Science, vol 4492. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72393-6_81

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72393-6_81

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72392-9

  • Online ISBN: 978-3-540-72393-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics