• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Industrial Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Industrial Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      A linearly convergent linear - time first - order algorithm for support vector classification with a core set result

      Thumbnail
      View/Open
      Full printable version (316.8Kb)
      Author
      Kumar, P.
      Yıldırım, E. A.
      Date
      2011
      Journal Title
      INFORMS Journal on Computing
      ISSN
      1091-9856 (print)
       
      1526-5528 (online)
       
      Publisher
      Institute for Operations Research and the Management Sciences (I N F O R M S)
      Volume
      23
      Issue
      3
      Pages
      377 - 391
      Language
      English
      Type
      Article
      Metadata
      Show full item record
      Please cite this item using this persistent URL
      http://hdl.handle.net/11693/21900
      Abstract
      We present a simple first-order approximation algorithm for the support vector classification problem. Given a pair of linearly separable data sets and. ε (0,1), the proposed algorithm computes a separating hyperplane whose margin is within a factor of (1-ε) of that of the maximum-margin separating hyperplane. We discuss how our algorithm can be extended to nonlinearly separable and inseparable data sets. The running time of our algorithm is linear in the number of data points and in 1/ε. In particular, the number of support vectors computed by the algorithm is bounded above by O(ζ/ε. for all sufficiently small ε >, where ζ is the square of the ratio of the distances between the farthest and closest pairs of points in the two data sets. Furthermore, we establish that our algorithm exhibits linear convergence. Our computational experiments, presented in the online supplement, reveal that the proposed algorithm performs quite well on standard data sets in comparison with other first-order algorithms. We adopt the real number model of computation in our analysis.
      Published as
      http://dx.doi.org/10.1287/ijoc.1100.0412
      Collections
      • Department of Industrial Engineering 582

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the webmaster. Phone: (312) 290 1771
      Copyright © Bilkent University | Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin