• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2006.11a
• /
• pp.19-22
• /
• 2006

Type-2 fuzzy 이론은 기존의 퍼지 이론보다 패턴의 불확실성에 대한 제어를 더 향상시킬 수 있다. 반면에 계산 량이 커지는 문제점 때문에 본 논문에서는 type-2 fuzzy set 대신에 secondary membership이 interval의 형태를 갖는 interval type-2 fuzzy set을 기존의 radial basis function(RBF) neural network에 적용시킨 interval type-2 fuzzy RBF neural network를 제안한다. 제안한 알고리즘은 interval type-2 fuzzy membership function에 의하여 패턴들의 불확실성을 좀 더 잘 제어하여 기존의 RBF neural network의 성능을 향상시킬 수 있다. 본 논문에서는 제안한 알고리즘의 타당성을 보이기 위하여 여러 데이터 집합에 대한 분류 결과를 보인다.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.2
• /
• pp.168-175
• /
• 1999

In this paper, a modified RBF(Radial Basis Function) network structure is suggested for the prediction of a time-series with non-linear, non-stationary characteristics. Coventional RBF network predicting time series by using past outputs sense the trajectory of the time series and react when there exists strong relation between input and hidden activation function's RBF center. But this response is highly sensitive to level and trend of time serieses. In order to overcome such dependencies, hidden activation functions are modified to react to the increments of input variable and multiplied by increment(or dectement) for prediction. When the suggested structure is applied to prediction of Macyey-Glass chaotic time series, Lorenz equation, and Rossler equation, improved performances are obtained.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12C
• /
• pp.1660-1668
• /
• 2004

This paper proposes a Voice Activity Detection (VAD) algorithm based on Radial Basis Function (RBF) network using dual threshold. The k-means clustering and Least Mean Square (LMS) algorithm are used to upade the RBF network to the underlying speech condition. The inputs for RBF are the three parameters in a Code Exited Linear Prediction (CELP) coder, which works stably under various background noise levels. Dual hangover threshold applies in BRF-VAD for reducing error, because threshold value has trade off effect in VAD decision. The experimental result show that the proposed VAD algorithm achieves better performance than G.729 Annex B at any noise level.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.261-263
• /
• 2009

본 연구에서는 복잡한 비선형 모델링 방법인 RBF 뉴럴 네트워크(Radial Basis Function Neural Network)와 PNN(Polynomial Neural Network)을 접목한 새로운 형태의 Radial Basis Function Polynomial Neural Network(RPNN)를 제안한다. RBF 뉴럴 네트워크는 빠른 학습 시간, 일반화 그리고 단순화의 특징으로 비선형 시스템 모델링 등에 적용되고 있으며, PNN은 생성된 노드들 중에서 우수한 결과값을 가진 노드들을 선택함으로써 모델의 근사화 및 일반화에 탁월한 효과를 가진 비선형 모델링 방법이다. 제안된 RPNN모델의 기본적인 구조는 PNN의 형태를 이루고 있으며, 각각의 노드는 RBF 뉴럴 네트워크로 구성하였다. 사용된 RBF 뉴럴 네트워크에서의 커널 함수로는 FCM 클러스터링을 사용하였으며, 각 노드의 후반부는 다항식 구조로 표현하였다. 또한 각 노드의 후반부 파라미터들은 최소자승법을 이용하여 최적화 하였다. 제안한 모델의 적용 및 유용성을 비교 평가하기 위하여 비선형 데이터를 이용하여 그 우수성을 보인다.

• Journal of KIISE:Software and Applications
• /
• v.31 no.5
• /
• pp.555-562
• /
• 2004

Software industry has put more emphasis on maintenance and enhancement work than on the new development. The existing effort estimation models can still be applied to maintenance projects, though modifications are needed. This paper suggests a way to estimate the size of a maintenance project from the regression analysis of ISBSG's benchmarking data. First of all, among the 3 elements(addition, modification and deletion of the program) which influences the software cost, we selected and classified 4 groups from a total of 8 which shows actual maintenance cost from ISBSG's data. Moreover, we developed statistical model and a model which uses RBF(Radial Basis Function) Network and after evaluating each functions we concluded that the RBF Network is superior to the statistical model.

• Journal of Sensor Science and Technology
• /
• v.20 no.3
• /
• pp.151-155
• /
• 2011

A variety of pattern recognition algorithms including neural networks may be applicable to the identification of odors. In this paper, an identification technique for an electronic odor sensing system applicable to wound state monitoring is presented. The performance of the radial basis function(RBF) network is highly dependent on the choice of centers and widths in basis function. For the fine tuning of centers and widths, those parameters are initialized by an ill-conditioned genetic fuzzy c-means algorithm, and the distribution of input patterns in the very first stage, the stochastic gradient(SG), is adapted. The adaptive RBF network with singular value decomposition(SVD), which provides additional adaptation capabilities to the RBF network, is used to process data from array-based gas sensors for early detection of wound infection in burn patients. The primary results indicate that infected patients can be distinguished from uninfected patients.

• Journal of Electrical Engineering and Technology
• /
• v.3 no.4
• /
• pp.468-475
• /
• 2008

This paper presents a method for estimating the transient stability status of the power system using radial basis function(RBF) neural network with a fast hybrid training approach. A normalized transient energy margin(${\Delta}V_n$) has been obtained by the potential energy boundary surface(PEBS) method along with a time-domain simulation technique, and is used as an output of the RBF neural network. The RBF neural network is then trained to map the operating conditions of the power system to the ${\Delta}V_n$, which provides a measure of the transient stability of the power system. The proposed approach has been successfully applied to the 10-machine 39-bus New England test system, and the results are given.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3C
• /
• pp.141-146
• /
• 2005

The authors investigate the convergence speed problem of nonlinear adaptive equalization. Convergence constraints and time constant of radial basis function network using stochastic gradient (RBF-SG) algorithm is analyzed and a method of making time constant independent of hidden-node output power by using sample-by-sample node output power estimation is derived. The method for estimating the node power is to use a single-pole low-pass filter. It is shown by simulation that the proposed algorithm gives faster convergence and lower minimum MSE than the RBF-SG algorithm.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.581-586
• /
• 2001

An increasingly important facet of software development is the ability to estimated the associated coast and effort of development early in the development life cycle. In spite of the most generally sued procedures for estimation of the software development effort and cost were linear regression analysis. As a result of the software complexity and various development environments, the software effort and cost estimates that are grossly inaccurate. The application of nonlinear methods hold the greatest promise for achieving this objects. Therefore this paper presents an RBF (radial basis function) network model that is able to represent the nonlinear relation for software development effort, The research describes appropriate RBF network modeling in the context of a case study for 24 software development projects. Also, this paper compared the RBF network model with a regression analysis model. The RBF network model is the most accuracy of all.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.26-29
• /
• 2002

Radial Basis Function (RBF) networks is known as efficient method in classification problems and function approximation. The basis function of RBF networks is usual adopted normal distribution like the Gaussian function. The output of the Gaussian function has the maximum at the center and decrease as increase the distance from the center. For learning of neural network, the method treating the limited area of input space is sometimes more useful than the method treating the whole of input space. The q-normal distribution is the set of probability density function include the Gaussian function. In this paper, we introduce the RBF networks with the basis function of q-normal distribution and actually approximate a function using the RBF networks.