• 제목/요약/키워드: Training Algorithm

검색결과 1,850건 처리시간 0.035초

Slime mold and four other nature-inspired optimization algorithms in analyzing the concrete compressive strength

  • Yinghao Zhao;Hossein Moayedi;Loke Kok Foong;Quynh T. Thi
    • Smart Structures and Systems
    • /
    • 제33권1호
    • /
    • pp.65-91
    • /
    • 2024
  • The use of five optimization techniques for the prediction of a strength-based concrete mixture's best-fit model is examined in this work. Five optimization techniques are utilized for this purpose: Slime Mold Algorithm (SMA), Black Hole Algorithm (BHA), Multi-Verse Optimizer (MVO), Vortex Search (VS), and Whale Optimization Algorithm (WOA). MATLAB employs a hybrid learning strategy to train an artificial neural network that combines least square estimation with backpropagation. Thus, 72 samples are utilized as training datasets and 31 as testing datasets, totaling 103. The multi-layer perceptron (MLP) is used to analyze all data, and results are verified by comparison. For training datasets in the best-fit models of SMA-MLP, BHA-MLP, MVO-MLP, VS-MLP, and WOA-MLP, the statistical indices of coefficient of determination (R2) in training phase are 0.9603, 0.9679, 0.9827, 0.9841 and 0.9770, and in testing phase are 0.9567, 0.9552, 0.9594, 0.9888 and 0.9695 respectively. In addition, the best-fit structures for training for SMA, BHA, MVO, VS, and WOA (all combined with multilayer perceptron, MLP) are achieved when the term population size was modified to 450, 500, 250, 150, and 500, respectively. Among all the suggested options, VS could offer a stronger prediction network for training MLP.

잡음음성 음향모델 적응에 기반한 잡음에 강인한 음성인식 (Noise Robust Speech Recognition Based on Noisy Speech Acoustic Model Adaptation)

  • 정용주
    • 말소리와 음성과학
    • /
    • 제6권2호
    • /
    • pp.29-34
    • /
    • 2014
  • In the Vector Taylor Series (VTS)-based noisy speech recognition methods, Hidden Markov Models (HMM) are usually trained with clean speech. However, better performance is expected by training the HMM with noisy speech. In a previous study, we could find that Minimum Mean Square Error (MMSE) estimation of the training noisy speech in the log-spectrum domain produce improved recognition results, but since the proposed algorithm was done in the log-spectrum domain, it could not be used for the HMM adaptation. In this paper, we modify the previous algorithm to derive a novel mathematical relation between test and training noisy speech in the cepstrum domain and the mean and covariance of the Multi-condition TRaining (MTR) trained noisy speech HMM are adapted. In the noisy speech recognition experiments on the Aurora 2 database, the proposed method produced 10.6% of relative improvement in Word Error Rates (WERs) over the MTR method while the previous MMSE estimation of the training noisy speech produced 4.3% of relative improvement, which shows the superiority of the proposed method.

혼돈 시계열의 예측을 위한 Radial Basis 함수 회로망 설계 (Radial basis function network design for chaotic time series prediction)

  • 신창용;김택수;최윤호;박상희
    • 대한전기학회논문지
    • /
    • 제45권4호
    • /
    • pp.602-611
    • /
    • 1996
  • In this paper, radial basis function networks with two hidden layers, which employ the K-means clustering method and the hierarchical training, are proposed for improving the short-term predictability of chaotic time series. Furthermore the recursive training method of radial basis function network using the recursive modified Gram-Schmidt algorithm is proposed for the purpose. In addition, the radial basis function networks trained by the proposed training methods are compared with the X.D. He A Lapedes's model and the radial basis function network by nonrecursive training method. Through this comparison, an improved radial basis function network for predicting chaotic time series is presented. (author). 17 refs., 8 figs., 3 tabs.

  • PDF

The Comparison of Neural Network Learning Paradigms: Backpropagation, Simulated Annealing, Genetic Algorithm, and Tabu Search

  • Chen Ming-Kuen
    • 한국품질경영학회:학술대회논문집
    • /
    • 한국품질경영학회 1998년도 The 12th Asia Quality Management Symposium* Total Quality Management for Restoring Competitiveness
    • /
    • pp.696-704
    • /
    • 1998
  • Artificial neural networks (ANN) have successfully applied into various areas. But, How to effectively established network is the one of the critical problem. This study will focus on this problem and try to extensively study. Firstly, four different learning algorithms ANNs were constructed. The learning algorithms include backpropagation, simulated annealing, genetic algorithm, and tabu search. The experimental results of the above four different learning algorithms were tested by statistical analysis. The training RMS, training time, and testing RMS were used as the comparison criteria.

  • PDF

스플라인 알고리즘을 이용한 비드 가시화 (Bead Visualization Using Spline Algorithm)

  • 구창대;양형석;김맹남
    • Journal of Welding and Joining
    • /
    • 제34권1호
    • /
    • pp.54-58
    • /
    • 2016
  • In this research paper, suggest method of generate same bead as an actual measurement data in virtual welding conditions, exploit morphology information of the bead that acquired through robot welding. It has many multiple risk factors to Beginners welding training, by we make possible to train welding in virtual reality, we can reduce welding training risk and welding material to exploit bead visualization algorithm that we suggest so it will be expected to achieve educational, environmental and economical effect. The proposed method is acquire data to each case performing robot welding by set the voltage, current, working angle, process angle, speed and arc length of welding condition value. As Welding condition value is most important thing in decide bead form, we would selected one of baseline each item and then acquired metal followed another factors change. Welding type is FCAW, SMAW and TIG. When welding trainee perform the training, it's difficult to save all of changed information into database likewise working angle, process angle, speed and arc length. So not saving data into database are applying the method to infer the form of bead using a neural network algorithm. The way of bead's visualization is applying the spline algorithm. To accurately represent Morphological information of the bead, requires much of morphological information, so it can occur problem to save into database that is why we using the spline algorithm. By applying the spline algorithm, it can make simplified data and generate accurate bead shape. Through the research paper, the shape of bead generated by the virtual reality was able to improve the accuracy when compared using the form of bead generated by the robot welding to using the morphological information of the bead generated through the robot welding. By express the accurate shape of bead and so can reduce the difference of the actual welding training and virtual welding, it was confirmed that it can be performed safety and high effective virtual welding education.

미리 순서가 매겨진 학습 데이타를 이용한 효과적인 증가학습 (Efficient Incremental Learning using the Preordered Training Data)

  • 이선영;방승양
    • 한국정보과학회논문지:소프트웨어및응용
    • /
    • 제27권2호
    • /
    • pp.97-107
    • /
    • 2000
  • 증가학습은 점진적으로 학습 데이타를 늘려가며 신경망을 학습시킴으로써 일반적으로 학습시간을 단축시킬 뿐만 아니라 신경망의 일반화 성능을 향상시킨다. 그러나, 기존의 증가학습은 학습 데이타를 선정하는 과정에서 데이타의 중요도를 반복적으로 평가한다. 본 논문에서는 분류 문제의 경우 학습이 시작되기 전에 데이타의 중요도를 한 번만 평가한다. 제안된 방법에서는 분류 문제의 경우 클래스 경계에 가까운 데이타일수록 그 데이타의 중요도가 높다고 보고 이러한 데이타를 선택하는 방법을 제시한다. 두가지 합성 데이타와 실세계 데이타의 실험을 통해 제안된 방법이 기존의 방법보다 학습 시간을 단축시키며 일반화 성능을 향상시킴을 보인다.

  • PDF

유니티 실시간 엔진과 End-to-End CNN 접근법을 이용한 자율주행차 학습환경 (Autonomous-Driving Vehicle Learning Environments using Unity Real-time Engine and End-to-End CNN Approach)

  • 사비르 호사인;이덕진
    • 로봇학회논문지
    • /
    • 제14권2호
    • /
    • pp.122-130
    • /
    • 2019
  • Collecting a rich but meaningful training data plays a key role in machine learning and deep learning researches for a self-driving vehicle. This paper introduces a detailed overview of existing open-source simulators which could be used for training self-driving vehicles. After reviewing the simulators, we propose a new effective approach to make a synthetic autonomous vehicle simulation platform suitable for learning and training artificial intelligence algorithms. Specially, we develop a synthetic simulator with various realistic situations and weather conditions which make the autonomous shuttle to learn more realistic situations and handle some unexpected events. The virtual environment is the mimics of the activity of a genuine shuttle vehicle on a physical world. Instead of doing the whole experiment of training in the real physical world, scenarios in 3D virtual worlds are made to calculate the parameters and training the model. From the simulator, the user can obtain data for the various situation and utilize it for the training purpose. Flexible options are available to choose sensors, monitor the output and implement any autonomous driving algorithm. Finally, we verify the effectiveness of the developed simulator by implementing an end-to-end CNN algorithm for training a self-driving shuttle.

재귀적 분할 평균에 기반한 점진적 규칙 추출 알고리즘 (An Incremental Rule Extraction Algorithm Based on Recursive Partition Averaging)

  • 한진철;김상귀;윤충화
    • 한국정보과학회논문지:소프트웨어및응용
    • /
    • 제34권1호
    • /
    • pp.11-17
    • /
    • 2007
  • 패턴 분류에 많이 사용되는 기법 중의 하나인 메모리 기반 추론 알고리즘은 단순히 메모리에 저장된 학습패턴 또는 초월평면과 테스트 패턴간의 거리를 계산하여 가장 가까운 학습패턴의 클래스로 분류하기 때문에 테스트 패턴을 분류하는 기준을 설명할 수 없다는 문제점을 가지고 있다. 이 문제를 해결하기 위하여, 메모리 기반 학습 기법인 RPA를 기반으로 학습패턴들에 내재된 규칙성을 표현하는 IF-THEN 형태의 규칙을 생성하는 점진적 학습 알고리즘을 제안하였다. 하지만, RPA에 의해 생성된 규칙은 주어진 학습패턴 집합에만 충실히 학습되어 overfitting 현상을 보이게 되며, 또한 패턴 공간의 과도한 분할로 인하여 필요 이상으로 많은 개수의 규칙이 생성된다. 따라서, 본 논문에서는 생성된 규칙으로부터 불필요한 조건을 제거함으로써 ovefitting 현상을 해결함과 동시에 생성되는 규칙의 개수를 줄일 수 있는 점진적 규칙 추출 알고리즘을 제안하였으며, UCI Machine Learning Repository의 벤치마크 데이터를 이용하여 제안한 알고리즘의 성능을 입증하였다.

일반적인 비디오 게임의 AI 에이전트 생성을 위한 개선된 MCTS 알고리즘 (Enhanced MCTS Algorithm for Generating AI Agents in General Video Games)

  • 오평;김지민;김선정;홍석민
    • 한국정보시스템학회지:정보시스템연구
    • /
    • 제25권4호
    • /
    • pp.23-36
    • /
    • 2016
  • Purpose Recently, many researchers have paid much attention to the Artificial Intelligence fields of GVGP, PCG. The paper suggests that the improved MCTS algorithm to apply for the framework can generate better AI agent. Design/methodology/approach As noted, the MCTS generate magnificent performance without an advanced training and in turn, fit applying to the field of GVGP which does not need prior knowledge. The improved and modified MCTS shows that the survival rate is increased interestingly and the search can be done in a significant way. The study was done with 2 different sets. Findings The results showed that the 10 training set which was not given any prior knowledge and the other training set which played a role as validation set generated better performance than the existed MCTS algorithm. Besed upon the results, the further study was suggested.

예측신경회로망 모델의 변별력 있는 학습 (Discriminative Training of Predictive Neural Network Models)

  • 나경민;임재열;안수길
    • The Journal of the Acoustical Society of Korea
    • /
    • 제13권1E호
    • /
    • pp.64-70
    • /
    • 1994
  • 예측신경회로망 모델은 패턴 예측에 의한 매우 효과적인 음성인식 모델이다. 그러나, 그러한 모델은 유사한 어휘간에서 변별력이 떨어지는 단점이 있다. 이 논문에서는 그러한 단점을 극복하기 위한 변별력있는 학습 알고리즘을 제안한다. 이 알고리즘은 최소 분류 오차 수식화와 GPD 알고리즘으로부터 유도외면 그에 따라서 인식 오차의 수를 직접 최소화하는 것이 가능하다. 한국어 숫자음에 대한 인식 실험결과, 기존의 알고리즘에서 발생하는 오인식의 30%를 줄일 수 있었다.

  • PDF