• Title/Summary/Keyword: fuzzy clustering

Search Result 733, Processing Time 0.03 seconds

Information Granulation-based Fuzzy Inference Systems by Means of Genetic Optimization and Polynomial Fuzzy Inference Method

  • Park Keon-Jun;Lee Young-Il;Oh Sung-Kwun
    • 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.

Temperature Control by On-line CFCM-based Adaptive Neuro-Fuzzy System (온 라인 CFCM 기반 적응 뉴로-퍼지 시스템에 의한 온도제어)

  • 윤기후;곽근창
    • Journal of the Institute of Electronics Engineers of Korea TE
    • /
    • v.39 no.4
    • /
    • pp.414-422
    • /
    • 2002
  • In this paper, we propose a new method of adaptive neuro-fuzzy control using CFCM(Conditional Fuzzy c-means) clustering and fuzzy equalization method to deal with adaptive control problem. First, in the off-line design, CFCM clustering performs structure identification of adaptive neuro-fuzzy control with the homogeneous properties of the given input and output data. The parameter identification are established by hybrid learning using back-propagation algorithm and RLSE(Recursive Least Square Estimate). In the on-line design, the premise and consequent parameters are tuned to RLSE with forgetting factor due to a characteristic of time variant. Finally, we applied the proposed method to the water temperature control system and obtained better results than previous works such as fuzzy control.

Fuzzy Rules Generation and Inference System of Scatter Partition Method (분산 분할 방식의 퍼지 규칙 생성 및 추론 시스템)

  • Park, Keon-jun;Jang, Tae-Su;Kim, Sung-Hun;Kim, Yong-kab
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.10a
    • /
    • pp.35-36
    • /
    • 2012
  • The generation of fuzzy rules is inevitable in order to construct fuzzy modeling and in general, has the problem that the number of rules increases exponentially with increasing dimension. To solve this problem, we introduce the system that generate the fuzzy rules and make a inference based on FCM clustering algorithm that partition the input space in the scatter form. The parameters in the premise part of the fuzzy rules is determined as membership matrix by the FCM clustering algorithm and the consequence part of the fuzzy rules is are expressed as a polynomial function. Proposed model evaluated using the numerical data.

  • PDF

A T-S Fuzzy Identification of Interior Permanent Magnet Synchronous (매입형 영구자석 동기전동기의 T-S 퍼지 모델링)

  • Wang, Fa-Guang;Kim, Min-Chan;Kim, Hyun-Woo;Park, Seung-Kyu;Yoon, Tae-Sung;Kwak, Gun-Pyoung
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.28 no.4
    • /
    • pp.391-397
    • /
    • 2011
  • Control of interior permanent magnet (IPMSM) is difficult because its nonlinearity and parameter uncertainty. In this paper, a fuzzy c-regression models clustering algorithm which is based on T-S fuzzy is used to model IPMSM with a series linear model and weight them by memberships. Lagrangian of constrained function is built for calculating clustering centers where training output data are considered. Based on these clustering centers, least square method is applied for T-S fuzzy linear model parameters. As a result, IPMSM can be modeled as T-S fuzzy model for T-S fuzzy control of them.

Support Vector Machine based Cluster Merging (Support Vector Machines 기반의 클러스터 결합 기법)

  • Choi, Byung-In;Rhee, Frank Chung-Hoon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.14 no.3
    • /
    • pp.369-374
    • /
    • 2004
  • A cluster merging algorithm that merges convex clusters resulted by the Fuzzy Convex Clustering(FCC) method into non-convex clusters was proposed. This was achieved by proposing a fast and reliable distance measure between two convex clusters using Support Vector Machines(SVM) to improve accuracy and speed over other existing conventional methods. In doing so, it was possible to reduce cluster number without losing its representation of the data. In this paper, results for several data sets are given to show the validity of our distance measure and algorithm.

Color image segmentation using the possibilistic C-mean clustering and region growing (Possibilistic C-mean 클러스터링과 영역 확장을 이용한 칼라 영상 분할)

  • 엄경배;이준환
    • 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.

  • PDF

Nonlinear Inference Using Fuzzy Cluster (퍼지 클러스터를 이용한 비선형 추론)

  • Park, Keon-Jung;Lee, Dong-Yoon
    • Journal of Digital Convergence
    • /
    • v.14 no.1
    • /
    • pp.203-209
    • /
    • 2016
  • In this paper, we introduce a fuzzy inference systems for nonlinear inference using fuzzy cluster. Typically, the generation of fuzzy rules for nonlinear inference causes the problem that the number of fuzzy rules increases exponentially if the input vectors increase. To handle this problem, the fuzzy rules of fuzzy model are designed by dividing the input vector space in the scatter form using fuzzy clustering algorithm which expresses fuzzy cluster. From this method, complex nonlinear process can be modeled. The premise part of the fuzzy rules is determined by means of FCM clustering algorithm with fuzzy clusters. The consequence part of the fuzzy rules have four kinds of polynomial functions and the coefficient parameters of each rule are estimated by using the standard least-squares method. And we use the data widely used in nonlinear process for the performance and the nonlinear characteristics of the nonlinear process. Experimental results show that the non-linear inference is possible.

The Design of Granular-based Radial Basis Function Neural Network by Context-based Clustering (Context-based 클러스터링에 의한 Granular-based RBF NN의 설계)

  • Park, Ho-Sung;Oh, Sung-Kwun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.6
    • /
    • pp.1230-1237
    • /
    • 2009
  • In this paper, we develop a design methodology of Granular-based Radial Basis Function Neural Networks(GRBFNN) by context-based clustering. In contrast with the plethora of existing approaches, here we promote a development strategy in which a topology of the network is predominantly based upon a collection of information granules formed on a basis of available experimental data. The output space is granulated making use of the K-Means clustering while the input space is clustered with the aid of a so-called context-based fuzzy clustering. The number of information granules produced for each context is adjusted so that we satisfy a certain reconstructability criterion that helps us minimize an error between the original data and the ones resulting from their reconstruction involving prototypes of the clusters and the corresponding membership values. In contrast to "standard" Radial Basis Function neural networks, the output neuron of the network exhibits a certain functional nature as its connections are realized as local linear whose location is determined by the values of the context and the prototypes in the input space. The other parameters of these local functions are subject to further parametric optimization. Numeric examples involve some low dimensional synthetic data and selected data coming from the Machine Learning repository.

Colorectal Cancer Staging Using Three Clustering Methods Based on Preoperative Clinical Findings

  • Pourahmad, Saeedeh;Pourhashemi, Soudabeh;Mohammadianpanah, Mohammad
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.17 no.2
    • /
    • pp.823-827
    • /
    • 2016
  • Determination of the colorectal cancer stage is possible only after surgery based on pathology results. However, sometimes this may prove impossible. The aim of the present study was to determine colorectal cancer stage using three clustering methods based on preoperative clinical findings. All patients referred to the Colorectal Research Center of Shiraz University of Medical Sciences for colorectal cancer surgery during 2006 to 2014 were enrolled in the study. Accordingly, 117 cases participated. Three clustering algorithms were utilized including k-means, hierarchical and fuzzy c-means clustering methods. External validity measures such as sensitivity, specificity and accuracy were used for evaluation of the methods. The results revealed maximum accuracy and sensitivity values for the hierarchical and a maximum specificity value for the fuzzy c-means clustering methods. Furthermore, according to the internal validity measures for the present data set, the optimal number of clusters was two (silhouette coefficient) and the fuzzy c-means algorithm was more appropriate than the k-means clustering approach by increasing the number of clusters.

Multi-FNN Identification Based on HCM Clustering and Evolutionary Fuzzy Granulation

  • Park, Ho-Sung;Oh, Sung-Kwun
    • International Journal of Control, Automation, and Systems
    • /
    • v.1 no.2
    • /
    • pp.194-202
    • /
    • 2003
  • In this paper, we introduce a category of Multi-FNN (Fuzzy-Neural Networks) models, analyze the underlying architectures and propose a comprehensive identification framework. The proposed Multi-FNNs dwell on a concept of fuzzy rule-based FNNs based on HCM clustering and evolutionary fuzzy granulation, and exploit linear inference being treated as a generic inference mechanism. By this nature, this FNN model is geared toward capturing relationships between information granules known as fuzzy sets. The form of the information granules themselves (in particular their distribution and a type of membership function) becomes an important design feature of the FNN model contributing to its structural as well as parametric optimization. The identification environment uses clustering techniques (Hard C - Means, HCM) and exploits genetic optimization as a vehicle of global optimization. The global optimization is augmented by more refined gradient-based learning mechanisms such as standard back-propagation. The HCM algorithm, whose role is to carry out preprocessing of the process data for system modeling, is utilized to determine the structure of Multi-FNNs. The detailed parameters of the Multi-FNN (such as apexes of membership functions, learning rates and momentum coefficients) are adjusted using genetic algorithms. An aggregate performance index with a weighting factor is proposed in order to achieve a sound balance between approximation and generalization (predictive) abilities of the model. To evaluate the performance of the proposed model, two numeric data sets are experimented with. One is the numerical data coming from a description of a certain nonlinear function and the other is NOx emission process data from a gas turbine power plant.