• Title/Summary/Keyword: Algorithm Learning

Search Result 4,976, Processing Time 0.03 seconds

Constructing Neural Networks Using Genetic Algorithm and Learning Neural Networks Using Various Learning Algorithms (유전알고리즘을 이용한 신경망의 구성 및 다양한 학습 알고리즘을 이용한 신경망의 학습)

  • 양영순;한상민
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1998.04a
    • /
    • pp.216-225
    • /
    • 1998
  • Although artificial neural network based on backpropagation algorithm is an excellent system simulator, it has still unsolved problems of its structure-decision and learning method. That is, we cannot find a general approach to decide the structure of the neural network and cannot train it satisfactorily because of the local optimum point which it frequently falls into. In addition, although there are many successful applications using backpropagation learning algorithm, there are few efforts to improve the learning algorithm itself. In this study, we suggest a general way to construct the hidden layer of the neural network using binary genetic algorithm and also propose the various learning methods by which the global minimum value of the teaming error can be obtained. A XOR problem and line heating problems are investigated as examples.

  • PDF

Machine Learning-based Bedscore Stage Classification Algorithm (머신러닝 기반 욕창 단계 분류 알고리즘)

  • Cho, Young-bok;Yoo, Ha-na
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2022.10a
    • /
    • pp.326-327
    • /
    • 2022
  • This study is an algorithm for clinical decision-making using machine learning, and it is an algorithm to classify pressure sores to be used in the development of a system to help prevent pressure sores when nursing staff care for patients who lie down for a long time. As a result of machine learning, the learning accuracy of the algorithm was 82.14% and the test accuracy was 82.58%.

  • PDF

IRSML: An intelligent routing algorithm based on machine learning in software defined wireless networking

  • Duong, Thuy-Van T.;Binh, Le Huu
    • ETRI Journal
    • /
    • v.44 no.5
    • /
    • pp.733-745
    • /
    • 2022
  • In software-defined wireless networking (SDWN), the optimal routing technique is one of the effective solutions to improve its performance. This routing technique is done by many different methods, with the most common using integer linear programming problem (ILP), building optimal routing metrics. These methods often only focus on one routing objective, such as minimizing the packet blocking probability, minimizing end-to-end delay (EED), and maximizing network throughput. It is difficult to consider multiple objectives concurrently in a routing algorithm. In this paper, we investigate the application of machine learning to control routing in the SDWN. An intelligent routing algorithm is then proposed based on the machine learning to improve the network performance. The proposed algorithm can optimize multiple routing objectives. Our idea is to combine supervised learning (SL) and reinforcement learning (RL) methods to discover new routes. The SL is used to predict the performance metrics of the links, including EED quality of transmission (QoT), and packet blocking probability (PBP). The routing is done by the RL method. We use the Q-value in the fundamental equation of the RL to store the PBP, which is used for the aim of route selection. Concurrently, the learning rate coefficient is flexibly changed to determine the constraints of routing during learning. These constraints include QoT and EED. Our performance evaluations based on OMNeT++ have shown that the proposed algorithm has significantly improved the network performance in terms of the QoT, EED, packet delivery ratio, and network throughput compared with other well-known routing algorithms.

A Simulation of Vehicle Parking Distribution System for Local Cultural Festival with Queuing Theory and Q-Learning Algorithm (대기행렬이론과 Q-러닝 알고리즘을 적용한 지역문화축제 진입차량 주차분산 시뮬레이션 시스템)

  • Cho, Youngho;Seo, Yeong Geon;Jeong, Dae-Yul
    • The Journal of Information Systems
    • /
    • v.29 no.2
    • /
    • pp.131-147
    • /
    • 2020
  • Purpose The purpose of this study is to develop intelligent vehicle parking distribution system based on LoRa network at the circumstance of traffic congestion during cultural festival in a local city. This paper proposes a parking dispatch and distribution system using a Q-learning algorithm to rapidly disperse traffics that increases suddenly because of in-bound traffics from the outside of a city in the real-time base as well as to increase parking probability in a parking lot which is widely located in a city. Design/methodology/approach The system get information on realtime-base from the sensor network of IoT (LoRa network). It will contribute to solve the sudden increase in traffic and parking bottlenecks during local cultural festival. We applied the simulation system with Queuing model to the Yudeung Festival in Jinju, Korea. We proposed a Q-learning algorithm that could change the learning policy by setting the acceptability value of each parking lot as a threshold from the Jinju highway IC (Interchange) to the 7 parking lots. LoRa Network platform supports to browse parking resource information to each vehicle in realtime. The system updates Q-table periodically using Q-learning algorithm as soon as get information from parking lots. The Queuing Theory with Poisson arrival distribution is used to get probability distribution function. The Dijkstra algorithm is used to find the shortest distance. Findings This paper suggest a simulation test to verify the efficiency of Q-learning algorithm at the circumstance of high traffic jam in a city during local festival. As a result of the simulation, the proposed algorithm performed well even when each parking lot was somewhat saturated. When an intelligent learning system such as an O-learning algorithm is applied, it is possible to more effectively distribute the vehicle to a lot with a high parking probability when the vehicle inflow from the outside rapidly increases at a specific time, such as a local city cultural festival.

Optimal Learning of Fuzzy Neural Network Using Particle Swarm Optimization Algorithm

  • Kim, Dong-Hwa;Cho, Jae-Hoon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.421-426
    • /
    • 2005
  • Fuzzy logic, neural network, fuzzy-neural network play an important as the key technology of linguistic modeling for intelligent control and decision making in complex systems. The fuzzy-neural network (FNN) learning represents one of the most effective algorithms to build such linguistic models. This paper proposes particle swarm optimization algorithm based optimal learning fuzzy-neural network (PSOA-FNN). The proposed learning scheme is the fuzzy-neural network structure which can handle linguistic knowledge as tuning membership function of fuzzy logic by particle swarm optimization algorithm. The learning algorithm of the PSOA-FNN is composed of two phases. The first phase is to find the initial membership functions of the fuzzy neural network model. In the second phase, particle swarm optimization algorithm is used for tuning of membership functions of the proposed model.

  • PDF

A Study of Algorithm Learning Methods for Improvement of Elementary and Middle School Students' Problem-Solving Abilities (초·중등학생의 문제해결능력 신장을 위한 알고리즘 학습 방안 연구)

  • Kim, Eun-Gil;Kim, Sung-Wan;Hyun, Dong-Lim;Kim, Jong-Jin;Kim, Jong-Hoon
    • Journal of Fisheries and Marine Sciences Education
    • /
    • v.23 no.1
    • /
    • pp.92-104
    • /
    • 2011
  • Korea is a high level of ICT infrastructure Construction in the OECD's PISA 2006. However, the purpose using of ICT was analyzed for the sake of the interest. They have been emphasized a algorithm-based computer education in conference that it was attended by government, industry and university officials. We designed an algorithm curriculum by analyze a case in international ICT training courses and research. And we were proposed various methods, such as web-based contents, play-based programs, outdoor activities and educational programming language learning for algorithm learning at levels of elementary and middle school students.

Unsupervised learning algorithm for signal validation in emergency situations at nuclear power plants

  • Choi, Younhee;Yoon, Gyeongmin;Kim, Jonghyun
    • Nuclear Engineering and Technology
    • /
    • v.54 no.4
    • /
    • pp.1230-1244
    • /
    • 2022
  • This paper proposes an algorithm for signal validation using unsupervised methods in emergency situations at nuclear power plants (NPPs) when signals are rapidly changing. The algorithm aims to determine the stuck failures of signals in real time based on a variational auto-encoder (VAE), which employs unsupervised learning, and long short-term memory (LSTM). The application of unsupervised learning enables the algorithm to detect a wide range of stuck failures, even those that are not trained. First, this paper discusses the potential failure modes of signals in NPPs and reviews previous studies conducted on signal validation. Then, an algorithm for detecting signal failures is proposed by applying LSTM and VAE. To overcome the typical problems of unsupervised learning processes, such as trainability and performance issues, several optimizations are carried out to select the inputs, determine the hyper-parameters of the network, and establish the thresholds to identify signal failures. Finally, the proposed algorithm is validated and demonstrated using a compact nuclear simulator.

Self-Organizing Feature Map with Constant Learning Rate and Binary Reinforcement (일정 학습계수와 이진 강화함수를 가진 자기 조직화 형상지도 신경회로망)

  • 조성원;석진욱
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.1
    • /
    • pp.180-188
    • /
    • 1995
  • A modified Kohonen's self-organizing feature map (SOFM) algorithm which has binary reinforcement function and a constant learning rate is proposed. In contrast to the time-varing adaptaion gain of the original Kohonen's SOFM algorithm, the proposed algorithm uses a constant adaptation gain, and adds a binary reinforcement function in order to compensate for the lowered learning ability of SOFM due to the constant learning rate. Since the proposed algorithm does not have the complicated multiplication, it's digital hardware implementation is much easier than that of the original SOFM.

  • PDF

Fast Super-Resolution Algorithm Based on Dictionary Size Reduction Using k-Means Clustering

  • Jeong, Shin-Cheol;Song, Byung-Cheol
    • ETRI Journal
    • /
    • v.32 no.4
    • /
    • pp.596-602
    • /
    • 2010
  • This paper proposes a computationally efficient learning-based super-resolution algorithm using k-means clustering. Conventional learning-based super-resolution requires a huge dictionary for reliable performance, which brings about a tremendous memory cost as well as a burdensome matching computation. In order to overcome this problem, the proposed algorithm significantly reduces the size of the trained dictionary by properly clustering similar patches at the learning phase. Experimental results show that the proposed algorithm provides superior visual quality to the conventional algorithms, while needing much less computational complexity.

Parameter Optimization of Extreme Learning Machine Using Bacterial Foraging Algorithm (Bacterial Foraging Algorithm을 이용한 Extreme Learning Machine의 파라미터 최적화)

  • Cho, Jae-Hoon;Lee, Dae-Jong;Chun, Myung-Geun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.6
    • /
    • pp.807-812
    • /
    • 2007
  • Recently, Extreme learning machine(ELM), a novel learning algorithm which is much faster than conventional gradient-based learning algorithm, was proposed for single-hidden-layer feedforward neural networks. The initial input weights and hidden biases of ELM are usually randomly chosen, and the output weights are analytically determined by using Moore-Penrose(MP) generalized inverse. But it has the difficulties to choose initial input weights and hidden biases. In this paper, an advanced method using the bacterial foraging algorithm to adjust the input weights and hidden biases is proposed. Experiment at results show that this method can achieve better performance for problems having higher dimension than others.