• Title/Summary/Keyword: fuzzy K-means clustering method

Search Result 124, Processing Time 0.026 seconds

A Fuzzy Clustering Method based on Genetic Algorithm

  • Jo, Jung-Bok;Do, Kyeong-Hoon;Linhu Zhao;Mitsuo Gen
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.1025-1028
    • /
    • 2000
  • In this paper, we apply to a genetic algorithm for fuzzy clustering. We propose initialization procedure and genetic operators such as selection, crossover and mutation, which are suitable for solving the problems. To illustrate the effectiveness of the proposed algorithm, we solve the manufacturing cell formation problem and present computational comparisons to generalized Fuzzy c-Means algorithm.

  • PDF

Polynomial Fuzzy Radial Basis Function Neural Network Classifiers Realized with the Aid of Boundary Area Decision

  • Roh, Seok-Beom;Oh, Sung-Kwun
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.6
    • /
    • pp.2098-2106
    • /
    • 2014
  • In the area of clustering, there are numerous approaches to construct clusters in the input space. For regression problem, when forming clusters being a part of the overall model, the relationships between the input space and the output space are essential and have to be taken into consideration. Conditional Fuzzy C-Means (c-FCM) clustering offers an opportunity to analyze the structure in the input space with the mechanism of supervision implied by the distribution of data present in the output space. However, like other clustering methods, c-FCM focuses on the distribution of the data. In this paper, we introduce a new method, which by making use of the ambiguity index focuses on the boundaries of the clusters whose determination is essential to the quality of the ensuing classification procedures. The introduced design is illustrated with the aid of numeric examples that provide a detailed insight into the performance of the fuzzy classifiers and quantify several essentials design aspects.

Design and Analysis of TSK Fuzzy Inference System using Clustering Method (클러스터링 방법을 이용한 TSK 퍼지추론 시스템의 설계 및 해석)

  • Oh, Sung-Kwun
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.7 no.3
    • /
    • pp.132-136
    • /
    • 2014
  • We introduce a new architecture of TSK-based fuzzy inference system. The proposed model used fuzzy c-means clustering method(FCM) for efficient disposal of data. The premise part of fuzzy rules don't assume any membership function such as triangular, gaussian, ellipsoidal because we construct the premise part of fuzzy rules using FCM. As a result, we can reduce to architecture of model. In this paper, we are able to use four types of polynomials as consequence part of fuzzy rules such as simplified, linear, quadratic, modified quadratic. Weighed Least Square Estimator are used to estimates the coefficients of polynomial. The proposed model is evaluated with the use of Boston housing data called Machine Learning dataset.

Nonlinear Characteristics of Non-Fuzzy Inference Systems Based on HCM Clustering Algorithm (HCM 클러스터링 알고리즘 기반 비퍼지 추론 시스템의 비선형 특성)

  • Park, Keon-Jun;Lee, Dong-Yoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.13 no.11
    • /
    • pp.5379-5388
    • /
    • 2012
  • In fuzzy modeling for nonlinear process, the fuzzy rules are typically formed by selection of the input variables, the number of space division and membership functions. The Generation of fuzzy rules for nonlinear processes have the problem that the number of fuzzy rules exponentially increases. To solve this problem, complex nonlinear process can be modeled by generating the fuzzy rules by means of fuzzy division of input space. Therefore, in this paper, rules of non-fuzzy inference systems are generated by partitioning the input space in the scatter form using HCM clustering algorithm. The premise parameters of the rules are determined by membership matrix by means of HCM clustering algorithm. The consequence part of the rules is represented in the form of polynomial functions and the consequence parameters of each rule are identified by the standard least-squares method. And lastly, we evaluate the performance and the nonlinear characteristics using the data widely used in nonlinear process. Through this experiment, we showed that high-dimensional nonlinear systems can be modeled by a very small number of rules.

Automatic Generation of the Local Level Knowledge Structure of a Single Document Using Clustering Methods (클러스터링 기법을 이용한 개별문서의 지식구조 자동 생성에 관한 연구)

  • Han, Seung-Hee;Chung, Young-Mee
    • Journal of the Korean Society for information Management
    • /
    • v.21 no.3
    • /
    • pp.251-267
    • /
    • 2004
  • The purpose of this study is to generate the local level knowledge structure of a single document, similar to end-of-the-book indexes and table of contents of printed material through the use of term clustering and cluster representative term selection. Furthermore, it aims to analyze the functionalities of the knowledge structure. and to confirm the applicability of these methods in user-friend1y information services. The results of the term clustering experiment showed that the performance of the Ward's method was superior to that of the fuzzy K -means clustering method. In the cluster representative term selection experiment, using the highest passage frequency term as the representative yielded the best performance. Finally, the result of user task-based functionality tests illustrate that the automatically generated knowledge structure in this study functions similarly to the local level knowledge structure presented In printed material.

HANDLING MISSING VALUES IN FUZZY c-MEANS

  • Miyamoto, Sadaaki;Takata, Osamu;Unayahara, Kazutaka
    • 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.

  • PDF

Optimization of Fuzzy Set-Fuzzy Systems based on IG by Means of GAs with Successive Tuning Method

  • Park, Keon-Jun;Oh, Sung-Kwun;Kim, Hyun-Ki
    • 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.

On-line Identification of fuzzy model using HCM algorithm (HCM을 이용한 퍼지 모델의 On-Line 동정)

  • Park, Ho-Sung;Park, Byoung-Jun;Oh, Sung-Kwun
    • Proceedings of the KIEE Conference
    • /
    • 1999.07g
    • /
    • pp.2929-2931
    • /
    • 1999
  • In this paper, an adaptive fuzzy inference and HCM(Hard C-Means) clustering method are used for on-line fuzzy modeling of nonlinear and complex system. Here HCM clustering method is utilized for determining the initial parameter of membership function of fuzzy premise rules and also avoiding overflow phenomenon during the identification of consequence parameters. To obtain the on-line model structure of fuzzy systems. we use the recursive least square method for the consequent parameter identification. And the proposed on-line identification algorithm is carried out and is evaluated for sewage treatment process system.

  • PDF

Rule-Based Fuzzy-Neural Networks Using the Identification Algorithm of the GA Hybrid Scheme

  • Park, Ho-Sung;Oh, Sung-Kwun
    • International Journal of Control, Automation, and Systems
    • /
    • v.1 no.1
    • /
    • pp.101-110
    • /
    • 2003
  • This paper introduces an identification method for nonlinear models in the form of rule-based Fuzzy-Neural Networks (FNN). In this study, the development of the rule-based fuzzy neural networks focuses on the technologies of Computational Intelligence (CI), namely fuzzy sets, neural networks, and genetic algorithms. The FNN modeling and identification environment realizes parameter identification through synergistic usage of clustering techniques, genetic optimization and a complex search method. We use a HCM (Hard C-Means) clustering algorithm to determine initial apexes of the membership functions of the information granules used in this fuzzy model. The parameters such as apexes of membership functions, learning rates, and momentum coefficients are then adjusted using the identification algorithm of a GA hybrid scheme. The proposed GA hybrid scheme effectively combines the GA with the improved com-plex method to guarantee both global optimization and local convergence. An aggregate objective function (performance index) with a weighting factor is introduced to achieve a sound balance between approximation and generalization of the model. According to the selection and adjustment of the weighting factor of this objective function, we reveal how to design a model having sound approximation and generalization abilities. The proposed model is experimented with using several time series data (gas furnace, sewage treatment process, and NOx emission process data from gas turbine power plants).

Improved FCM Clustering Image Segmentation (개선된 FCM 클러스터링 영상 분할)

  • Lee, Kwang-Kyug
    • Journal of IKEEE
    • /
    • v.24 no.1
    • /
    • pp.127-131
    • /
    • 2020
  • Fuzzy C-Means(FCM) algorithm is frequently used as a representative image segmentation method using clustering. FCM divides the image space into cluster regions with similar pixel values, which requires a lot of segmentation time. In particular, the processing speed problem for analyzing various patterns of the current users of the web is more important. To solve this speed problem, this paper proposes an improved FCM (Improved FCM : IFCM) algorithm for segmenting the image into the Otsu threshold and FCM. In the proposed method, the threshold that maximizes the variance between classes of Otsu is determined, applied to the FCM, and the image is segmented. Experiments show that IFCM improves performance by shortening image segmentation time compared to conventional FCM.