• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.10a
• /
• pp.420-426
• /
• 1998

Evolutionary algorithms are probabilistic optimization algorithms based on the model of natural evolution. Recently the efforts to improve the performance of evolutionary algorithms have been made extensively. In this paper, we introduce the research for improving the convergence rate and search faculty of evolution algorithms by using reinforcement learning. After providing an introduction to evolution algorithms and reinforcement learning, we present adaptive genetic algorithms, reinforcement genetic programming, and reinforcement evolution strategies which are combined with reinforcement learning. Adaptive genetic algorithms generate mutation probabilities of each locus by interacting with the environment according to reinforcement learning. Reinforcement genetic programming executes crossover and mutation operations based on reinforcement and inhibition mechanism of reinforcement learning. Reinforcement evolution strategies use the variances of fitness occurred by mutation to make the reinforcement signals which estimate and control the step length.

• ETRI Journal
• /
• v.37 no.3
• /
• pp.502-511
• /
• 2015

Intrusion detection plays a key role in detecting attacks over networks, and due to the increasing usage of Internet services, several security threats arise. Though an intrusion detection system (IDS) detects attacks efficiently, it also generates a large number of false alerts, which makes it difficult for a system administrator to identify attacks. This paper proposes automatic fuzzy rule generation combined with a Wiener filter to identify attacks. Further, to optimize the results, simplified swarm optimization is used. After training a large dataset, various fuzzy rules are generated automatically for testing, and a Wiener filter is used to filter out attacks that act as noisy data, which improves the accuracy of the detection. By combining automatic fuzzy rule generation with a Wiener filter, an IDS can handle intrusion detection more efficiently. Experimental results, which are based on collected live network data, are discussed and show that the proposed method provides a competitively high detection rate and a reduced false alarm rate in comparison with other existing machine learning techniques.

• ETRI Journal
• /
• v.45 no.5
• /
• pp.811-821
• /
• 2023

We propose an adaptive unmanned aerial vehicle (UAV)-assisted object recognition algorithm for urban surveillance scenarios. For UAV-assisted surveillance, UAVs are equipped with learning-based object recognition models and can collect surveillance image data. However, owing to the limitations of UAVs regarding power and computational resources, adaptive control must be performed accordingly. Therefore, we introduce a self-adaptive control strategy to maximize the time-averaged recognition performance subject to stability through a formulation based on Lyapunov optimization. Results from performance evaluations on real-world data demonstrate that the proposed algorithm achieves the desired performance improvements.

• Journal of Broadcast Engineering
• /
• v.25 no.2
• /
• pp.157-165
• /
• 2020

In this paper. we propose an effective compensation scheme to the quantization error arisen from quantized learning in a machine learning on an embedded system. In the machine learning based on a gradient descent or nonlinear signal processing, the quantization error generates early vanishing of a gradient and occurs the degradation of learning performance. To compensate such quantization error, we derive an orthogonal compensation vector with respect to a maximum component of the gradient vector. Moreover, instead of the conventional constant learning rate, we propose the adaptive learning rate algorithm without any inner loop to select the step size, based on a nonlinear optimization technique. The simulation results show that the optimization solver based on the proposed quantized method represents sufficient learning performance.

• Journal of the Korea Convergence Society
• /
• v.5 no.4
• /
• pp.163-169
• /
• 2014

A stable neural network control scheme for unknown non-linear systems is developed in this paper. While the control variable is optimised to minimize the performance index, convergence of the index is guaranteed asymptotically stable by a Lyapnov control law. The optimization is achieved using a gradient descent searching algorithm and is consequently slow. A fast convergence algorithm using an adaptive learning rate is employed to speed up the convergence. Application of the stable control to a single input single output (SISO) non-linear system is simulated. The satisfactory control performance is obtained.

• Environmental Engineering Research
• /
• v.25 no.4
• /
• pp.545-553
• /
• 2020

Rainfall-Runoff modeling plays a crucial role in various aspects of water resource management. It helps significantly in resolving the issues related to flood control, protection of agricultural lands, etc. Various Machine learning and statistical-based algorithms have been used for this purpose. These techniques resulted in outcomes with an acceptable rate of success. One of the pertinent machine learning algorithms namely Adaptive Neuro Fuzzy Inference System (ANFIS) has been reported to be a very effective tool for the purpose. However, the computational complexity of ANFIS is a major hindrance in its application. In this paper, we resolved this problem of ANFIS by incorporating one of the evolutionary algorithms known as Particle Swarm Optimization (PSO) which was used in estimating the parameters pertaining to ANFIS. The results of the modified ANFIS were found to be satisfactory. The performance of this modified ANFIS is then compared with conventional ANFIS and another popular statistical modeling technique namely ARIMA model with respect to the forecasting of runoff. In the present investigation, it was found that proposed PSO-ANFIS performed better than ARIMA and conventional ANFIS with respect to the prediction accuracy of runoff.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.38-43
• /
• 2008

In this paper, adaptive channel borrowing approach fuzzy neural networks for load balancing (ACB-FNN) is presented to maximized the number of served calls and the depending on asymmetries traffic load problem. In a wireless network, the call's arrival rate, the call duration and the communication overhead between the base station and the mobile switch center are vague and uncertain. A new load balancing algorithm with cell involved negotiation is also presented in this paper. The ACB-FNN exhibits better learning abilities, optimization abilities, robustness, and fault-tolerant capability thus yielding better performance compared with other algorithms. It aims to efficiently satisfy their diverse quality-of-service (QoS) requirements. The results show that our algorithm has lower blocking rate, lower dropping rate, less update overhead, and shorter channel acquisition delay than previous methods.

• The KIPS Transactions:PartB
• /
• v.10B no.4
• /
• pp.397-402
• /
• 2003

This paper proposes an efficient fixed-point (FP) algorithm for improving performances of the independent component analysis (ICA) based on neural networks. The proposed algorithm is the FP algorithm based on Newton method for ICA using the adaptive learning parameters. The purpose of this algorithm is to improve the separation speed and performance by using the learning parameters in Newton method, which is based on the first order differential computation of entropy optimization function. The learning rate and the moment are adaptively adjusted according to an updating state of inverse mixing matrix. The proposed algorithm has been applied to the fingerprints and the images generated by random mixing matrix in the 8 fingerprints of 256${\times}$256-pixel and the 10 images of 512$\times$512-pixel, respectively. The simulation results show that the proposed algorithm has the separation speed and performance better than those using the conventional FP algorithm based on Newton method. Especially, the proposed algorithm gives relatively larger improvement degree as the problem size increases.

• MALSORI
• /
• no.66
• /
• pp.73-86
• /
• 2008

Beamforming is one of the spatial filtering techniques which extract only desired signals from noisy environments using microphone arrays. Fixed beamforming is a simple concept and easy to implement. However, it does not show good performance in real noisy conditions. As an adaptive beamforming, Frost algorithm can be a good candidate. It uses the concept of the linearly constrained minimum variance (LCMV) algorithm. The difference between the Frost and the LCMV algorithm is the error correction scheme which is very effective feature in the aspect of performance. In this paper, as quadrature mirror filtering (QMF)-based filterbank is utilized as the pre-processing of the Frost beamformning, the filter length and the learning rate of each band is optimized to improve the performance. The performance is measured by the signal-to-noise ratio (SNR) and the Bark's scale spectral distortion (BSD).

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.3
• /
• pp.223-230
• /
• 2001

Since self-organizing map (SOM) preserves the topology of ordering in input spaces and trains itself by unsupervised algorithm, it is Llsed in many areas. However, SOM has a shortcoming: structure cannot be easily detcrmined without many trials-and-errors. Structure-adaptive self-orgnizing map (SASOM) which can adapt its structure as well as its weights overcome the shortcoming of self-organizing map: SASOM makes use of structure adaptation capability to place the nodes of prototype vectors into the pattern space accurately so as to make the decision boundmies as close to the class boundaries as possible. In this scheme, the initialization of weights of newly adapted nodes is important. This paper proposes a method which optimizes SASOM with genetic algorithm (GA) to determines the weight vector of newly split node. The leanling algorithm is a hybrid of unsupervised learning method and supervised learning method using LVQ algorithm. This proposed method not only shows higher performance than SASOM in terms of recognition rate and variation, but also preserves the topological order of input patterns well. Experiments with 2D pattern space data and handwritten digit database show that the proposed method is promising.