• DocumentCode
    2701575
  • Title

    Research on tangent circular arc smooth Support Vector Machine (TCA-SSVM) algorithm

  • Author

    Fan, Yan-Feng ; Zhang, De-Xian

  • Author_Institution
    Coll. of Inf. Sci. & Eng., Henan Univ. of Technol., Zhengzhou
  • fYear
    2008
  • fDate
    20-23 June 2008
  • Firstpage
    1322
  • Lastpage
    1327
  • Abstract
    Data classification problem is a flourishing research field. Classification is the process of finding the common properties among different patterns and classifying them into classes. SVM (support vector machine) is one of classifier for solving binary classification problem. In traditional SVM solution algorithms, objective function is a strictly convex unconstrained optimization problem, but is un-differentiable due to plus function x+, which precludes the most used optimization algorithms. A new smoothing technology which replaces the plus function by an accurate tangent circular arc polynomial for solving SVM classification algorithm is proposed in this paper. We also prescribe a DFP quasi-Newton algorithm to solve the proposed classifier. Numerical results and comparisons are given to demonstrate the effectiveness.
  • Keywords
    Newton method; convex programming; pattern classification; support vector machines; DFP quasiNewton algorithm; SVM classification; binary classification problem; convex unconstrained optimization problem; pattern classification; support vector machine; tangent circular arc polynomial; tangent circular arc smooth; Automation; Classification algorithms; Data mining; Educational institutions; Information science; Polynomials; Smoothing methods; Support vector machine classification; Support vector machines; Testing; Classification; DFP Quasi-Newton; SVM; smooth technology; tangent circular arc polynomial;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information and Automation, 2008. ICIA 2008. International Conference on
  • Conference_Location
    Changsha
  • Print_ISBN
    978-1-4244-2183-1
  • Electronic_ISBN
    978-1-4244-2184-8
  • Type

    conf

  • DOI
    10.1109/ICINFA.2008.4608206
  • Filename
    4608206