• Title/Summary/Keyword: SVMs

Search Result 128, Processing Time 0.029 seconds

The Use of Support Vector Machines for Fault Diagnosis of Induction Motors

  • Widodo, Achmad;Yang, Bo-Suk
    • Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
    • /
    • 2006.11a
    • /
    • pp.46-53
    • /
    • 2006
  • This paper presents the fault diagnosis of induction motor based on support vector machine (SVMs). SVMs are well known as intelligent classifier with strong generalization ability. Application SVMs using kernel function is widely used for multi-class classification procedure. In this paper, the algorithm of SVMs will be combined with feature extraction and reduction using component analysis such as independent component analysis, principal component analysis and their kernel (KICA and KPCA). According to the result, component analysis is very useful to extract the useful features and to reduce the dimensionality of features so that the classification procedure in SVM can perform well. Moreover, this method is used to induction motor for faults detection based on vibration and current signals. The results show that this method can well classify and separate each condition of faults in induction motor based on experimental work.

  • PDF

Extended Support Vector Machines for Object Detection and Localization

  • Feyereisl, Jan;Han, Bo-Hyung
    • The Magazine of the IEIE
    • /
    • v.39 no.2
    • /
    • pp.45-54
    • /
    • 2012
  • Object detection is a fundamental task for many high-level computer vision applications such as image retrieval, scene understanding, activity recognition, visual surveillance and many others. Although object detection is one of the most popular problems in computer vision and various algorithms have been proposed thus far, it is also notoriously difficult, mainly due to lack of proper models for object representation, that handle large variations of object structure and appearance. In this article, we review a branch of object detection algorithms based on Support Vector Machines (SVMs), a well-known max-margin technique to minimize classification error. We introduce a few variations of SVMs-Structural SVMs and Latent SVMs-and discuss their applications to object detection and localization.

  • PDF

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

  • Lee, Changki;Jang, Myungil
    • Annual Conference on Human and Language Technology
    • /
    • 2010.10a
    • /
    • pp.100-104
    • /
    • 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

Bio-monitoring System for Early Detection of Toxic Dinoflagellate Alexandrium pacificum Using the Shell Valve Movements of Bivalves (유독 와편모조류 Alexandrium pacificum의 조기 탐지를 위한 이매패류 패각운동 생물모니터링 시스템 연구)

  • Jeong, Soo Yong;Kim, Dae Hyun;Oh, Seok Jin
    • Korean Journal of Remote Sensing
    • /
    • v.38 no.5_3
    • /
    • pp.979-989
    • /
    • 2022
  • We examined changes in the shell valve movements (SVMs) of Mytilus edulis and Crassostrea gigas using a Hall element sensor to investigate the early detection of the toxic dinoflagellate Alexandrium pacificum. No increase or decrease was observed in SVMs caused by the non-toxic algae Isochrysis galbana in both M. edulis and C. gigas. However, when M. edulis and C. gigas were exposed to A. pacificum, which causes paralytic shellfish poisoning, the average SVMs for 12 hours before and after exposure increased from 1.25 times/hr to 2.13 times/hr and 2.23 times/hr to 8.91 times/hr, respectively. After exposure to A. pacificum, the SVMs of M. edulis increased rapidly within 1 hour and then decreased gradually. However, C. gigas showed high SVMs until 4 hours after exposure. SVMs of C. gigas appeared to be more sensitive to toxic dinoflagellate than those of M. edulis. Therefore, these results are expected to be used as basic data for the establishment of a biological monitoring system for early detection of the toxic dinoflagellate A. pacificum.

Prediction of Protein Kinase Specific Phosphorylation Sites with Multiple SVMs

  • Lee, Won-Chul;Kim, Dong-Sup
    • Bioinformatics and Biosystems
    • /
    • v.2 no.1
    • /
    • pp.28-32
    • /
    • 2007
  • The protein phosphorylation is one of the important processes in the cell signaling pathway. A variety of protein kinase families are involved in this process, and each kinase family phosphorylates different kinds of substrate proteins. Many methods to predict the kinase-specific phosphoryrated sites or different types of phosphorylated residues (Serine/Threonine or Tyrosin) have been developed. We employed Supprot Vector Machine (SVM) to attempt the prediction of protein kinase specific phosphorylation sites. 10 different kinds of protein kinase families (PKA, PKC, CK2, CDK, CaM-KII, PKB, MAPK, EGFR) were considered in this study. We defined 9 residues around a phosphorylated residue as a deterministic instance from which protein kinases determine whether they act on. The subsets of PSI-BALST profile was converted to the numerical vectors to represent positive or negative instances. When SVM training, We took advantage of multiple SVMs because of the unbalanced training sets. Representative negative instances were drawn multiple times, and generated new traing sets with the same positive instances in the original traing set. When testing, the final decisions were made by the votes of those multiple SVMs. Generally, RBF kernel was used for the SVMs, and several parameters such as gamma and cost factor were tested. Our approach achieved more than 90% specificity throughout the protein kinase families, while the sensitivities recorded 60% on average.

  • PDF

Support Vector Machines Controlling Noise Influence Effectively (서포트 벡터 기계에서 잡음 영향의 효과적 조절)

  • Kim, Chul-Eung;Yoon, Min
    • The Korean Journal of Applied Statistics
    • /
    • v.16 no.2
    • /
    • pp.261-271
    • /
    • 2003
  • Support Vector Machines (SVMs) provide a powerful performance of the learning system. Generally, SVMs tend to make overfitting. For the purpose of overcoming this difficulty, the definition of soft margin has been introduced. In this case, it causes another difficulty to decide the weight for slack variables reflecting soft margin classifiers. Especially, the error of soft margin algorithm can be bounded by a target margin and some norms of the slack vector. In this paper, we formulate a new soft margin algorithm considering the bound of corruption by noise in data directly. Additionally, through a numerical example, we compare the proposed method with a conventional soft margin algorithm.

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

  • Hong, Jin-Hyuk;Min, Jun-Ki;Cho, Ung-Keun;Cho, Sung-Bae
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.10
    • /
    • pp.886-895
    • /
    • 2006
  • Fingerprint classification reduces the number of matches required in automated fingerprint identification systems by categorizing fingerprints into a predefined class. Support vector machines (SVMs), widely used in pattern classification, have produced a high accuracy rate when performing fingerprint classification. In order to effectively apply SVMs to multi-class fingerprint classification systems, we propose a novel method in which SVMs are generated with the one-vs-all (OVA) scheme and dynamically ordered with $na{\ddot{i}}ve$ Bayes classifiers. More specifically, it uses representative fingerprint features such as the FingerCode, singularities and pseudo ridges to train the OVA SVMs and $na{\ddot{i}}ve$ Bayes classifiers. The proposed method has been validated on the NIST-4 database and produced a classification accuracy of 90.8% for 5-class classification. Especially, it has effectively managed tie problems usually occurred in applying OVA SVMs to multi-class classification.

Shell Valve Movement of Pacific Oysters, Crassostrea gigas, in Response to Low Salinity Water (저염수에서 이매패류 참굴(Crassostrea gigas)의 패각운동)

  • Moon, Suyeon;Oh, Seok Jin
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.23 no.6
    • /
    • pp.684-689
    • /
    • 2017
  • We examined the possibility of developing an early monitoring system using the shell valve movement activity of Pacific oyster (Crassostrea gigas) for early detection of low salinity water in coastal areas. At salinity levels of 30 psu and 20 psu, SVMs were detected $7.32{\pm}3.21times/hr$ and $7.11{\pm}3.90times/hr$, respectively, The patterns and times of SVMs were not significantly different between the two experiment phases. However, at 10 psu and 5 psu, shell valves were observed to be permanently closed in all experiments. Under combined condition (Group 1: temperature $15^{\circ}C$ ${\times}$ salinity 15 psu), SVMs were observed from 20 psu to 30 psu over a 2 - 3 hr period, and then remained closed. In Group 2 (temperature $30^{\circ}C$ ${\times}$ salinity 15 psu), SVMs were observed, which indicated that the physiological condition of the oysters reached a critical point. Thus, it may be possible to utilize SVMs as an early warning signal for low salinity water.

A New Support Vector Machines for Classifying Uncertain Data (불완전 데이터의 패턴 분석을 위한 $_{MI}$SVMs)

  • Kiyoung, Lee;Dae-Won, Kim;Doheon, Lee;Kwang H., Lee
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.10b
    • /
    • pp.703-705
    • /
    • 2004
  • Conventional support vector machines (SVMs) find optimal hyperplanes that have maximal margins by treating all data equivalently. In the real world, however, the data within a data set may differ in degree of uncertainty or importance due to noise, inaccuracies or missing values in the data. Hence, if all data are treated as equivalent, without considering such differences, the optimal hyperplanes identified are likely to be less optimal. In this paper, to more accurately identify the optimal hyperplane in a given uncertain data set, we propose a membership-induced distance from a hyperplane using membership values, and formulate three kinds of membership-induced SVMs.

  • PDF

A Verification Algorithm for Temperature Uniformity of the Large-area Susceptor (대면적 서셉터의 온도 균일도 검증 알고리즘)

  • Yang, Hac Jin;Kim, Seong Kun;Cho, Jung Kun
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.31 no.10
    • /
    • pp.947-954
    • /
    • 2014
  • Performance of next generation susceptor is affected by temperature uniformity in order to produce reliably large-sized flat panel display. In this paper, we propose a learning estimation model of susceptor to predict and appropriately assess the temperature uniformity. Artificial Neural Networks (ANNs) and Support Vector Machines (SVMs) are compared for the suitability of the learning estimation model. It is proved that SVMs provides more suitable verification of uniformity modeling than ANNs during each stage of temperature variations. Practical procedure for uniformity estimation of susceptor temperature was developed using the SVMs prediction algorithm.