• Title/Summary/Keyword: Support Vector Machines, SVMs

Search Result 91, Processing Time 0.031 seconds

Retrieval of oceanic primary production using support vector machines

  • Tang, Shilin;Chen, Chuqun;Zhan, Haigang
    • Proceedings of the KSRS Conference
    • /
    • v.1
    • /
    • pp.114-117
    • /
    • 2006
  • One of the most important tasks of ocean color observations is to determine the distribution of phytoplankton primary production. A variety of bio-optical algorithms have been developed estimate primary production from these parameters. In this communication, we investigated the possibility of using a novel universal approximator-support vector machines (SVMs)-as the nonlinear transfer function between oceanic primary production and the information that can be directly retrieved from satellite data. The VGPM (Vertically Generalized Production Model) dataset was used to evaluate the proposed approach. The PPARR2 (Primary Production Algorithm Round Robin 2) dataset was used to further compare the precision between the VGPM model and the SVM model. Using this SVM model to calculate the global ocean primary production, the result is 45.5 PgC $yr^{-1}$, which is a little higher than the VGPM result.

  • PDF

Visualizing SVM Classification in Reduced Dimensions

  • Huh, Myung-Hoe;Park, Hee-Man
    • Communications for Statistical Applications and Methods
    • /
    • v.16 no.5
    • /
    • pp.881-889
    • /
    • 2009
  • Support vector machines(SVMs) are known as flexible and efficient classifier of multivariate observations, producing a hyperplane or hyperdimensional curved surface in multidimensional feature space that best separates training samples by known groups. As various methodological extensions are made for SVM classifiers in recent years, it becomes more difficult to understand the constructed model intuitively. The aim of this paper is to visualize various SVM classifications tuned by several parameters in reduced dimensions, so that data analysts secure the tangible image of the products that the machine made.

Support Vector Machine Based Bearing Fault Diagnosis for Induction Motors Using Vibration Signals

  • Hwang, Don-Ha;Youn, Young-Woo;Sun, Jong-Ho;Choi, Kyeong-Ho;Lee, Jong-Ho;Kim, Yong-Hwa
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.4
    • /
    • pp.1558-1565
    • /
    • 2015
  • In this paper, we propose a new method for detecting bearing faults using vibration signals. The proposed method is based on support vector machines (SVMs), which treat the harmonics of fault-related frequencies from vibration signals as fault indices. Using SVMs, the cross-validations are used for a training process, and a two-stage classification process is used for detecting bearing faults and their status. The proposed approach is applied to outer-race bearing fault detection in three-phase squirrel-cage induction motors. The experimental results show that the proposed method can effectively identify the bearing faults and their status, hence improving the accuracy of fault diagnosis.

The Application of RL and SVMs to Decide Action of Mobile Robot

  • Ko, Kwang-won;Oh, Yong-sul;Jung, Qeun-yong;Hoon Heo
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09a
    • /
    • pp.496-499
    • /
    • 2003
  • Support Vector Machines (SVMs) is applied to a practical problem as one of standard tools for machine learning. The application of Reinforcement Learning (RL) and SVMs in action of mobile robot is investigated. A technique to decide the action of autonomous mobile robot in practice is explained in the paper, The proposed method is to find n basis for good action of the system under unknown environment. In multi-dimensional sensor input, the most reasonable action can be automatically decided in each state by RL. Using SVMs, not only optimal decision policy but also generalized state in unknown environment is obtained.

  • 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

Fingerprint Classification using Multiple Decision Templates with SVM (SVM의 다중결정템플릿을 이용한 지문분류)

  • Min Jun-Ki;Hong Jin-Hyuk;Cho Sung-Bae
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.11
    • /
    • pp.1136-1146
    • /
    • 2005
  • Fingerprint classification is useful in an automated fingerprint identification system (AFIS) to reduce the matching time by categorizing fingerprints. Based on Henry system that classifies fingerprints into S classes, various techniques such as neural networks and support vector machines (SVMs) have been widely used to classify fingerprints. Especially, SVMs of high classification performance have been actively investigated. Since the SVM is binary classifier, we propose a novel classifier-combination model, multiple decision templates (MuDTs), to classily fingerprints. The method extracts several clusters of different characteristics from samples of a class and constructs a suitable combination model to overcome the restriction of the single model, which may be subject to the ambiguous images. With the experimental results of the proposed on the FingerCodes extracted from NIST Database4 for the five-class and four-class problems, we have achieved a classification accuracy of $90.4\%\;and\;94.9\%\;with\;1.8\%$ rejection, respectively.

Run-to-Run Fault Detection of Reactive Ion Etching Using Support Vector Machine (Support Vector Machine을 이용한 Reactive ion Etching의 Run-to-Run 오류검출 및 분석)

  • Park Young-Kook;Hong Sang-Jeen;Han Seung-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.5
    • /
    • pp.962-969
    • /
    • 2006
  • To address the importance of the process fault detection for productivity, support vector machines (SVMs) is employed to assist the decision to determine process faults in real-time. The reactive ion etching (RIE) tool data acquired from a production line consist of 59 variables, and each of them consists of 10 data points per second. Principal component analysis (PCA) is first performed to accommodate for real-time data processing by reducing the dimensionality or the data. SVMs for eleven steps or etching m are established with data acquired from baseline runs, and they are further verified with the data from controlled (acceptable) and perturbed (unacceptable) runs. Then, each SVM is further utilized for the fault detection purpose utilizing control limits which is well understood in statistical process control chart. Utilizing SVMs, fault detection of reactive ion etching process is demonstrated with zero false alarm rate of the controlled runs on a run to run basis.

Fault Detection of Reactive Ion Etching Using Time Series Support Vector Machine (Time Series Support Vector Machine을 이용한 Reactive Ion Etching의 오류검출 및 분석)

  • Park Young-Kook;Han Seung-Soo;Hong Sang-J.
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.247-250
    • /
    • 2006
  • Maximizing the productivity in reactive ion etching, early detection of process equipment anomaly became crucial in current high volume semiconductor manufacturing environment. To address the importance of the process fault detection for productivity, support vector machines (SVMs) is employed to assist the decision to determine process faults in real-time. SVMs for eleven steps of etching runs are established with data acquired from baseline runs, and they are further verified with the data from controlled (acceptable) and perturbed (unacceptable) runs. Then, each SVM is further utilized for the fault detection purpose utilizing control limits which is well understood in statistical process control chart. Utilizing SVMs, fault detection of reactive ion etching process is demonstrated with zero false alarm rate of the controlled runs on a run to run basis.

  • PDF

Cavitation Condition Monitoring of Butterfly Valve Using Support Vector Machine (SVM을 이용한 버터플라이 밸브의 캐비테이션 상태감시)

  • 황원우;고명환;양보석
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.14 no.2
    • /
    • pp.119-127
    • /
    • 2004
  • Butterfly valves are popularly used in service in the industrial and water works pipeline systems with large diameter because of its lightweight, simple structure and the rapidity of its manipulation. Sometimes cavitation can occur. resulting in noise, vibration and rapid deterioration of the valve trim, and do not allow further operation. Thus, the monitoring of cavitation is of economic interest and is very importance in industry. This paper proposes a condition monitoring scheme using statistical feature evaluation and support vector machine (SVM) to detect the cavitation conditions of butterfly valve which used as a flow control valve at the pumping stations. The stationary features of vibration signals are extracted from statistical moments. The SVMs are trained, and then classify normal and cavitation conditions of control valves. The SVMs with the reorganized feature vectors can distinguish the class of the untrained and untested data. The classification validity of this method is examined by various signals that are acquired from butterfly valves in the pumping stations and compared the classification success rate with those of self-organizing feature map neural network.

Two dimensional reduction technique of Support Vector Machines for Bankruptcy Prediction

  • Ahn, Hyun-Chul;Kim, Kyoung-Jae;Lee, Ki-Chun
    • 한국경영정보학회:학술대회논문집
    • /
    • 2007.06a
    • /
    • pp.608-613
    • /
    • 2007
  • Prediction of corporate bankruptcies has long been an important topic and has been studied extensively in the finance and management literature because it is an essential basis for the risk management of financial institutions. Recently, support vector machines (SVMs) are becoming popular as a tool for bankruptcy prediction because they use a risk function consisting of the empirical error and a regularized term which is derived from the structural risk minimization principle. In addition, they don't require huge training samples and have little possibility of overfitting. However. in order to Use SVM, a user should determine several factors such as the parameters ofa kernel function, appropriate feature subset, and proper instance subset by heuristics, which hinders accurate prediction results when using SVM In this study, we propose a novel hybrid SVM classifier with simultaneous optimization of feature subsets, instance subsets, and kernel parameters. This study introduces genetic algorithms (GAs) to optimize the feature selection, instance selection, and kernel parameters simultaneously. Our study applies the proposed model to the real-world case for bankruptcy prediction. Experimental results show that the prediction accuracy of conventional SVM may be improved significantly by using our model.

  • PDF