Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Combinatorial Image Analysis

IWCIA 2012: Combinatorial Image Analaysis pp 31–44Cite as

Fast Combinatorial Algorithm for Tightly Separating Hyperplanes

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 7655))

Abstract

We propose a new algorithm for finding separating hyperplanes between two data sets with respect to the L  ∞  norm. The algorithm is an adaptation of a previous result on enclosing hyperplanes. Our main result is that the existing algorithm for finding enclosures can also be applied to find separations provided the two data sets cannot be separated in a space of lower dimension.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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. Andres, E., Acharya, R., Sibata, C.: Discrete analytical hyperplanes. Graphical Models and Image Processing 59(5), 302–309 (1997)

    Article  Google Scholar 

  2. Bialon, P.: A linear support vector machine solver for a large number of training examples. Control and Cybernetics 38(1), 281–300 (2009)

    MathSciNet  MATH  Google Scholar 

  3. Brimkov, V.E., Coeurjolly, D., Klette, R.: Digital planarity – a review. Discrete Applied Mathematics 155(4), 468–495 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. Burges, Ch.J.C.: A tutorial on support vector machines for pattern recognition. Data Min. Knowl. Discov. 2(2), 121–167 (1998)

    Article  Google Scholar 

  5. Chapelle, O.: Training a support vector machine in the primal. Neural Computation 19(5), 1155–1178 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Hawkins, D.M., Bradu, D., Kass, G.V.: Location of several outliers in multiple regression data using elemental sets. Technometrics 26, 197–208 (1984)

    Article  MathSciNet  Google Scholar 

  7. Jamet, D., Toutant, J.-L.: Minimal arithmetic thickness connecting discrete planes. Discrete Applied Mathematics 157(3), 500–509 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  8. Joachims, T.: Training linear svms in linear time. In: Eliassi-Rad, T., Ungar, L.H., Craven, M., Gunopulos, D. (eds.) Proc. Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 217–226. ACM (2006)

    Google Scholar 

  9. Keerthi, S.S., Chapelle, O., DeCoste, D.: Building support vector machines with reduced classifier complexity. Journal of Machine Learning Research 7, 1493–1515 (2006)

    MathSciNet  MATH  Google Scholar 

  10. Rousseeuw, P., Leroy, A.: Robust Regression and Outlier Detection. Wiley, New York (1987)

    Book  MATH  Google Scholar 

  11. Veelaert, P.: Constructive fitting and extraction of geometric primitives. Graphical Models and Image Processing 59(4), 233–251 (1997)

    Article  Google Scholar 

  12. Veelaert, P.: Separability and tight enclosure of point sets. In: Brimkov, V.E., Barneva, R.P. (eds.) Digital Geometry Algorithms. Lecture Notes in Computational Vision and Biomechanics, vol. 2, pp. 215–243. Springer (2012)

    Google Scholar 

  13. Ziegler, G.M.: Lectures on Polytopes. Graduate Texts in Mathematics, vol. 152. Springer, New York (1995)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ghent University, Valentin Vaerwyckweg 1, B9000, Ghent, Belgium

    Peter Veelaert

Authors
  1. Peter Veelaert
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer and Information Sciences, State University of New York at Fredonia, 280 Central Ave, 14063, Fredonia, NY, USA

    Reneta P. Barneva

  2. Mathematics Department, SUNY Buffalo State College, 1300Elmwood Ave, 14222, Buffalo, NY, USA

    Valentin E. Brimkov

  3. Department of Electrical and Computer Engineering, University of Texas at Austin, 1 University Station C0803, 78712-0240 TX, Austin, USA

    Jake K. Aggarwal

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Veelaert, P. (2012). Fast Combinatorial Algorithm for Tightly Separating Hyperplanes. In: Barneva, R.P., Brimkov, V.E., Aggarwal, J.K. (eds) Combinatorial Image Analaysis. IWCIA 2012. Lecture Notes in Computer Science, vol 7655. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34732-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34732-0_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34731-3

  • Online ISBN: 978-3-642-34732-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation