• Title/Summary/Keyword: Hard Scatter Partition

Search Result 3, Processing Time 0.019 seconds

Nonlinear Process Modeling Using Hard Partition-based Inference System (Hard 분산 분할 기반 추론 시스템을 이용한 비선형 공정 모델링)

  • Park, Keon-Jun;Kim, Yong-Kab
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.7 no.4
    • /
    • pp.151-158
    • /
    • 2014
  • In this paper, we introduce an inference system using hard scatter partition method and model the nonlinear process. To do this, we use the hard scatter partition method that partition the input space in the scatter form with the value of the membership degree of 0 or 1. The proposed method is implemented by C-Means clustering algorithm. and is used for the initial center values by means of binary split. by applying the LBG algorithm to compensate for shortcomings in the sensitive initial center value. Hard-scatter-partitioned input space forms the rules in the rule-based system modeling. The premise parameters of the rules are determined by membership matrix by means of C-Means 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. The data widely used in nonlinear process is used to model the nonlinear process and evaluate the characteristics of nonlinear process.

Design of Hard Partition-based Non-Fuzzy Neural Networks

  • Park, Keon-Jun;Kwon, Jae-Hyun;Kim, Yong-Kab
    • International journal of advanced smart convergence
    • /
    • v.1 no.2
    • /
    • pp.30-33
    • /
    • 2012
  • This paper propose a new design of fuzzy neural networks based on hard partition to generate the rules of the networks. For this we use hard c-means (HCM) clustering algorithm. The premise part of the rules of the proposed networks is realized with the aid of the hard partition of input space generated by HCM clustering algorithm. The consequence part of the rule is represented by polynomial functions. And the coefficients of the polynomial functions are learned by BP algorithm. The number of the hard partition of input space equals the number of clusters and the individual partitioned spaces indicate the rules of the networks. Due to these characteristics, we may alleviate the problem of the curse of dimensionality. The proposed networks are evaluated with the use of numerical experimentation.

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.