• 제목/요약/키워드: vector optimization

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

A New Support Vector Machine Model Based on Improved Imperialist Competitive Algorithm for Fault Diagnosis of Oil-immersed Transformers

  • Zhang, Yiyi;Wei, Hua;Liao, Ruijin;Wang, Youyuan;Yang, Lijun;Yan, Chunyu
    • Journal of Electrical Engineering and Technology
    • /
    • 제12권2호
    • /
    • pp.830-839
    • /
    • 2017
  • Support vector machine (SVM) is introduced as an effective fault diagnosis technique based on dissolved gases analysis (DGA) for oil-immersed transformers with maximum generalization ability; however, the applicability of the SVM is highly affected due to the difficulty of selecting the SVM parameters appropriately. Therefore, a novel approach combing SVM with improved imperialist competitive algorithm (IICA) for fault diagnosis of oil-immersed transformers was proposed in the paper. The improved ICA, which is proved to be an effective optimization approach, is employed to optimize the parameters of SVM. Cross validation and normalizations were applied in the training processes of SVM and the trained SVM model with the optimized parameters was established for fault diagnosis of oil-immersed transformers. Three classification benchmark sets were studied based on particle swarm optimization SVM (PSOSVM) and IICASVM with four multiple classification schemes to select the best scheme for transformer fault diagnosis. The results show that the proposed model can obtain higher diagnosis accuracy than other methods. The comparisons confirm that the proposed model is an effective approach for classification problems.

진화 알고리즘에서의 벡터 휴리스틱을 이용한 조합 최적화 문제 해결에 관한 연구 (Vector Heuristic into Evolutionary Algorithms for Combinatorial Optimization Problems)

  • 안종일;정경숙;정태충
    • 한국정보처리학회논문지
    • /
    • 제4권6호
    • /
    • pp.1550-1556
    • /
    • 1997
  • 본 논문에서는 진화 알고리즘에 기반하여 조합 최적화 문제를 해결하고자 한다. 진화 알고리즘은 대규모 문제 공간에서 최적화 문제를 해결하는데 적합한 알고리즘이다. 본 논문의 조합 최적화의 예는 경수로 원자로로부터 나온 폐연료를 중수로에서 재사용하는데 필요한 폐연료의 조합 문제이다. 이와 같은 조합 최적화 문제는 0/1 knapsack 문제와 같이 NP-Comprete 문제에 해당한다. 이러한 문제를 해결하기 위해서는 고전적인 진화 알고리즘의 전략에 기반하여 랜덤 연산자를 이용하여 평가 함수 값이 좋은 방향으로만 탐색을 수행하는 방법, 그리고 벡터 연산자를 이용하여 최적의 해를 보다 빨리 얻을 수 있는 휴리스틱을 사용하는 방법이 있다. 본 논문에서는 중수로 연료 조합 문제 영역의 모든 지식을 벡터화하여 벡터의 연산만으로 가능성 검사, 해를 평가하는 방법을 소개한다. 또한 벡터 휴리스틱이 고전적인 진화 알고리즘에 비해 어느 정도의 성능을 보이는지 비교한다.

  • PDF

Fast Training of Structured SVM Using Fixed-Threshold Sequential Minimal Optimization

  • Lee, Chang-Ki;Jang, Myung-Gil
    • ETRI Journal
    • /
    • 제31권2호
    • /
    • pp.121-128
    • /
    • 2009
  • In this paper, we describe a fixed-threshold sequential minimal optimization (FSMO) for structured SVM problems. FSMO is conceptually simple, easy to implement, and faster than the standard support vector machine (SVM) training algorithms for structured SVM problems. Because FSMO uses the fact that the formulation of structured SVM has no bias (that is, the threshold b is fixed at zero), FSMO breaks down the quadratic programming (QP) problems of structured SVM into a series of smallest QP problems, each involving only one variable. By involving only one variable, FSMO is advantageous in that each QP sub-problem does not need subset selection. For the various test sets, FSMO is as accurate as an existing structured SVM implementation (SVM-Struct) but is much faster on large data sets. The training time of FSMO empirically scales between O(n) and O($n^{1.2}$), while SVM-Struct scales between O($n^{1.5}$) and O($n^{1.8}$).

  • PDF

블랭크 설계와 배치의 일체화를 통한 스탬핑 공정 최적화 시스템의 개발 (Development of Stamping Process Optimization System through the Integration of Blank Design and Nesting)

  • 심현보;박종규
    • 소성∙가공
    • /
    • 제12권7호
    • /
    • pp.615-622
    • /
    • 2003
  • In the automobile industry, the design of optimal blank shape becomes a significant part of the stamping. It provides many evident advantages, sush as enhancement of formability, reduction of material cost and product development period. However, the nesting process, required for the optimal usage of materials in the blanking becomes more complicated as the blank shape becomes complicated, like most optimal blank shape. In this study, stamping process optimization system for the optimal usage of material has been developed through the integration of optimal blank design and optimal nesting. For optimal blank design, a radius vector method, the modified version of the initial nodal velocity method, the past work of the present author, have been proposed. Both the optimal blank design and optimal nesting programs have been developed under the GUI environment for the convenience of engineers. The efficiency of the optimization system has been verified with some chosen problems.

Application of machine learning in optimized distribution of dampers for structural vibration control

  • Li, Luyu;Zhao, Xuemeng
    • Earthquakes and Structures
    • /
    • 제16권6호
    • /
    • pp.679-690
    • /
    • 2019
  • This paper presents machine learning methods using Support Vector Machine (SVM) and Multilayer Perceptron (MLP) to analyze optimal damper distribution for structural vibration control. Regarding different building structures, a genetic algorithm based optimization method is used to determine optimal damper distributions that are further used as training samples. The structural features, the objective function, the number of dampers, etc. are used as input features, and the distribution of dampers is taken as an output result. In the case of a few number of damper distributions, multi-class prediction can be performed using SVM and MLP respectively. Moreover, MLP can be used for regression prediction in the case where the distribution scheme is uncountable. After suitable post-processing, good results can be obtained. Numerical results show that the proposed method can obtain the optimized damper distributions for different structures under different objective functions, which achieves better control effect than the traditional uniform distribution and greatly improves the optimization efficiency.

유전자 알고리즘을 이용한 강인한 Support vector machine 설계 (Design of Robust Support Vector Machine Using Genetic Algorithm)

  • 이희성;홍성준;이병윤;김은태
    • 한국지능시스템학회논문지
    • /
    • 제20권3호
    • /
    • pp.375-379
    • /
    • 2010
  • Support vector machine (SVM)은 튼튼한 이론적 배경을 가지고 있고 구조적 위험을 성공적으로 최소화하기 때문에 추천가 시스템과 같은 다양한 패턴 인식 분야에서 사용되고 있다. 하지만 SVM이 초평면을 결정할 때 이상점들은 margin 손실들을 가지고 있기 때문에 이들은 초평면을 결정하는데 매우 중요한 역할을 하고 있다. 그 이유로 SVM은 이상점들에게 매우 민감한 문제점을 갖는다. 강인한 SVM을 위해 우리는 이상점들의 margin 손실의 최대치를 제한하지만 이것은 non-convex 최적화 문제를 포함한다. 따라서 본 논문에서는 non-convex 최적화 문제에 적합한 유전자 알고리즘을 이용하여 강인한 SVM을 설계하는 방법을 제안한다. 제안하는 알고리즘의 우수성을 보여주기 위하여 UCI repository에서 선택된 여러 데이터베이스들을 이용한 실험을 수행하였다.

Short-Term Wind Speed Forecast Based on Least Squares Support Vector Machine

  • Wang, Yanling;Zhou, Xing;Liang, Likai;Zhang, Mingjun;Zhang, Qiang;Niu, Zhiqiang
    • Journal of Information Processing Systems
    • /
    • 제14권6호
    • /
    • pp.1385-1397
    • /
    • 2018
  • There are many factors that affect the wind speed. In addition, the randomness of wind speed also leads to low prediction accuracy for wind speed. According to this situation, this paper constructs the short-time forecasting model based on the least squares support vector machines (LSSVM) to forecast the wind speed. The basis of the model used in this paper is support vector regression (SVR), which is used to calculate the regression relationships between the historical data and forecasting data of wind speed. In order to improve the forecast precision, historical data is clustered by cluster analysis so that the historical data whose changing trend is similar with the forecasting data can be filtered out. The filtered historical data is used as the training samples for SVR and the parameters would be optimized by particle swarm optimization (PSO). The forecasting model is tested by actual data and the forecast precision is more accurate than the industry standards. The results prove the feasibility and reliability of the model.

Hybrid Intelligent System Using PSO/Bacterial Foraging and PID Controller Tuning

  • 김동화
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2006년도 춘계학술대회 학술발표 논문집 제16권 제1호
    • /
    • pp.22-34
    • /
    • 2006
  • o GA-BF approach for improvement of learning and optimization in GA o GA-BF has better response on various test functions o Satisfactory PID controller tuning in AVR, motor vector control systems o Potentially useful in many practically important engineering optimization problems

  • PDF

스파스벡터법을 위한 서열산법의 최적화 (An Optimization of Ordering Algorithm for Sparse Vector Method)

  • 신명철;이준모
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1989년도 하계종합학술대회 논문집
    • /
    • pp.189-194
    • /
    • 1989
  • The sparse vector method is more efficient than conventional sparse matrix method when solving sparse system. This paper considers the structural relation between factorized L and inverse of L and presents a new ordering algorithm for sparse vector method. The method is useful in enhancing the sparsity of the inverse of L while preserving the aparsity of matrix. The performance of algorithm is compared with conventional algorithms by means of several power system.

  • PDF