6 0

대용량 데이터에서의 서포트벡터머신 문제 해결을 위한 의사결정트리 분류 기반의 서포트벡터 후보 선택

Title
대용량 데이터에서의 서포트벡터머신 문제 해결을 위한 의사결정트리 분류 기반의 서포트벡터 후보 선택
Other Titles
Selection of support vector candidates based on tree decomposition for large-scale SVM problems
Author
이창호
Alternative Author(s)
이창호
Advisor(s)
이기천
Issue Date
2016-02
Publisher
한양대학교
Degree
Master
Abstract
Support vector machines (SVMs) are a well-known classifier due to its excellent classification accuracy. It offers a hyperplane that represents the largest margin between two classes. In the computation of the hyperplane, however, it is necessary to solve a quadratic programming problem (QP). The storage cost of a QP is growing with the square of the number of training sample points, and the time complexity is proportional to the cube of the number. Thus, it is worth to study how to reduce the training time of SVMs without compromising the accuracy to prepare for large-scale problems. In this paper, we propose a novel data reduction method for reducing training time combining decision tree and relative support distance. We apply a new concept, relative support distance, to select good support vector candidates in each partition generated by decision tree. The selected support vector candidates improves the training speed for large-scale SVM problems. In experiments, we demonstrate that our approach significantly reduces the training speed, while maintaining good classification accuracy, in comparison of existing approaches.
URI
http://dcollection.hanyang.ac.kr/jsp/common/DcLoOrgPer.jsp?sItemId=000000091773http://repository.hanyang.ac.kr/handle/20.500.11754/127186
Appears in Collections:
GRADUATE SCHOOL[S](대학원) > INDUSTRIAL ENGINEERING(산업공학과) > Theses (Master)
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE