• Journal of the Korean Institute of Intelligent Systems
• /
• v.26 no.1
• /
• pp.87-92
• /
• 2016

In this paper, optimization technique such as particle swarm optimization was used to optimize the parameters of fuzzy Extreme Learning Machine. While the learning speed of conventional neural networks is very slow, that of Extreme Learning Machine is very fast. Fuzzy Extreme Learning Machine is composed of the Extreme Learning Machine with very fast learning speed and fuzzy logic which can represent the linguistic information of the field experts. The general sigmoid function is used for the activation function of Extreme Learning Machine. However, the activation function of Fuzzy Extreme Learning Machine is the membership function which is defined in the procedure of fuzzy C-Means clustering algorithm. We optimize the parameters of the membership functions by using optimization technique such as Particle Swarm Optimization. In order to validate the classification capability of the proposed classifier, we make several experiments with the various machine learning datas.

• ETRI Journal
• /
• v.33 no.1
• /
• pp.39-49
• /
• 2011

A new structure learning approach for Bayesian networks based on asexual reproduction optimization (ARO) is proposed in this paper. ARO can be considered an evolutionary-based algorithm that mathematically models the budding mechanism of asexual reproduction. In ARO, a parent produces a bud through a reproduction operator; thereafter, the parent and its bud compete to survive according to a performance index obtained from the underlying objective function of the optimization problem: This leads to the fitter individual. The convergence measure of ARO is analyzed. The proposed method is applied to real-world and benchmark applications, while its effectiveness is demonstrated through computer simulations. Results of simulations show that ARO outperforms genetic algorithm (GA) because ARO results in a good structure and fast convergence rate in comparison with GA.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.3
• /
• pp.976-990
• /
• 2020

The k-means algorithm is widely used in academia and industry due to easy and simple implementation, enabling fast learning for complex datasets. However, k-means struggles to classify datasets without prior knowledge of specific domains. We proposed the repulsive k-means (RK-means) algorithm in a previous study to improve the k-means algorithm, using the repulsive force concept, which allows deleting unnecessary cluster centroids. Accordingly, the RK-means enables to classifying of a dataset without domain knowledge. However, three main problems remain. The RK-means algorithm includes a cluster repulsive force offset, for clusters confined in other clusters, which can cause cluster locking; we were unable to prove RK-means provided optimal convergence in the previous study; and RK-means shown better performance only normalize term and weight. Therefore, this paper proposes the advanced RK-means (ARK-means) algorithm to resolve the RK-means problems. We establish an initialization strategy for deploying cluster centroids and define a metric for the ARK-means algorithm. Finally, we redefine the mass and normalize terms to close to the general dataset. We show ARK-means feasibility experimentally using blob and iris datasets. Experiment results verify the proposed ARK-means algorithm provides better performance than k-means, k'-means, and RK-means.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.4
• /
• pp.395-399
• /
• 2005

In this paper, we presents HIGH-Q learning algorithm with reinforcement learning for more fast and exact topic-directed web spidering. The purpose of reinforcement learning is to maximize rewards from environment, an reinforcement learning agents learn by interacting with external environment through trial and error. We performed experiments that compared the proposed method using reinforcement learning with breath first search method for searching the web pages. In result, reinforcement learning method using future discounted rewards searched a small number of pages to find result pages.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.625-628
• /
• 1997

In this paper the new neural network and sliding mode suspension controller is proposed. That neural network is error self-recurrent neural network. For fast on-line learning, this paper use recursive least squares method. A new neural networks converges considerably faster than the backpropagation algorithm and has advantages of being less affected by the poor initial weights and learning rate. The controller for suspension systems is designed according to sliding mode technique based on new proposed neural network.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.3
• /
• pp.90-101
• /
• 2000

In this paper, we propose a controller for differentially steered wheeled mobile robots. The controller uses input-output linearization algorithm and artificial neural network to stabilize the dynamic model and compensate uncertainties. The proposed neural network part has 6 inputs, 1 hidden layer, 2 torque outputs and features fast online learning and good performance on structure error learning basis. Simulation results show that the proposed controller perform precisely tracking of reference path and is robust to uncertainties.

• Proceedings of the KIPE Conference
• /
• 1999.07a
• /
• pp.518-521
• /
• 1999

This paper describes high speed squirrel cage induction motor drives without speed sensors using neural network based on Kalman filter Learning. High speed motors are receiving inverasing attentions in various applications, because of advantages of high speed, small size and light weight with same power level. Larning rate by Kalman filtering is time varying, convergence time fast, effect of initial weight between neurons is small.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.149-158
• /
• 1994

A radial basis hybrid neural network (RHNN) is presented for on-line prediction of machine condition. A modular-based neural architecture is designed for modeling a machine condition process and for predicting future signal. A fast on-line learning algorithm is introduced. Experimental results showed the RHNN could be utilized efficiently for on-line machine condition monitoring.

• Journal of Mechanical Science and Technology
• /
• v.19 no.2
• /
• pp.529-539
• /
• 2005

The development of a fast, accurate, and inexpensive position-controlled pneumatic actuator that may be applied to various practical positioning applications with various external loads is described in this paper. A novel modified pulse-width modulation (MPWM) valve pulsing algorithm allows on/off solenoid valves to be used in place of costly servo valves. A comparison between the system response of the standard PWM technique and that of the modified PWM technique shows that the performance of the proposed technique was significantly increased. A state-feedback controller with position, velocity and acceleration feedback was successfully implemented as a continuous controller. A switching algorithm for control parameters using a learning vector quantization neural network (LVQNN) has newly proposed, which classifies the external load of the pneumatic actuator. The effectiveness of this proposed control algorithm with smooth switching control has been demonstrated through experiments with various external loads.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.9
• /
• pp.2456-2469
• /
• 1996

A digital satellite communication channel has a nonlinearity with memory due to saturation characeristis of the high poer amplifier in the satellite and transmitter/receiver linear filter used in the overall system. In this paper, we propose a complex radial basis function network(CRBFN) based adaptive equalizer for compensation of nonlinearities in digital satellite communication channels. The proposed CRBFN untilizes a complex-valued hybrid learning algorithm of k-means clustering and LMS(least mean sequare) algorithm that is an extension of Moody Darken's algorithm for real-valued data. We evaluate performance of CRBFN in terms of symbol error rates and mean squared errors nder various noise conditions for 4-PSK(phase shift keying) digital modulation schemes and compare with those of comples pth order inverse adaptive Volterra filter. The computer simulation results show that the proposed CRBFN ehibits good equalization, low computational complexity and fast learning capabilities.