Time Complexity Analysis of Support Vector Machines (SVM) in LibSVM

Abdiansah, Abdiansah and Wardoyo , Retantyo Time Complexity Analysis of Support Vector Machines (SVM) in LibSVM. International Journal Computer and Application.

[img]
Preview
PDF - Published Version
Download (750Kb) | Preview

    Abstract

    Support Vector Machines (SVM) is one of machine learning methods that can be used to perform classification task. Many researchers using SVM library to accelerate their research development. Using such a library will save their time and avoid to write codes from scratch. LibSVM is one of SVM library that has been widely used by researchers to solve their problems. The library also integrated to WEKA, one of popular Data Mining tools. This article contain results of our work related to complexity analysis of Support Vector Machines. Our work has focus on SVM algorithm and its implementation in LibSVM. We also using two popular programming languages i.e C++ and Java with three different dataset to test our analysis and experiment. The results of our research has proved that the complexity of SVM (LibSVM) is O(n3) and the time complexity shown that C++ faster than Java, both in training and testing, beside that the data growth will be affect and increase the time of computation.

    Item Type: Article
    Subjects: T Technology > Computer Engineering
    Q Science > QA Mathematics > QA76 Computer software
    Divisions: Faculty of Computer Science > Department of Informatics Engineering
    Depositing User: Abdiansah Ns
    Date Deposited: 02 Nov 2015 08:40
    Last Modified: 02 Nov 2015 08:40
    URI: http://eprints.unsri.ac.id/id/eprint/5873

    Actions (login required)

    View Item