• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.10
• /
• pp.819-826
• /
• 2001

Genetic algorithms are becoming more popular because of their relative simplicity and robustness. Genetic algorithms are global search techniques for nonlinear optimization. However, traditional genetic algorithms, though robust, are generally not the most successful optimization algorithm on any particular domain because they are poor at hill-climbing, whereas simulated annealing has the ability of probabilistic hill-climbing. Therefore, hybridizing a genetic algorithm with other algorithms can produce better performance than using the genetic algorithm or other algorithms independently. In this paper, we propose an efficient hybrid optimization algorithm named the adaptive random signal-based learning. Random signal-based learning is similar to the reinforcement learning of neural networks. This paper describes the application of genetic algorithms and simulated annealing to a random signal-based learning in order to generate the parameters and reinforcement signal of the random signal-based learning, respectively. The validity of the proposed algorithm is confirmed by applying it to two different examples.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.8 no.3
• /
• pp.220-224
• /
• 2008

This paper presents the polygon-based Q-leaning and Parallel SVM algorithm for object search with multiple robots. We organized an experimental environment with one hundred mobile robots, two hundred obstacles, and ten objects. Then we sent the robots to a hallway, where some obstacles were lying about, to search for a hidden object. In experiment, we used four different control methods: a random search, a fusion model with Distance-based action making (DBAM) and Area-based action making (ABAM) process to determine the next action of the robots, and hexagon-based Q-learning, and dodecagon-based Q-learning and parallel SVM algorithm to enhance the fusion model with Distance-based action making (DBAM) and Area-based action making (ABAM) process. In this paper, the result show that dodecagon-based Q-learning and parallel SVM algorithm is better than the other algorithm to tracking for object.

• 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.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.6
• /
• pp.764-770
• /
• 2004

This paper presents a hybrid data mining mechanism to extract expert knowledge from historical data and extend expert systems' reasoning capabilities by using fuzzy neural network (FNN)-based learning & rule extraction algorithm. Our hybrid data mining mechanism is based on association rule extraction mechanism, FNN learning and fuzzy rule extraction algorithm. Most of traditional data mining mechanisms are depended ()n association rule extraction algorithm. However, the basic association rule-based data mining systems has not the learning ability. Therefore, there is a problem to extend the knowledge base adaptively. In addition, sequential patterns of association rules can`t represent the complicate fuzzy logic in real-world. To resolve these problems, we suggest the hybrid data mining mechanism based on association rule-based data mining, FNN learning and fuzzy rule extraction algorithm. Our hybrid data mining mechanism is consisted of four phases. First, we use general association rule mining mechanism to develop an initial rule base. Then, in the second phase, we adopt the FNN learning algorithm to extract the hidden relationships or patterns embedded in the historical data. Third, after the learning of FNN, the fuzzy rule extraction algorithm will be used to extract the implicit knowledge from the FNN. Fourth, we will combine the association rules (initial rule base) and fuzzy rules. Implementation results show that the hybrid data mining mechanism can reflect both association rule-based knowledge extraction and FNN-based knowledge extension.

• Structural Engineering and Mechanics
• /
• v.47 no.4
• /
• pp.495-511
• /
• 2013

In this paper, a new efficient optimization algorithm called Teaching-Learning-Based Optimization (TLBO) is used for the least weight design of trusses with continuous design variables. The TLBO algorithm is based on the effect of the influence of a teacher on the output of learners in a class. Several truss structures are analyzed to show the efficiency of the TLBO algorithm and the results are compared with those reported in the literature. It is concluded that the TLBO algorithm presented in this study can be effectively used in the weight minimization of truss structures.

• Korean Journal of Artificial Intelligence
• /
• v.5 no.1
• /
• pp.18-28
• /
• 2017

Recently, there are many companies that use systems based on artificial intelligence. The accuracy of artificial intelligence depends on the amount of learning data and the appropriate algorithm. However, it is not easy to obtain learning data with a large number of entity. Less data set have large generalization errors due to overfitting. In order to minimize this generalization error, this study proposed DGA which can expect relatively high accuracy even though data with a less data set is applied to machine learning based genetic algorithm to deep learning based dropout. The idea of this paper is to determine the active state of the nodes. Using Gradient about loss function, A new fitness function is defined. Proposed Algorithm DGA is supplementing stochastic inconsistency about Dropout. Also DGA solved problem by the complexity of the fitness function and expression range of the model about Genetic Algorithm As a result of experiments using MNIST data proposed algorithm accuracy is 75.3%. Using only Dropout algorithm accuracy is 41.4%. It is shown that DGA is better than using only dropout.

• 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.

• International Journal of Advanced Culture Technology
• /
• v.5 no.2
• /
• pp.74-81
• /
• 2017

Recently, there are many companies that use systems based on artificial intelligence. The accuracy of artificial intelligence depends on the amount of learning data and the appropriate algorithm. However, it is not easy to obtain learning data with a large number of entity. Less data set have large generalization errors due to overfitting. In order to minimize this generalization error, this study proposed DGA(Dropout Genetic Algorithm) which can expect relatively high accuracy even though data with a less data set is applied to machine learning based genetic algorithm to deep learning based dropout. The idea of this paper is to determine the active state of the nodes. Using Gradient about loss function, A new fitness function is defined. Proposed Algorithm DGA is supplementing stochastic inconsistency about Dropout. Also DGA solved problem by the complexity of the fitness function and expression range of the model about Genetic Algorithm As a result of experiments using MNIST data proposed algorithm accuracy is 75.3%. Using only Dropout algorithm accuracy is 41.4%. It is shown that DGA is better than using only dropout.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.17 no.5
• /
• pp.297-307
• /
• 2022

The simple procedural segment selection algorithm commonly used in Dynamic Adaptive Streaming over HTTP (DASH) reveals severe weakness to provide high-quality streaming services in the integrated mobile networks of various wired and wireless links. A major issue could be how to properly cope with dynamically changing underlying network conditions. The key to meet it should be to make the segment selection algorithm much more adaptive to fluctuation of network traffics. This paper presents a system architecture that replaces the existing procedural segment selection algorithm with a deep reinforcement learning algorithm based on the Asynchronous Advantage Actor-Critic (A3C). The distributed A3C-based deep learning server is designed and implemented to allow multiple clients in different network conditions to stream videos simultaneously, collect learning data quickly, and learn asynchronously, resulting in greatly improved learning speed as the number of video clients increases. The performance analysis shows that the proposed algorithm outperforms both the conventional DASH algorithm and the Deep Q-Network algorithm in terms of the user's quality of experience and the speed of deep learning.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2277-2298
• /
• 2019

Adaptive learning in e-learning has garnered researchers' interest. In it, learning resources could be recommended automatically to achieve a personalized learning experience. There are various ways to realize it. One of the realistic ways is adaptive learning path recommendation, in which learning resources are provided according to learners' requirements. This paper summarizes existing works and proposes an innovative approach. Firstly, a learner-centred concept map is created using graph theory based on the features of the learners and concepts. Then, the approach generates a linear concept sequence from the concept map using the proposed traversal algorithm. Finally, Learning Objects (LOs), which are the smallest concrete units that make up a learning path, are organized based on the concept sequences. In order to realize this step, we model it as a multi-objective combinatorial optimization problem, and an improved immune algorithm (IIA) is proposed to solve it. In the experimental stage, a series of simulated experiments are conducted on nine datasets with different levels of complexity. The results show that the proposed algorithm increases the computational efficiency and effectiveness. Moreover, an empirical study is carried out to validate the proposed approach from a pedagogical view. Compared with a self-selection based approach and the other evolutionary algorithm based approaches, the proposed approach produces better outcomes in terms of learners' homework, final exam grades and satisfaction.