• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.12a
• /
• pp.233-236
• /
• 2001

In this paper, we propose a TSK-type fuzzy classifier using PCA(Principal Component Analysis), FCM(Fuzzy C-Means) clustering and hybrid GA(genetic algorithm). First, input data is transformed to reduce correlation among the data components by PCA. FCM clustering is applied to obtain a initial TSK-type fuzzy classifier. Parameter identification is performed by AGA(Adaptive Genetic Algorithm) and RLSE(Recursive Least Square Estimate). we applied the proposed method to Iris data classification problems and obtained a better performance than previous works.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.8
• /
• pp.1659-1664
• /
• 2011

Fuzzy C-Means (FCM) is one of the most widely used clustering algorithms and has been used in many applications successfully. However, FCM has some shortcomings and initial prototype selection is one of them. As FCM is only guaranteed to converge on a local optimum, different initial prototype results in different clustering. Therefore, much care should be given to the selection of initial prototype. In this paper, a new initialization method for FCM using kernel density estimation (KDE) is proposed to resolve the initialization problem. KDE can be used to estimate non-parametric data distribution and is useful in estimating local density. After KDE, in the proposed method, one initial point is placed at the most dense region and the density of that region is reduced. By iterating the process, initial prototype can be obtained. The initial prototype such obtained showed better result than the randomly selected one commonly used in FCM, which was demonstrated by experimental results.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.3
• /
• pp.97-107
• /
• 1997

Image segmentation is teh important step in image infromation extraction for computer vison sytems. Fuzzy clustering methods have been used extensively in color image segmentation. Most analytic fuzzy clustering approaches are derived from the fuzzy c-means (FCM) algorithm. The FCM algorithm uses th eprobabilistic constraint that the memberships of a data point across classes sum to 1. However, the memberships resulting from the FCM do not always correspond to the intuitive concept of degree of belongingor compatibility. moreover, the FCM algorithm has considerable trouble above under noisy environments in the feature space. Recently, the possibilistic C-mean (PCM) for solving growing for color image segmentation. In the PCM, the membersip values may be interpreted as degrees of possibility of the data points belonging to the classes. So, the problems in the FCM can be solved by the PCM. The clustering results by just PCM are not smoothly bounded, and they often have holes. So, the region growing was used as a postprocessing. In our experiments, we illustrated that the proposed method is reasonable than the FCM in noisy enviironments.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.5 no.4
• /
• pp.224-231
• /
• 2012

In this paper, we introduce a fuzzy inference systems based on fuzzy c-means clustering algorithm for fuzzy modeling of nonlinear process. Typically, the generation of fuzzy rules for nonlinear processes have the problem that the number of fuzzy rules exponentially increases. To solve this problem, the fuzzy rules of fuzzy model are generated by partitioning the input space in the scatter form using FCM clustering algorithm. The premise parameters of the fuzzy rules are determined by membership matrix by means of FCM clustering algorithm. The consequence part of the rules is expressed in the form of polynomial functions and the coefficient parameters of each rule are determined by the standard least-squares method. And lastly, we evaluate the performance and the nonlinear characteristics using the data widely used in nonlinear process.

• 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 the Korean Institute of Intelligent Systems
• /
• v.18 no.3
• /
• pp.354-359
• /
• 2008

Clustering is a method to classify the given data set with same property into several classes. To cluster data, many methods such as K-Means, Fuzzy C-Means(FCM), Mountain Method(MM), and etc, have been proposed and used. But the clustering results of conventional methods are sensitively influenced by initial values given for clustering in each method. Especially, FCM is very sensitive to noisy data, and cluster center distortion phenomenon is occurred because the method dose clustering through minimization of within-clusters variance. In this paper, we propose a clustering method which reduces cluster center distortion through merging the nearest data based on the data weight, and not being influenced by initial values. We show the effectiveness of the proposed through experimental results applied it to various types of data sets, and comparison of cluster centers with those of FCM.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.5
• /
• pp.967-973
• /
• 2017

Clustering is one of the most well-known unsupervised learning methods that clusters data into homogeneous groups. Clustering has been used in various applications and FCM is one of the representative methods. In Fuzzy C-Means(FCM), however, cluster centers tend leaning to high density areas because the Euclidean distance measure forces high density clusters to make more contribution to clustering result. Previously proposed was density-independent clustering method, where cluster centers were made not to be close each other and relived the center deviation problem. Density-independent clustering method has a limitation that it is difficult to specify the position of the cluster centers. In this paper, an enhanced density-independent clustering method with an additional term that makes cluster centers to be placed around dense region is proposed. The proposed method converges more to real centers compared to FCM and density-independent clustering, which can be verified with experimental results.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.6
• /
• pp.491-499
• /
• 2001

In this paper, the scheme of an efficient fuzzy rule generation and fuzzy system construction using GA(genetic algorithm) and FCM(fuzzy c-means) clustering algorithm is proposed for TSK(Takagi-Sugeno-Kang) type fuzzy system. In the structure identification, input data is transformed by PCA(Principal Component Analysis) to reduce the correlation among input data components. And then, a set fuzzy rules are generated for a given criterion by FCM clustering algorithm . In the parameter identification premise parameters are optimally searched by GA. On the other hand, the consequent parameters are estimated by RLSE(Recursive Least Square Estimate) to reduce the search space. From this one can systematically obtain the valid number of fuzzy rules which shows satisfying performance for the given problem. Finally, we applied the proposed method to the Box-Jenkins data and rice taste data modeling problems and obtained a better performance than previous works.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.11
• /
• pp.2102-2107
• /
• 2008

This paper demonstrates a enhanced FCM to identify the causes of ground faults in power distribution systems. The discrimination scheme which can automatically recognize the fault causes is proposed using Fuzzy RBF networks. By using the actual fault data, it is shown that the proposed method provides satisfactory results for identifying the fault causes.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.4 s.310
• /
• pp.1-8
• /
• 2006

This paper proposes an improved FCM(Fuzzy C-means) algorithm using intercluster and entropy-based weight in gray image. The fuzzy clustering methods have been extensively used in the image segmentation since it extracts feature information of the region. Most of fuzzy clustering methods have used the FCM algorithm. But, FCM algorithm is still sensitive to noise, as it does not include spatial information. In addition, it can't correctly classify pixels according to the feature-based distributions of clusters. To solve these problems, we applied a weight and intercluster to the traditional FCM algorithm. A weight is obtained from the entropy information based on the cluster's number of neighboring pixels. And a membership for one pixel is given based on the information considering the feature-based intercluster. Experiments has confirmed that the proposed method was more tolerant to noise and superior to existing methods.