• Proceedings of the KIEE Conference
• /
• 2003.07d
• /
• pp.2519-2521
• /
• 2003

In this paper, we propose Self-Organizing Fuzzy Polynomial Neural Networks(SOFPNN) architecture for optimal model identification and discuss a comprehensive design methodology supporting its development. It is shown that this network exhibits a dynamic structure as the number of its layers as well as the number of nodes in each layer of the SOFPNN are not predetermined (as this is the case in a popular topology of a multilayer perceptron). As the form of the conclusion part of the rules, especially the regression polynomial uses several types of high-order polynomials such as linear, quadratic, and modified quadratic. As the premise part of the rules, both triangular and Gaussian-like membership function are studied and the number of the premise input variables used in the rules depends on that of the inputs of its node in each layer. We introduce two kinds of SOFPNN architectures, that is, the basic and modified one with both the generic and the advanced type. The superiority and effectiveness of the proposed SOFPNN architecture is demonstrated through nonlinear function numerical example.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.3
• /
• pp.466-472
• /
• 2008

The paper concerns Fuzzy C-Means clustering based fuzzy neural networks (FCM-FNN) and the optimization of the network is carried out by means of hierarchal fair competition-based parallel genetic algorithm (HFCPGA). FCM-FNN is the extended architecture of Radial Basis Function Neural Network (RBFNN). FCM algorithm is used to determine centers and widths of RBFs. In the proposed network, the membership functions of the premise part of fuzzy rules do not assume any explicit functional forms such as Gaussian, ellipsoidal, triangular, etc., so its resulting fitness values directly rely on the computation of the relevant distance between data points by means of FCM. Also, as the consequent part of fuzzy rules extracted by the FCM-FNN model, the order of four types of polynomials can be considered such as constant, linear, quadratic and modified quadratic. Since the performance of FCM-FNN is affected by some parameters of FCM-FNN such as a specific subset of input variables, fuzzification coefficient of FCM, the number of rules and the order of polynomials of consequent part of fuzzy rule, we need the structural as well as parametric optimization of the network. In this study, the HFCPGA which is a kind of multipopulation-based parallel genetic algorithms(PGA) is exploited to carry out the structural optimization of FCM-FNN. Moreover the HFCPGA is taken into consideration to avoid a premature convergence related to the optimization problems. The proposed model is demonstrated with the use of two representative numerical examples.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.11
• /
• pp.5164-5171
• /
• 2011

In fuzzy modeling for nonlinear process, typically using the given data, the fuzzy rules are formed by the input variables and the space division by selecting the input variable and dividing the input space for each input variables. The premise part of the fuzzy rule is identified by selection of the input variables, the number of space division and membership functions and the consequent part of the fuzzy rule is identified by polynomial functions in the form of simplified and linear inference. In general, formation of fuzzy rules for nonlinear processes using the given data have the problem that the number of fuzzy rules exponentially increases. To solve this problem complex nonlinear process can be modeled by separately forming the fuzzy rules by means of fuzzy division of each input space. Therefore, this paper utilizes individual input space to generate fuzzy rules. The premise parameters of the fuzzy rules are identified by Min-Max method using the minimum and maximum values of input data set and membership functions are used as a series of triangular, gaussian-like, trapezoid-type membership functions. And lastly, using the data which is widely used in nonlinear process we evaluate the performance and the system characteristics.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.1 no.3
• /
• pp.69-76
• /
• 2008

This paper concerns Fuzzy Radial Basis Function Neural Network (FRBFNN) and automatic rule generation of extraction of the FRBFNN by means of mountain clustering. In the proposed network, the membership functions of the premise part of fuzzy rules do not assume any explicit functional forms such as Gaussian, ellipsoidal, triangular, etc., so its resulting fitness values (degree of membership) directly rely on the computation of the relevant distance between data points. Also, we consider high-order polynomial as the consequent part of fuzzy rules which represent input-output characteristic of sup-space. The number of clusters and the centers of clusters are automatically generated by using mountain clustering method based on the density of data. The centers of cluster which are obtained by using mountain clustering are used to determine a degree of membership and weighted least square estimator (WLSE) is adopted to estimate the coefficients of the consequent polynomial of fuzzy rules. The effectiveness of the proposed model have been investigated and analyzed in detail for the representative nonlinear function.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.1
• /
• pp.177-185
• /
• 2009

Cluster analysis or clustering is a kind of unsupervised learning method in which a set of data points is divided into a given number of homogeneous groups. Fuzzy clustering method, one of the most popular clustering method, allows a point to belong to all the clusters with different degrees, so produces more intuitive and natural clusters than hard clustering method does. Even more some of fuzzy clustering variants have noise-immunity. In this paper, we improved the Possibilistic Fuzzy C-Means (PFCM), which generates a membership matrix as well as a typicality matrix, using Gath-Geva (GG) method. The proposed method has a focus on the boundaries of clusters, which is different from most of the other methods having a focus on the centers of clusters. The generated membership values are suitable for the classification-type applications. As the typicality values generated from the algorithm have a similar distribution with the values of density function of Gaussian distribution, it is useful for Gaussian-type density estimation. Even more GG method can handle the clusters having different numbers of data points, which the other well-known method by Gustafson and Kessel can not. All of these points are obvious in the experimental results.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.12 no.1
• /
• pp.1-5
• /
• 2012

Data reduction has been used widely in data mining for convenient analysis. Principal component analysis (PCA) and factor analysis (FA) methods are popular techniques. The PCA and FA reduce the number of variables to avoid the curse of dimensionality. The curse of dimensionality is to increase the computing time exponentially in proportion to the number of variables. So, many methods have been published for dimension reduction. Also, data augmentation is another approach to analyze data efficiently. Support vector machine (SVM) algorithm is a representative technique for dimension augmentation. The SVM maps original data to a feature space with high dimension to get the optimal decision plane. Both data reduction and augmentation have been used to solve diverse problems in data analysis. In this paper, we compare the strengths and weaknesses of dimension reduction and augmentation for classification and propose a classification method using data reduction for classification. We will carry out experiments for comparative studies to verify the performance of this research.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2000.04b
• /
• pp.365-370
• /
• 2000

A sliding mode fuzzy control (SMFC) algorithm is applied to design a controller for a benchmark problem on a wind- excited building. The structure is a 76-story concrete office tower with a height of 306 meters, hence the wind resistance characteristics are very important for the serviceability as well as the safety. A control system with an active tuned mass damper is assumed to be installed on the top floor. Since the structural acceleration is measured only at ,limited number of locations without measurement of the wind force, the structure of the conventional continuous sliding mode control may have the feed-back loop only. So, an adaptive least mean squares (LMS) filter is employed in the SMFC algorithm to generate a fictitious feed-forward loop. The adaptive LMS filter is designed based on the information of the stochastic characteristics of the wind velocity along the structure. A numerical study is carried out. and the performance of the present SMFC with the ,adaptive LMS filter is investigated in comparison with those of' other control, of algorithms such as linear quadratic Gaussian control, frequency domain optimal control, quadratic stability control, continuous sliding mode control, and H/sub ∞///sub μ/, control, which were reported by other researchers. The effectiveness of the adaptive LMS filter is also examined. The results indicate that the present algorithm is very efficient .

• Journal of Korea Multimedia Society
• /
• v.4 no.4
• /
• pp.333-338
• /
• 2001

In this paper, fuzzy-ARTMAP equalizer is developed mainly for overcoming the obstacles, such as complexity and long training, in implementing the previously developed neural-basis equalizers. The proposed fuzzy-ARTMAP equalizer is fast and easy to train and includes capabilities not found in other neural network approaches a small number of parameters, no requirements for the choice of initial weights, no risk of getting trapped in local minima, and capability of adding new data without retraining previously trained data. In simulation studies, binary signals were generated at random from linear channel with Gaussian noise. The performance of the proposed equalizer is compared with other neural net basis equalizers, such as MLP and RBF equalizers. The fuzzy ARTMAP equalizer combines relatively simple structure and fast processing speed; it gives accurate results for nonlinear problems that cannot be solved with a linear equalizer.

• International Journal of Computer Science & Network Security
• /
• v.22 no.10
• /
• pp.171-176
• /
• 2022

A dramatic rise in the number of people dying from heart disease has prompted efforts to find a way to identify it sooner using efficient approaches. A variety of variables contribute to the condition and even hereditary factors. The current estimate approaches use an automated diagnostic system that fails to attain a high level of accuracy because it includes irrelevant dataset information. This paper presents an effective neural network with convolutional layers for classifying clinical data that is highly class-imbalanced. Traditional approaches rely on massive amounts of data rather than precise predictions. Data must be picked carefully in order to achieve an earlier prediction process. It's a setback for analysis if the data obtained is just partially complete. However, feature extraction is a major challenge in classification and prediction since increased data increases the training time of traditional machine learning classifiers. The work integrates the CNN-MDRP classifier (convolutional neural network (CNN)-based efficient multimodal disease risk prediction with TANFIS (tuned adaptive neuro-fuzzy inference system) for earlier accurate prediction. Perform data cleaning by transforming partial data to informative data from the dataset in this project. The recommended TANFIS tuning parameters are then improved using a Laplace Gaussian mutation-based grasshopper and moth flame optimization approach (LGM²G). The proposed approach yields a prediction accuracy of 98.40 percent when compared to current algorithms.

• The KIPS Transactions:PartA
• /
• v.13A no.5 s.102
• /
• pp.465-472
• /
• 2006

Recently, many suggestions have been made in image segmentation methods for extracting human organs or disease affected area from huge amounts of medical image datasets. However, images from some areas, such as brain, which have multiple structures with ambiruous structural borders, have limitations in their structural segmentation. To address this problem, clustering technique which classifies voxels into finite number of clusters is often employed. This, however, has its drawback, the influence from noise, which is caused from voxel by voxel operations. Therefore, applying image enhancing method to minimize the influence from noise and to make clearer image borders would allow more robust structural segmentation. This research proposes an efficient structural segmentation method by filtering based clustering to extract detail structures such as white matter, gray matter and cerebrospinal fluid from brain MR. First, coherence enhancing diffusion filtering is adopted to make clearer borders between structures and to reduce the noises in them. To the enhanced images from this process, fuzzy c-means clustering method was applied, conducting structural segmentation by assigning corresponding cluster index to the structure containing each voxel. The suggested structural segmentation method, in comparison with existing ones with clustering using Gaussian or general anisotropic diffusion filtering, showed enhanced accuracy which was determined by how much it agreed with the manual segmentation results. Moreover, by suggesting fine segmentation method on the border area with reproducible results and minimized manual task, it provides efficient diagnostic support for morphological abnormalities in brain.