• International journal of advanced smart convergence
• /
• v.2 no.1
• /
• pp.12-17
• /
• 2013

This paper introduces the fuzzy scatter partition-based fuzzy inference system to construct the model for nonlinear process to analyze nonlinear characteristics. The fuzzy rules of fuzzy inference systems are generated by partitioning the input space in the scatter form using Fuzzy C-Means (FCM) clustering algorithm. The premise parameters of the rules are determined by membership matrix by means of FCM clustering algorithm. The consequence part of the rules is represented in the form of polynomial functions and the parameters of the consequence part are estimated by least square errors. The proposed model is evaluated with the performance using the data widely used in nonlinear process. Finally, this paper shows that the proposed model has the good result for high-dimension nonlinear process.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.4
• /
• pp.355-359
• /
• 2014

In this paper, we proposed the new fuzzy pattern classifier which combines several fuzzy models with simple consequent parts hierarchically. The basic component of the proposed fuzzy pattern classifier with hierarchical structure is a fuzzy model with simple consequent part so that the complexity of the proposed fuzzy pattern classifier is not high. In order to analyze and divide the input space, we use Fuzzy C-Means clustering algorithm. In addition, we exploit Conditional Fuzzy C-Means clustering algorithm to analyze the sub space which is divided by Fuzzy C-Means clustering algorithm. At each clustered region, we apply a fuzzy model with simple consequent part and build the fuzzy pattern classifier with hierarchical structure. Because of the hierarchical structure of the proposed pattern classifier, the data distribution of the input space can be analyzed in the macroscopic point of view and the microscopic point of view. Finally, in order to evaluate the classification ability of the proposed pattern classifier, the machine learning data sets are used.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.05a
• /
• pp.16-19
• /
• 2001

This paper presents a type-2 fuzzy C-means (FCM) algorithm that is an extension of the conventional fuzzy C-means algorithm. In our proposed method, the membership values for each pattern are extended as type-2 fuzzy memberships by assigning membership grades to the type-1 memberships. In doing so, cluster centers that are estimated by type-2 memberships may converge to a more desirable location than cluster centers obtained by a type-1 FCM method in the presence of noise.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.5 no.3
• /
• pp.253-258
• /
• 2005

In this study, we introduce a new category of fuzzy inference systems based on information granulation to carry out the model identification of complex and nonlinear systems. Informal speaking, information granules are viewed as linked collections of objects (data, in particular) drawn together by the criteria of proximity, similarity, or functionality. To identify the structure of fuzzy rules we use genetic algorithms (GAs). Granulation of information with the aid of Hard C-Means (HCM) clustering algorithm help determine the initial parameters of fuzzy model such as the initial apexes of the membership functions and the initial values of polynomial functions being used in the premise and consequence part of the fuzzy rules. And the initial parameters are tuned effectively with the aid of the genetic algorithms and the least square method (LSM). The proposed model is contrasted with the performance of the conventional fuzzy models in the literature.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.1
• /
• pp.43-50
• /
• 2010

Fuzzy c-means (FCM) and possibilistic c-means (PCM) are the two most well-known clustering algorithms in fuzzy clustering area, and have been applied in many applications in their original or modified forms. However, FCM's noise sensitivity problem and PCM's overlapping cluster problem are also well known. Recently there have been several attempts to combine both of them to mitigate the problems and possibilistic fuzzy c-means (PFCM) showed promising results. In this paper, we proposed a modified PFCM using regularization to reduce noise sensitivity in PFCM further. Regularization is a well-known technique to make a solution space smooth and an algorithm noise insensitive. The proposed algorithm, PFCM with regularization (PFCM-R), can take advantage of regularization and further reduce the effect of noise. Experimental results are given and show that the proposed method is better than the existing methods in noisy conditions.

• Journal of Korea Multimedia Society
• /
• v.7 no.6
• /
• pp.841-850
• /
• 2004

This paper proposes a GA and GDM-based method for removing unnecessary rules and generating relevant rules from the fuzzy rules corresponding to several fuzzy partitions. The aim of proposed method is to find a minimum set of fuzzy rules that can correctly classify all the training patterns. When the fine fuzzy partition is used with conventional methods, the number of fuzzy rules has been enormous and the performance of fuzzy inference system became low. This paper presents the application of GA as a means of finding optimal solutions over fuzzy partitions. In each rule, the antecedent part is made up the membership functions of a fuzzy set, and the consequent part is made up of a real number. The membership functions and the number of fuzzy inference rules are tuned by means of the GA, while the real numbers in the consequent parts of the rules are tuned by means of the gradient descent method. It is shown that the proposed method has improved than the performance of conventional method in formulating and solving a combinatorial optimization problem that has two objectives: to maximize the number of correctly classified patterns and to minimize the number of fuzzy rules.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.139-142
• /
• 1998

Missing values in data for fuzzy c-menas clustering is discussed. Two basic methods of fuzzy c-means, i.e., the standard fuzzy c-means and the entropy method are considered and three options of handling missing values are proposed, among which one is to define a new distance between data with missing values, second is to alter a weight in the new distance, and the third is to fill the missing values by an appropriate numbers. Experimental Results are shown.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.4
• /
• pp.11-18
• /
• 2010

Fuzzy c-means (FCM) is a simple but efficient clustering algorithm using the concept of a fuzzy set that has been proved to be useful in many areas. There are, however, several well known problems with FCM, such as sensitivity to initialization, sensitivity to outliers, and limitation to convex clusters. In this paper, global fuzzy c-means (G-FCM) and kernel fuzzy c-means (K-FCM) are combined to form a non-linear variant of G-FCM, called kernel global fuzzy c-means (KG-FCM). G-FCM is a variant of FCM that uses an incremental seed selection method and is effective in alleviating sensitivity to initialization. There are several approaches to reduce the influence of noise and accommodate non-convex clusters, and K-FCM is one of them. K-FCM is used in this paper because it can easily be extended with different kernels. By combining G-FCM and K-FCM, KG-FCM can resolve the shortcomings mentioned above. The usefulness of the proposed method is demonstrated by experiments using artificial and real world data sets.

• Journal of Electrical Engineering and Technology
• /
• v.3 no.1
• /
• pp.101-107
• /
• 2008

We introduce an optimization of fuzzy set-fuzzy systems based on IG (Information Granules). The proposed fuzzy model implements system structure and parameter identification by means of IG and GAs. The concept of information granulation was coped with to enhance the abilities of structural optimization of the fuzzy model. Granulation of information realized with C-Means clustering helps determine the initial parameters of the fuzzy model such as the initial apexes of the membership functions in the premise part and the initial values of polynomial functions in the consequence part of the fuzzy rules. The initial parameters are adjusted effectively with the help of the GAs and the standard least square method. To optimally identify the structure and the parameters of the fuzzy model we exploit GAs with successive tuning method to simultaneously search the structure and the parameters within one individual. We also consider the variant generation-based evolution to adjust the rate of identification of the structure and the parameters in successive tuning method. The proposed model is evaluated with the performance of the conventional fuzzy model.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1244-1248
• /
• 2005

In this paper, we propose fuzzy c-means (FCM) to solve recognition errors in invariant range image, multi-pose face recognition. Scale, center and pose error problems were solved using geometric transformation. Range image face data was digitized into range image data by using the laser range finder that does not depend on the ambient light source. Then, the digitized range image face data is used as a model to generate multi-pose data. Each pose data size was reduced by linear reduction into the database. The reduced range image face data was transformed to the gradient face model for facial feature image extraction and also for matching using the fuzzy membership adjusted by fuzzy c-means. The proposed method was tested using facial range images from 40 people with normal facial expressions. The output of the detection and recognition system has to be accurate to about 93 percent. Simultaneously, the system must be robust enough to overcome typical image-acquisition problems such as noise, vertical rotated face and range resolution.