earticle

논문검색

Ordinal Multiclass SVM Classifiers for Customer Classification

초록

영어

Support vector machines (SVMs) were originally designed for binary classification problems. However, some real-world multiclass problems including corporate bond rating can’t be solved by the binary classifier. For this reason, many researchers have tried to extend original SVM to multiclass classification. However, their studies have only focused on classifying samples into nominal categories. But, their approaches also have a limitation because there are multiclass classification problems whose classes are ordinal in real world. In this study, we propose ordinal multiclass SVMs which apply ordinal pairwise partitioning (OPP) to conventional SVMs in order to handle ordinal multiple classes efficiently and effectively. Our suggested model may use less classifier but predict more accurately because it utilizes characteristics of the order of the classes. We apply it to the real-world customer classification case for validating the proposed model. The result shows that the proposed multiclass SVM models improve classification performance.

목차

Abstract
 Introduction
 Conventional and Multiclass Support VectorMachines
 Ordinal Multiclass SVMs
 Experimental Design and Results
 Conclusions
 References

저자정보

  • Kyoung-jae Kim Department of Management Information Systems, Dongguk University
  • Hyunchul Ahn School of Business IT, Kookmin University

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 기관로그인 시 무료 이용이 가능합니다.
      ※ 학술발표대회집, 워크숍 자료집 중 4페이지 이내 논문은 '요약'만 제공되는 경우가 있으니, 구매 전에 간행물명, 페이지 수 확인 부탁 드립니다.

      • 4,000원

      0개의 논문이 장바구니에 담겼습니다.