• 제목/요약/키워드: SVM parameter

검색결과 77건 처리시간 0.03초

대용량 분류에서 SVM과 신경망의 성능 비교 (Performance comparison of SVM and neural networks for large-set classification problems)

  • 이진선;김영원;오일석
    • 정보처리학회논문지B
    • /
    • 제12B권1호
    • /
    • pp.25-30
    • /
    • 2005
  • 이 논문은 대용량 분류 문제를 위한 모듈러 신경망(modular feedforward MLP)과 SVM(Support Vector Machine)의 성능을 비교 분석하였다. 전반적으로 SVM이 상당한 성능 차이로 우수함을 확인하였다. 또한 부류 수가 많아짐에 따라 SVM이 신경망보다 완만하게 성능 저하가 있음도 확인하였다. 또한 기각에 따른 정인식률 추이를 분석하였고, 대용량 분류에 적합한 SVM 파라메터(kernel 함수와 관련 변수들)를 도출하였다.

A Multi-Objective TRIBES/OC-SVM Approach for the Extraction of Areas of Interest from Satellite Images

  • Benhabib, Wafaa;Fizazi, Hadria
    • Journal of Information Processing Systems
    • /
    • 제13권2호
    • /
    • pp.321-339
    • /
    • 2017
  • In this work, we are interested in the extraction of areas of interest from satellite images by introducing a MO-TRIBES/OC-SVM approach. The One-Class Support Vector Machine (OC-SVM) is based on the estimation of a support that includes training data. It identifies areas of interest without including other classes from the scene. We propose generating optimal training data using the Multi-Objective TRIBES (MO-TRIBES) to improve the performances of the OC-SVM. The MO-TRIBES is a parameter-free optimization technique that manages the search space in tribes composed of agents. It makes different behavioral and structural adaptations to minimize the false positive and false negative rates of the OC-SVM. We have applied our proposed approach for the extraction of earthquakes and urban areas. The experimental results and comparisons with different state-of-the-art classifiers confirm the efficiency and the robustness of the proposed approach.

Tuning the Architecture of Support Vector Machine: The Case of Bankruptcy Prediction

  • Min, Jae-H.;Jeong, Chul-Woo;Kim, Myung-Suk
    • Management Science and Financial Engineering
    • /
    • 제17권1호
    • /
    • pp.19-43
    • /
    • 2011
  • Tuning the architecture of SVM (support vector machine) is to build an SVM model of better performance. Two different tuning methods of the grid search and the GA (genetic algorithm) have been addressed in the literature, each of which has its own methodological pros and cons. This paper suggests a combined method for tuning the architecture of SVM models, which employs the GAM (generalized additive models), the grid search, and the GA in sequence. The GAM is used for selecting input variables, and the grid search and the GA are employed for finding optimal parameter values of the SVM models. Applying the method to a bankruptcy prediction problem, we show that SVM model tuned by the proposed method outperforms other SVM models.

Combining genetic algorithms and support vector machines for bankruptcy prediction

  • Min, Sung-Hwan;Lee, Ju-Min;Han, In-Goo
    • 한국지능정보시스템학회:학술대회논문집
    • /
    • 한국지능정보시스템학회 2004년도 추계학술대회
    • /
    • pp.179-188
    • /
    • 2004
  • Bankruptcy prediction is an important and widely studied topic since it can have significant impact on bank lending decisions and profitability. Recently, support vector machine (SVM) has been applied to the problem of bankruptcy prediction. The SVM-based method has been compared with other methods such as neural network, logistic regression and has shown good results. Genetic algorithm (GA) has been increasingly applied in conjunction with other AI techniques such as neural network, CBR. However, few studies have dealt with integration of GA and SVM, though there is a great potential for useful applications in this area. This study proposes the methods for improving SVM performance in two aspects: feature subset selection and parameter optimization. GA is used to optimize both feature subset and parameters of SVM simultaneously for bankruptcy prediction.

  • PDF

Parameter optimization for SVM using dynamic encoding algorithm

  • Park, Young-Su;Lee, Young-Kow;Kim, Jong-Wook;Kim, Sang-Woo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2005년도 ICCAS
    • /
    • pp.2542-2547
    • /
    • 2005
  • In this paper, we propose a support vector machine (SVM) hyper and kernel parameter optimization method which is based on minimizing radius/margin bound which is a kind of estimation of leave-one-error. This method uses dynamic encoding algorithm for search (DEAS) and gradient information for better optimization performance. DEAS is a recently proposed optimization algorithm which is based on variable length binary encoding method. This method has less computation time than genetic algorithm (GA) based and grid search based methods and better performance on finding global optimal value than gradient based methods. It is very efficient in practical applications. Hand-written letter data of MNI steel are used to evaluate the performance.

  • PDF

Multi-User Detection using Support Vector Machines

  • 이정식;이재완;황재정;정경택
    • 한국통신학회논문지
    • /
    • 제34권12C호
    • /
    • pp.1177-1183
    • /
    • 2009
  • In this paper, support vector machines (SVM) are applied to multi-user detector (MUD) for direct sequence (DS)-CDMA system. This work shows an analytical performance of SVM based multi-user detector with some of kernel functions, such as linear, sigmoid, and Gaussian. The basic idea in SVM based training is to select the proper number of support vectors by maximizing the margin between two different classes. In simulation studies, the performance of SVM based MUD with different kernel functions is compared in terms of the number of selected support vectors, their corresponding decision boundary, and finally the bit error rate. It was found that controlling parameter, in SVM training have an effect, in some degree, to SVM based MUD with both sigmoid and Gaussian kernel. It is shown that SVM based MUD with Gaussian kernels outperforms those with other kernels.

Support vector machines with optimal instance selection: An application to bankruptcy prediction

  • Ahn Hyun-Chul;Kim Kyoung-Jae;Han In-Goo
    • 한국지능정보시스템학회:학술대회논문집
    • /
    • 한국지능정보시스템학회 2006년도 춘계학술대회
    • /
    • pp.167-175
    • /
    • 2006
  • Building accurate corporate bankruptcy prediction models has been one of the most important research issues in finance. Recently, support vector machines (SVMs) are popularly applied to bankruptcy prediction because of its many strong points. However, in order to use SVM, a modeler should determine several factors by heuristics, which hinders from obtaining accurate prediction results by using SVM. As a result, some researchers have tried to optimize these factors, especially the feature subset and kernel parameters of SVM But, there have been no studies that have attempted to determine appropriate instance subset of SVM, although it may improve the performance by eliminating distorted cases. Thus in the study, we propose the simultaneous optimization of the instance selection as well as the parameters of a kernel function of SVM by using genetic algorithms (GAs). Experimental results show that our model outperforms not only conventional SVM, but also prior approaches for optimizing SVM.

  • PDF

SVM 기반 실리콘 웨이퍼 마이크로크랙의 분류성능 분석 (Classification Performance Analysis of Silicon Wafer Micro-Cracks Based on SVM)

  • 김상연;김경범
    • 한국정밀공학회지
    • /
    • 제33권9호
    • /
    • pp.715-721
    • /
    • 2016
  • In this paper, the classification rate of micro-cracks in silicon wafers was improved using a SVM. In case I, we investigated how feature data of micro-cracks and SVM parameters affect a classification rate. As a result, weighting vector and bias did not affect the classification rate, which was improved in case of high cost and sigmoid kernel function. Case II was performed using a more high quality image than that in case I. It was identified that learning data and input data had a large effect on the classification rate. Finally, images from cases I and II and another illumination system were used in case III. In spite of different condition images, good classification rates was achieved. Critical points for micro-crack classification improvement are SVM parameters, kernel function, clustered feature data, and experimental conditions. In the future, excellent results could be obtained through SVM parameter tuning and clustered feature data.

SVM 워크로드 분류기를 통한 자동화된 데이터베이스 워크로드 식별 (Automatic Identification of Database Workloads by using SVM Workload Classifier)

  • 김소연;노홍찬;박상현
    • 한국콘텐츠학회논문지
    • /
    • 제10권4호
    • /
    • pp.84-90
    • /
    • 2010
  • 데이터베이스 시스템의 응용분야가 데이터웨어하우징에서 전자상거래에 이르기까지 광범위해지면서 데이터베이스 시스템이 대형화되었다. 이로 인해 데이터베이스 시스템의 성능 향상을 위한 튜닝이 중요한 논점이 되었다. 데이터베이스 시스템의 튜닝은 워크로드 특성을 고려하여 수행할 필요가 있다. 그러나 복합적인 데이터베이스 환경에서 워크로드를 식별하기는 어려우므로 자동적인 식별 방법이 요구된다. 본 논문에서는 데이터베이스 워크로드를 자동적으로 식별하는 SVM 워크로드 분류기를 제안한다. TPC-C와 TPC-W 성능 평가에서 자원할당 파라미터 변경에 따른 워크로드 데이터를 수집하여 SVM을 통해 분류 한다. SVM의 커널별 커널 파라미터와 오류 허용 임계치 값인 C의 조정을 통하여 최적의 SVM 워크로드 분류기를 선택한다. 제안한 SVM 워크로드 분류기와 Decision Tree, Naive Bayes, Multilayer Perceptron, K-NN 분류기의 분류 성능을 비교한 결과, SVM 워크로드 분류기가 다른 기계 학습 분류기보다 9% 이상 향상된 분류 성능을 보였다.

서포트 벡터 머신을 이용한 건설업 안전보건관리비 예측 모델 (Construction Safety and Health Management Cost Prediction Model using Support Vector Machine)

  • 신성우
    • 한국안전학회지
    • /
    • 제32권1호
    • /
    • pp.115-120
    • /
    • 2017
  • The aim of this study is to develop construction safety and health management cost prediction model using support vector machine (SVM). To this end, theoretical concept of SVM is investigated to formulate the cost prediction model. Input and output variables have been selected by analyzing the balancing accounts for the completed construction project. In order to train and validate the proposed prediction model, 150 data sets have been gathered from field. Effects of SVM parameters on prediction accuracy are analyzed and from which the optimal parameter values have been determined. The prediction performance tests are conducted to confirm the applicability of the proposed model. Based on the results, it is concluded that the proposed SVM model can effectively be used to predict the construction safety and health management cost.