• 제목/요약/키워드: Support Vector Machines, SVMs

검색결과 91건 처리시간 0.031초

포섭구조 일대다 지지벡터기계와 Naive Bayes 분류기를 이용한 효과적인 지문분류 (Effective Fingerprint Classification using Subsumed One-Vs-All Support Vector Machines and Naive Bayes Classifiers)

  • 홍진혁;민준기;조웅근;조성배
    • 한국정보과학회논문지:소프트웨어및응용
    • /
    • 제33권10호
    • /
    • pp.886-895
    • /
    • 2006
  • 지문분류는 사전에 정의된 클래스로 입력된 지문을 분류하여 자동지문인식 시스템에서 비교해야할 지문의 수를 줄여준다. 지지벡터기계(support vector machine; SVM)는 패턴인식 분야에서 널리 사용되고 있을 뿐만 아니라 지문분류에서도 높은 성능을 보이고 있다. SVM은 이진클래스 분류기이기 때문에 다중클래스 문제인 지문분류를 위해서 적절한 분류기 생성과 결합 기법이 필요하며, 본 논문에서는 일대다(one-vs-all; OVA) 방식으로 구성된 SVM을 naive Bayes(NB) 분류기를 이용하여 동적으로 구성하는 분류방법을 제안한다. 지문분류에서 대표적으로 사용되는 특징인 FingerCode와 지문의 구조적 특징인 특이점과 의사융선을 사용하여 OVA SVM과 NB 분류기를 학습하고, 포섭구조의 분류기를 구성하여 효과적인 지문분류를 수행한다. NIST-4 데이타베이스에 제안하는 방법을 적용하여 5클래스 분류에 대해서 90.8%의 높은 분류율을 획득하였으며, OVA 전략의 SVM을 다중클래스 분류문제에 적용할 때 발생하는 동점문제를 효과적으로 처리하였다.

Support Vector Machines에 의한 음소 분할 및 인식 (Phoneme segmentation and Recognition using Support Vector Machines)

  • 이광석;김현덕
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2010년도 춘계학술대회
    • /
    • pp.981-984
    • /
    • 2010
  • 우리는 본 연구에서 학습방법으로서 연속음성을 초성, 중성, 종성의 음소단위로 분할하기 위하여 인공 신경회로망의 하나인 SVMs을 사용하였으며 분할한 음소단위의 음성으로 연속음성인식에 적용하여 그 성능을 살펴보았다. 음소경계는 단 구간에서의 최대 주파수를 가진 알고리듬에 의하여 결정되며 또한 음성인식처리는 CHMM에 의하여 이루어지며 목측에 의한 분할결과와도 비교하여 살펴보았다. 시뮬레이션 결과로부터 초성의 분할성능에서 제안한 SVMs를 적용한 결과가 GMMs보다 효율적인을 알 수 있었다.

  • PDF

Structural SVMs 및 Pegasos 알고리즘을 이용한 한국어 개체명 인식 (Named Entity Recognition with Structural SVMs and Pegasos algorithm)

  • 이창기;장명길
    • 인지과학
    • /
    • 제21권4호
    • /
    • pp.655-667
    • /
    • 2010
  • 개체명 인식은 정보 추출의 한 단계로서 정보검색 분야 뿐 아니라 질의응답과 요약 분야에서 매우 유용하게 사용되고 있다. 본 논문에서는 structural Support Vector Machines(structural SVMs) 및 수정된 Pegasos 알고리즘을 이용한 한국어 개체명 인식 시스템에 대하여 기술하고 기존의 Conditional Random Fields(CRFs)를 이용한 시스템과의 성능을 비교한다. 실험결과 structural SVMs과 수정된 Pegasos 알고리즘이 기존의 CRFs 보다 높은 성능을 보였고(신뢰도 99%에서 통계적으로 유의함), structural SVMs과 수정된 Pegasos 알고리즘의 성능은 큰 차이가 없음(통계적으로 유의하지 않음)을 알 수 있었다. 특히 본 논문에서 제안하는 수정된 Pegasos 알고리즘을 이용한 경우 CRFs를 이용한 시스템보다 높은 성능(TV 도메인 F1=85.43, 스포츠 도메인 F1=86.79)을 유지하면서 학습 시간은 4%로 줄일 수 있었다.

  • PDF

Lamb파와 SVM을 이용한 강구조물의 건전성 감시기법 (Health Monitoring of Steel Plates Using Lamb Waves and Support Vector Machines)

  • 박승희;윤정방;노용래
    • 한국지진공학회:학술대회논문집
    • /
    • 한국지진공학회 2005년도 학술발표회 논문집
    • /
    • pp.331-342
    • /
    • 2005
  • This paper presents a non-destructive evaluation (NDE) technique for detecting damages on a jointed steel plate on the basis of the time of flight and wavelet coefficient, obtained from wavelet transforms of Lamb wave signals. Support vector machines (SVMs), which is a tool for pattern classification problems, was applied to the damage estimation. Two kinds of damages were artificially introduced by loosening bolts located in the path of the Lamb waves and those out of the path. The damage cases were used for the establishment of the optimal decision boundaries which divide each damage class's region from the intact class. In this study, the applicability of the SVMs was investigated for the damages in and out of the Lamb wave path. It has been found that the present methods are very efficient in detecting the damages simulated by loose bolts on the jointed steel plate.

  • PDF

An Application of Support Vector Machines to Customer Loyalty Classification of Korean Retailing Company Using R Language

  • 응위엔푸티엔;이영찬
    • 한국정보시스템학회지:정보시스템연구
    • /
    • 제26권4호
    • /
    • pp.17-37
    • /
    • 2017
  • Purpose Customer Loyalty is the most important factor of customer relationship management (CRM). Especially in retailing industry, where customers have many options of where to spend their money. Classifying loyal customers through customers' data can help retailing companies build more efficient marketing strategies and gain competitive advantages. This study aims to construct classification models of distinguishing the loyal customers within a Korean retailing company using data mining techniques with R language. Design/methodology/approach In order to classify retailing customers, we used combination of support vector machines (SVMs) and other classification algorithms of machine learning (ML) with the support of recursive feature elimination (RFE). In particular, we first clean the dataset to remove outlier and impute the missing value. Then we used a RFE framework for electing most significant predictors. Finally, we construct models with classification algorithms, tune the best parameters and compare the performances among them. Findings The results reveal that ML classification techniques can work well with CRM data in Korean retailing industry. Moreover, customer loyalty is impacted by not only unique factor such as net promoter score but also other purchase habits such as expensive goods preferring or multi-branch visiting and so on. We also prove that with retailing customer's dataset the model constructed by SVMs algorithm has given better performance than others. We expect that the models in this study can be used by other retailing companies to classify their customers, then they can focus on giving services to these potential vip group. We also hope that the results of this ML algorithm using R language could be useful to other researchers for selecting appropriate ML algorithms.

Using Estimated Probability from Support Vector Machines for Credit Rating in IT Industry

  • 홍태호;신택수
    • 한국지능정보시스템학회:학술대회논문집
    • /
    • 한국지능정보시스템학회 2005년도 공동추계학술대회
    • /
    • pp.509-515
    • /
    • 2005
  • Recently, support vector machines (SVMs) are being recognized as competitive tools as compared with other data mining techniques for solving pattern recognition or classification decision problems. Furthermore, many researches, in particular, have proved it more powerful than traditional artificial neural networks (ANNs)(Amendolia et al., 2003; Huang et al., 2004, Huang et al., 2005; Tay and Cao, 2001; Min and Lee, 2005; Shin et al, 2005; Kim, 2003). The classification decision, such as a binary or multi-class decision problem, used by any classifier, i.e. data mining techniques is cost-sensitive. Therefore, it is necessary to convert the output of the classifier into well-calibrated posterior probabilities. However, SVMs basically do not provide such probabilities. So it required to use any method to create probabilities (Platt, 1999; Drish, 2001). This study applies a method to estimate the probability of outputs of SVM to bankruptcy prediction and then suggests credit scoring methods using the estimated probability for bank's loan decision making.

  • PDF

ESTIMATION OF THE POWER PEAKING FACTOR IN A NUCLEAR REACTOR USING SUPPORT VECTOR MACHINES AND UNCERTAINTY ANALYSIS

  • Bae, In-Ho;Na, Man-Gyun;Lee, Yoon-Joon;Park, Goon-Cherl
    • Nuclear Engineering and Technology
    • /
    • 제41권9호
    • /
    • pp.1181-1190
    • /
    • 2009
  • Knowing more about the Local Power Density (LPD) at the hottest part of a nuclear reactor core can provide more important information than knowledge of the LPD at any other position. The LPD at the hottest part needs to be estimated accurately in order to prevent the fuel rod from melting in a nuclear reactor. Support Vector Machines (SVMs) have successfully been applied in classification and regression problems. Therefore, in this paper, the power peaking factor, which is defined as the highest LPD to the average power density in a reactor core, was estimated by SVMs which use numerous measured signals of the reactor coolant system. The SVM models were developed by using a training data set and validated by an independent test data set. The SVM models' uncertainty was analyzed by using 100 sampled training data sets and verification data sets. The prediction intervals were very small, which means that the predicted values were very accurate. The predicted values were then applied to the first fuel cycle of the Yonggwang Nuclear Power Plant Unit 3. The root mean squared error was approximately 0.15%, which is accurate enough for use in LPD monitoring and for core protection that uses LPD estimation.

Application of Support Vector Machines to the Prediction of KOSPI

  • Kim, Kyoung-jae
    • 한국지능정보시스템학회:학술대회논문집
    • /
    • 한국지능정보시스템학회 2003년도 춘계학술대회
    • /
    • pp.329-337
    • /
    • 2003
  • Stock market prediction is regarded as a challenging task of financial time-series prediction. There have been many studies using artificial neural networks in this area. Recently, support vector machines (SVMs) are regarded as promising methods for the prediction of financial time-series because they me a risk function consisting the empirical ewer and a regularized term which is derived from the structural risk minimization principle. In this study, I apply SVM to predicting the Korea Composite Stock Price Index (KOSPI). In addition, this study examines the feasibility of applying SVM in financial forecasting by comparing it with back-propagation neural networks and case-based reasoning. The experimental results show that SVM provides a promising alternative to stock market prediction.

  • PDF

SVM을 이용한 자동 음소분할에 관한 연구 (Research about auto-segmentation via SVM)

  • 권호민;한학용;김창근;허강인
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
    • /
    • pp.2220-2223
    • /
    • 2003
  • In this paper we used Support Vector Machines(SVMs) recently proposed as the loaming method, one of Artificial Neural Network, to divide continuous speech into phonemes, an initial, medial, and final sound, and then, performed continuous speech recognition from it. Decision boundary of phoneme is determined by algorithm with maximum frequency in a short interval. Recognition process is performed by Continuous Hidden Markov Model(CHMM), and we compared it with another phoneme divided by eye-measurement. From experiment we confirmed that the method, SVMs, we proposed is more effective in an initial sound than Gaussian Mixture Models(GMMs).

  • PDF

Membership Function-based Classification Algorithms for Stability improvements of BCI Systems

  • Yeom, Hong-Gi;Sim, Kwee-Bo
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제10권1호
    • /
    • pp.59-64
    • /
    • 2010
  • To improve system performance, we apply the concept of membership function to Variance Considered Machines (VCMs) which is a modified algorithm of Support Vector Machines (SVMs) proposed in our previous studies. Many classification algorithms separate nonlinear data well. However, existing algorithms have ignored the fact that probabilities of error are very high in the data-mixed area. Therefore, we make our algorithm ignore data which has high error probabilities and consider data importantly which has low error probabilities to generate system output according to the probabilities of error. To get membership function, we calculate sigmoid function from the dataset by considering means and variances. After computation, this membership function is applied to the VCMs.