• 대한전기학회논문지
• /
• 제45권4호
• /
• pp.602-611
• /
• 1996

In this paper, radial basis function networks with two hidden layers, which employ the K-means clustering method and the hierarchical training, are proposed for improving the short-term predictability of chaotic time series. Furthermore the recursive training method of radial basis function network using the recursive modified Gram-Schmidt algorithm is proposed for the purpose. In addition, the radial basis function networks trained by the proposed training methods are compared with the X.D. He A Lapedes's model and the radial basis function network by nonrecursive training method. Through this comparison, an improved radial basis function network for predicting chaotic time series is presented. (author). 17 refs., 8 figs., 3 tabs.

• Journal of applied mathematics & informatics
• /
• 제24권1_2호
• /
• pp.95-104
• /
• 2007

We study stationary subdivision schemes based on radial basis function interpolation. Each scheme has a tension parameter, say ${\lambda}$, which actually belongs to the radial basis function. In particular, adapted subdivision rules on bounded intervals are developed.

• 전기학회논문지
• /
• 제58권6호
• /
• pp.1223-1229
• /
• 2009

The performance of Radial Basis Function Neural Networks depends on setting up the Radial Basis Functions over the input space which are the important design procedure of Radial Basis Function Neural Networks. The existing method to initialize the location of the radial basis functions over the input space is to use the conditional fuzzy C-means clustering. However, the researchers which are interested in the conditional fuzzy C-means clustering cannot get as good modeling performance as they expect because the conditional fuzzy C-means clustering cannot project the information which is extracted over the output space into the input space. To compensate the above mentioned drawback of the conditional fuzzy C-means clustering, we apply a fuzzy K-nearest neighbors approach to project the auxiliary information defined over the output space into the input space without lose of the information.

• Journal of applied mathematics & informatics
• /
• 제23권1_2호
• /
• pp.435-443
• /
• 2007

An important approach towards solving the scattered data problem is by using radial basis functions. However, for a large class of smooth basis functions such as Gaussians, the existing theories guarantee the interpolant to approximate well only for a very small class of very smooth approximate which is the so-called 'native' space. The approximands f need to be extremely smooth. Hence, the purpose of this paper is to study approximation by a scattered shifts of a radial basis functions. We provide error estimates on larger spaces, especially on the homogeneous Sobolev spaces.

• Journal of applied mathematics & informatics
• /
• 제27권5_6호
• /
• pp.1087-1095
• /
• 2009

In this paper, we study approximation method from scattered data to the derivatives of a function f by a radial basis function $\phi$. For a given function f, we define a nearly interpolating function and discuss its accuracy. In particular, we are interested in using smooth functions $\phi$ which are (conditionally) positive definite. We estimate accuracy of approximation for the Sobolev space while the classical radial basis function interpolation applies to the so-called native space. We observe that our approximant provides spectral convergence order, as the density of the given data is getting smaller.

• Interaction and multiscale mechanics
• /
• 제2권4호
• /
• pp.333-352
• /
• 2009

We introduce a radial basis collocation method to solve axially moving beam problems which involve $2^{nd}$ order differentiation in time and $4^{th}$ order differentiation in space. The discrete equation is constructed based on the strong form of the governing equation. The employment of multiquadrics radial basis function allows approximation of higher order derivatives in the strong form. Unlike the other approximation functions used in the meshfree methods, such as the moving least-squares approximation, $4^{th}$ order derivative of multiquadrics radial basis function is straightforward. We also show that the standard weighted boundary collocation approach for imposition of boundary conditions in static problems yields significant errors in the transient problems. This inaccuracy in dynamic problems can be corrected by a statically condensed semi-discrete equation resulting from an exact imposition of boundary conditions. The effectiveness of this approach is examined in the numerical examples.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2000년도 추계학술대회 학술발표 논문집
• /
• pp.459-462
• /
• 2000

In this paper, we propose the initial optimized structure of the Radial Basis Function Network which is more simple in the part of the structure and converges more faster than Neural Network with the analysis method using Time-Frequency Localization. When we construct the hidden node with the Radial Basis Function whose localization is similar with an approximation target function in the plane of the Time and Frequency, we make a good decision of the initial structure having an ability of approximation.

• 전기학회논문지
• /
• 제61권1호
• /
• pp.135-142
• /
• 2012

In this paper, we proposed a new architecture called radial basis function-based polynomial neural networks classifier that consists of heterogeneous neural networks such as radial basis function neural networks and polynomial neural networks. The underlying architecture of the proposed model equals to polynomial neural networks(PNNs) while polynomial neurons in PNNs are composed of Fuzzy-c means-based radial basis function neural networks(FCM-based RBFNNs) instead of the conventional polynomial function. We consider PNNs to find the optimal local models and use RBFNNs to cover the high dimensionality problems. Also, in the hidden layer of RBFNNs, FCM algorithm is used to produce some clusters based on the similarity of given dataset. The proposed model depends on some parameters such as the number of input variables in PNNs, the number of clusters and fuzzification coefficient in FCM and polynomial type in RBFNNs. A multiobjective particle swarm optimization using crowding distance (MoPSO-CD) is exploited in order to carry out both structural and parametric optimization of the proposed networks. MoPSO is introduced for not only the performance of model but also complexity and interpretability. The usefulness of the proposed model as a classifier is evaluated with the aid of some benchmark datasets such as iris and liver.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 하계학술대회 논문집 G
• /
• pp.2448-2450
• /
• 1998

For the exact classification of the arm motion this paper proposes EMG pattern recognition method with neural network. For this autoregressive coefficient, linear cepstrum coefficient, and adaptive cepstrum coefficient are selected for the feature parameter of EMG signal, and they are extracted from time series EMG signal. For the function recognition of the feature parameter a radial basis function network, a field of neural network is designed. For the improvement of recognition rate, a number of radial basis function network are combined in parallel, comparing with a backpropagation neural network an existing method.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2006년도 추계학술대회 학술발표 논문집 제16권 제2호
• /
• 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의 성능을 향상시킬 수 있다. 본 논문에서는 제안한 알고리즘의 타당성을 보이기 위하여 여러 데이터 집합에 대한 분류 결과를 보인다.