IDEAS home Printed from https://ideas.repec.org/a/aes/infoec/v17y2013i2p173-182.html
   My bibliography  Save this article

Extensions of the SVM Method to the Non-Linearly Separable Data

Author

Listed:
  • Luminita STATE

    ()

  • Catalina COCIANU

    ()

  • Cristian USCATU

    ()

  • Marinela MIRCEA

    ()

Abstract

The main aim of the paper is to briefly investigate the most significant topics of the currently used methodologies of solving and implementing SVM-based classifier. Following a brief introductory part, the basics of linear SVM and non-linear SVM models are briefly exposed in the next two sections. The problem of soft margin SVM is exposed in the fourth section of the paper. The currently used methods for solving the resulted QP-problem require access to all labeled samples at once and a computation of an optimal solution is of complexity O(N2). Several ap-proaches have been proposed aiming to reduce the computation complexity, as the interior point (IP) methods, and the decomposition methods such as Sequential Minimal Optimization – SMO, as well as gradient-based methods to solving primal SVM problem. Several approaches based on genetic search in solving the more general problem of identifying the optimal type of kernel from pre-specified set of kernel types (linear, polynomial, RBF, Gaussian, Fourier, Bspline, Spline, Sigmoid) have been recently proposed. The fifth section of the paper is a brief survey on the most outstanding new techniques reported so far in this respect.

Suggested Citation

  • Luminita STATE & Catalina COCIANU & Cristian USCATU & Marinela MIRCEA, 2013. "Extensions of the SVM Method to the Non-Linearly Separable Data," Informatica Economica, Academy of Economic Studies - Bucharest, Romania, vol. 17(2), pages 173-182.
  • Handle: RePEc:aes:infoec:v:17:y:2013:i:2:p:173-182
    as

    Download full text from publisher

    File URL: http://www.revistaie.ase.ro/content/66/14%20-%20State,%20Cocianu.pdf
    Download Restriction: no

    References listed on IDEAS

    as
    1. Joachims, Thorsten, 1998. "Making large-scale SVM learning practical," Technical Reports 1998,28, Technische Universität Dortmund, Sonderforschungsbereich 475: Komplexitätsreduktion in multivariaten Datenstrukturen.
    Full references (including those not matched with items on IDEAS)

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:aes:infoec:v:17:y:2013:i:2:p:173-182. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Paul Pocatilu). General contact details of provider: http://edirc.repec.org/data/aseeero.html .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.