• Title/Summary/Keyword: Backpropagation algorithm

Search Result 351, Processing Time 0.024 seconds

(The Development of Janggi Board Game Using Backpropagation Neural Network and Q Learning Algorithm) (역전파 신경회로망과 Q학습을 이용한 장기보드게임 개발)

  • 황상문;박인규;백덕수;진달복
    • Journal of the Institute of Electronics Engineers of Korea TE
    • /
    • v.39 no.1
    • /
    • pp.83-90
    • /
    • 2002
  • This paper proposed the strategy learning method by means of the fusion of Back-Propagation neural network and Q learning algorithm for two-person, deterministic janggi board game. The learning process is accomplished simply through the playing each other. The system consists of two parts of move generator and search kernel. The one consists of move generator generating the moves on the board, the other consists of back-propagation and Q learning plus $\alpha$$\beta$ search algorithm in an attempt to learn the evaluation function. while temporal difference learns the discrepancy between the adjacent rewards, Q learning acquires the optimal policies even when there is no prior knowledge of effects of its moves on the environment through the learning of the evaluation function for the augmented rewards. Depended on the evaluation function through lots of games through the learning procedure it proved that the percentage won is linearly proportional to the portion of learning in general.

An Analysis of Intrusion Pattern Based on Backpropagation Algorithm (역전파 알고리즘 기반의 침입 패턴 분석)

  • Woo Chong-Woo;Kim Sang-Young
    • Journal of Internet Computing and Services
    • /
    • v.5 no.5
    • /
    • pp.93-103
    • /
    • 2004
  • The main function of the intrusion Detection System (IDS) usee to be more or less passive detection of the intrusion evidences, but recently it is developed with more diverse types and methodologies. Especially, it is required that the IDS should process large system audit data fast enough. Therefore the data mining or neural net algorithm is being focused on, since they could satisfy those situations. In this study, we first surveyed and analyzed the several recent intrusion trends and types. And then we designed and implemented an IDS using back-propagation algorithm of the neural net, which could provide more effective solution. The distinctive feature of our study could be stated as follows. First, we designed the system that allows both the Anomaly dection and the Misuse detection. Second, we carried out the intrusion analysis experiment by using the reliable KDD Cup ‘99 data, which would provide us similar results compared to the real data. Finally, we designed the system based on the object-oriented concept, which could adapt to the other algorithms easily.

  • PDF

Online Handwritten Digit Recognition by Smith-Waterman Alignment (Smith-Waterman 정렬 알고리즘을 이용한 온라인 필기체 숫자인식)

  • Mun, Won-Ho;Choi, Yeon-Seok;Lee, Sang-Geol;Cha, Eui-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.9
    • /
    • pp.27-33
    • /
    • 2011
  • In this paper, we propose an efficient on-line handwritten digit recognition base on Convex-Concave curves feature which is extracted by a chain code sequence using Smith-Waterman alignment algorithm. The time sequential signal from mouse movement on the writing pad is described as a sequence of consecutive points on the x-y plane. So, we can create data-set which are successive and time-sequential pixel position data by preprocessing. Data preprocessed is used for Convex-Concave curves feature extraction. This feature is scale-, translation-, and rotation-invariant. The extracted specific feature is fed to a Smith-Waterman alignment algorithm, which in turn classifies it as one of the nine digits. In comparison with backpropagation neural network, Smith-Waterman alignment has the more outstanding performance.

An Enhancement of Learning Speed of the Error - Backpropagation Algorithm (오류 역전도 알고리즘의 학습속도 향상기법)

  • Shim, Bum-Sik;Jung, Eui-Yong;Yoon, Chung-Hwa;Kang, Kyung-Sik
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.7
    • /
    • pp.1759-1769
    • /
    • 1997
  • The Error BackPropagation (EBP) algorithm for multi-layered neural networks is widely used in various areas such as associative memory, speech recognition, pattern recognition and robotics, etc. Nevertheless, many researchers have continuously published papers about improvements over the original EBP algorithm. The main reason for this research activity is that EBP is exceeding slow when the number of neurons and the size of training set is large. In this study, we developed new learning speed acceleration methods using variable learning rate, variable momentum rate and variable slope for the sigmoid function. During the learning process, these parameters should be adjusted continuously according to the total error of network, and it has been shown that these methods significantly reduced learning time over the original EBP. In order to show the efficiency of the proposed methods, first we have used binary data which are made by random number generator and showed the vast improvements in terms of epoch. Also, we have applied our methods to the binary-valued Monk's data, 4, 5, 6, 7-bit parity checker and real-valued Iris data which are famous benchmark training sets for machine learning.

  • PDF

Prediction of Transient Ischemia Using ECG Signals (심전도 신호를 이용한 일시적 허혈 예측)

  • Han-Go Choi;Roger G. Mark
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.5 no.3
    • /
    • pp.190-197
    • /
    • 2004
  • This paper presents automated prediction of transient ischemic episodes using neural networks(NN) based pattern matching method. The learning algorithm used to train the multilayer networks is a modified backpropagation algorithm. The algorithm updates parameters of nonlinear function in a neuron as well as connecting weights between neurons to improve learning speed. The performance of the method was evaluated using ECG signals of the MIT/BIH long-term database. Experimental results for 15 records(237 ischemic episodes) show that the average sensitivity and specificity of ischemic episode prediction are 85.71% and 71.11%, respectively. It is also found that the proposed method predicts an average of 45.53[sec] ahead real ischemia. These results indicate that the NN approach as the pattern matching classifier can be a useful tool for the prediction of transient ischemic episodes.

  • PDF

The Development of Dynamic Forecasting Model for Short Term Power Demand using Radial Basis Function Network (Radial Basis 함수를 이용한 동적 - 단기 전력수요예측 모형의 개발)

  • Min, Joon-Young;Cho, Hyung-Ki
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.7
    • /
    • pp.1749-1758
    • /
    • 1997
  • This paper suggests the development of dynamic forecasting model for short-term power demand based on Radial Basis Function Network and Pal's GLVQ algorithm. Radial Basis Function methods are often compared with the backpropagation training, feed-forward network, which is the most widely used neural network paradigm. The Radial Basis Function Network is a single hidden layer feed-forward neural network. Each node of the hidden layer has a parameter vector called center. This center is determined by clustering algorithm. Theatments of classical approached to clustering methods include theories by Hartigan(K-means algorithm), Kohonen(Self Organized Feature Maps %3A SOFM and Learning Vector Quantization %3A LVQ model), Carpenter and Grossberg(ART-2 model). In this model, the first approach organizes the load pattern into two clusters by Pal's GLVQ clustering algorithm. The reason of using GLVQ algorithm in this model is that GLVQ algorithm can classify the patterns better than other algorithms. And the second approach forecasts hourly load patterns by radial basis function network which has been constructed two hidden nodes. These nodes are determined from the cluster centers of the GLVQ in first step. This model was applied to forecast the hourly loads on Mar. $4^{th},\;Jun.\;4^{th},\;Jul.\;4^{th},\;Sep.\;4^{th},\;Nov.\;4^{th},$ 1995, after having trained the data for the days from Mar. $1^{th}\;to\;3^{th},\;from\;Jun.\;1^{th}\;to\;3^{th},\;from\;Jul.\;1^{th}\;to\;3^{th},\;from\;Sep.\;1^{th}\;to\;3^{th},\;and\;from\;Nov.\;1^{th}\;to\;3^{th},$ 1995, respectively. In the experiments, the average absolute errors of one-hour ahead forecasts on utility actual data are shown to be 1.3795%.

  • PDF

Model Analysis of AI-Based Water Pipeline Improved Decision (AI기반 상수도시설 개량 의사결정 모델 분석)

  • Kim, Gi-Tae;Min, Byung-Won;Oh, Yong-Sun
    • Journal of Internet of Things and Convergence
    • /
    • v.8 no.5
    • /
    • pp.11-16
    • /
    • 2022
  • As an interest in the development of artificial intelligence(AI) technology in the water supply sector increases, we have developed an AI algorithm that can predict improvement decision-making ratings through repetitive learning using the data of pipe condition evaluation results, and present the most reliable prediction model through a verification process. We have developed the algorithm that can predict pipe ratings by pre-processing 12 indirect evaluation items based on the 2020 Han River Basin's basic plan and applying the AI algorithm to update weighting factors through backpropagation. This method ensured that the concordance rate between the direct evaluation result value and the calculated result value through repetitive learning and verification was more than 90%. As a result of the algorithm accuracy verification process, it was confirmed that all water pipe type data were evenly distributed, and the more learning data, the higher prediction accuracy. If data from all across the country is collected, the reliability of the prediction technique for pipe ratings using AI algorithm will be improved, and therefore, it is expected that the AI algorithm will play a role in supporting decision-making in the objective evaluation of the condition of aging pipes.

Consolidation of Subtasks for Target Task in Pipelined NLP Model

  • Son, Jeong-Woo;Yoon, Heegeun;Park, Seong-Bae;Cho, Keeseong;Ryu, Won
    • ETRI Journal
    • /
    • v.36 no.5
    • /
    • pp.704-713
    • /
    • 2014
  • Most natural language processing tasks depend on the outputs of some other tasks. Thus, they involve other tasks as subtasks. The main problem of this type of pipelined model is that the optimality of the subtasks that are trained with their own data is not guaranteed in the final target task, since the subtasks are not optimized with respect to the target task. As a solution to this problem, this paper proposes a consolidation of subtasks for a target task ($CST^2$). In $CST^2$, all parameters of a target task and its subtasks are optimized to fulfill the objective of the target task. $CST^2$ finds such optimized parameters through a backpropagation algorithm. In experiments in which text chunking is a target task and part-of-speech tagging is its subtask, $CST^2$ outperforms a traditional pipelined text chunker. The experimental results prove the effectiveness of optimizing subtasks with respect to the target task.

Text-Independent Speaker Identification System Based On Vowel And Incremental Learning Neural Networks

  • Heo, Kwang-Seung;Lee, Dong-Wook;Sim, Kwee-Bo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.1042-1045
    • /
    • 2003
  • In this paper, we propose the speaker identification system that uses vowel that has speaker's characteristic. System is divided to speech feature extraction part and speaker identification part. Speech feature extraction part extracts speaker's feature. Voiced speech has the characteristic that divides speakers. For vowel extraction, formants are used in voiced speech through frequency analysis. Vowel-a that different formants is extracted in text. Pitch, formant, intensity, log area ratio, LP coefficients, cepstral coefficients are used by method to draw characteristic. The cpestral coefficients that show the best performance in speaker identification among several methods are used. Speaker identification part distinguishes speaker using Neural Network. 12 order cepstral coefficients are used learning input data. Neural Network's structure is MLP and learning algorithm is BP (Backpropagation). Hidden nodes and output nodes are incremented. The nodes in the incremental learning neural network are interconnected via weighted links and each node in a layer is generally connected to each node in the succeeding layer leaving the output node to provide output for the network. Though the vowel extract and incremental learning, the proposed system uses low learning data and reduces learning time and improves identification rate.

  • PDF

A Study on Automatic Classification System of Red Blood Cell for Pathological Diagnosis in Blood Digitial Image (혈액영상에서 병리진단을 위한 적혈구 세포의 자동분류에 관한 연구)

  • 김경수;김동현
    • Journal of the Korea Society of Computer and Information
    • /
    • v.4 no.1
    • /
    • pp.47-53
    • /
    • 1999
  • In medical field, the computer has been used in the automatic processing of data derived in hospital. the automation of diagonal devices, and processing of medical digital images. In this paper, we classify red blood cell into 16 class including normal cell to the automation of blood analysis to diagnose disease. First, using UNL Fourier and invariant moment algorithm, we extract features of red blood cell from blood cell image and then construct multi-layer backpropagation neural network to recognize. We proof that the system can give support to blood analyzer through blood sample analysis of 10 patients.

  • PDF