Max-min separability: incremental approach and application to supervised data classification

  • Adil Bagirov
  • Bulent Karasozen
  • Dean Webb
    • Categories Global Optimization Applications, Nonsmooth Optimization Tags , , , Short URL: https://optimization-online.org/?p=10178

    A new algorithm for the computation of a piecewise linear function separating two finite point sets in $n$-dimensional space is developed and the algorithm is applied to solve supervised data classification problems. The algorithm computes hyperplanes incrementally and it finds as many hyperplanes as necessary to separate two sets with respect to some tolerance. An error function is formulated and an algorithm for its minimization is discussed. We present results of numerical experiments using several UCI test data sets and compare the proposed algorithm with two support vector machine solvers: LIBSVM and SVM$\_$light.

    Citation

    http://www3.iam.metu.edu.tr/iam/images/0/03/Preprint76.pdf Preprint Series of Institute of Applied Matheamtics, Middle Eat Technical University, Ankara-Turkey

    Article

    Download

    View Max-min separability: incremental approach and application to supervised data classification