• 제목/요약/키워드: Optimization-Based Clustering

검색결과 178건 처리시간 0.024초

Design of Type-2 FCM-based Fuzzy Inference Systems and Its Optimization (Type-2 FCM 기반 퍼지 추론 시스템의 설계 및 최적화)

  • Park, Keon-Jun;Kim, Yong-Kab;Oh, Sung-Kwun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • 제60권11호
    • /
    • pp.2157-2164
    • /
    • 2011
  • In this paper, we introduce a new category of fuzzy inference system based on Type-2 fuzzy c-means clustering algorithm (T2FCM-based FIS). The premise part of the rules of the proposed model is realized with the aid of the scatter partition of input space generated by Type-2 FCM clustering algorithm. The number of the partition of input space is composed of the number of clusters and the individual partitioned spaces describe the fuzzy rules. Due to these characteristics, we can alleviate the problem of the curse of dimensionality. The consequence part of the rule is represented by polynomial functions with interval sets. To determine the structure and estimate the values of the parameters of Type-2 FCM-based FIS we consider the successive tuning method with generation-based evolution by means of real-coded genetic algorithms. The proposed model is evaluated with the use of numerical experimentation.

A Study on Static Situation Awareness System with the Aid of Optimized Polynomial Radial Basis Function Neural Networks (최적화된 pRBF 뉴럴 네트워크에 의한 정적 상황 인지 시스템에 관한 연구)

  • Oh, Sung-Kwun;Na, Hyun-Suk;Kim, Wook-Dong
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • 제60권12호
    • /
    • pp.2352-2360
    • /
    • 2011
  • In this paper, we introduce a comprehensive design methodology of Radial Basis Function Neural Networks (RBFNN) that is based on mechanism of clustering and optimization algorithm. We can divide some clusters based on similarity of input dataset by using clustering algorithm. As a result, the number of clusters is equal to the number of nodes in the hidden layer. Moreover, the centers of each cluster are used into the centers of each receptive field in the hidden layer. In this study, we have applied Fuzzy-C Means(FCM) and K-Means(KM) clustering algorithm, respectively and compared between them. The weight connections of model are expanded into the type of polynomial functions such as linear and quadratic. In this reason, the output of model consists of relation between input and output. In order to get the optimal structure and better performance, Particle Swarm Optimization(PSO) is used. We can obtain optimized parameters such as both the number of clusters and the polynomial order of weights connection through structural optimization as well as the widths of receptive fields through parametric optimization. To evaluate the performance of proposed model, NXT equipment offered by National Instrument(NI) is exploited. The situation awareness system-related intelligent model was built up by the experimental dataset of distance information measured between object and diverse sensor such as sound sensor, light sensor, and ultrasonic sensor of NXT equipment.

An Overview of Unsupervised and Semi-Supervised Fuzzy Kernel Clustering

  • Frigui, Hichem;Bchir, Ouiem;Baili, Naouel
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제13권4호
    • /
    • pp.254-268
    • /
    • 2013
  • For real-world clustering tasks, the input data is typically not easily separable due to the highly complex data structure or when clusters vary in size, density and shape. Kernel-based clustering has proven to be an effective approach to partition such data. In this paper, we provide an overview of several fuzzy kernel clustering algorithms. We focus on methods that optimize an fuzzy C-mean-type objective function. We highlight the advantages and disadvantages of each method. In addition to the completely unsupervised algorithms, we also provide an overview of some semi-supervised fuzzy kernel clustering algorithms. These algorithms use partial supervision information to guide the optimization process and avoid local minima. We also provide an overview of the different approaches that have been used to extend kernel clustering to handle very large data sets.

Fuzzy Logic Approach to Zone-Based Stable Cluster Head Election Protocol-Enhanced for Wireless Sensor Networks

  • Mary, S.A. Sahaaya Arul;Gnanadurai, Jasmine Beulah
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권4호
    • /
    • pp.1692-1711
    • /
    • 2016
  • Energy is a scarce resource in wireless sensor networks (WSNs). A variety of clustering protocols for WSNs, such as the zone-based stable election protocol-enhanced (ZSEP-E), have been developed for energy optimization. The ZSEP-E is a heterogeneous zone-based clustering protocol that focuses on unbalanced energy consumption with parallel formation of clusters in zones and election of cluster heads (CHs). Most ZSEP-E research has assumed probabilistic election of CHs in the zones by considering the maximum residual energy of nodes. However, studies of the diverse CH election parameters are lacking. We investigated the performance of the ZSEP-E in such scenarios using a fuzzy logic approach based on three descriptors, i.e., energy, density, and the distance from the node to the base station. We proposed an efficient ZSEP-E scheme to adapt and elect CHs in zones using fuzzy variables and evaluated its performance for different energy levels in the zones.

Shape Design of Passages for Turbine Blade Using Design Optimization System (최적화설계시스템을 이용한 터빈블레이드 냉각통로의 형상설계)

  • Jeong Min-Joong;Lee Joon-Seong
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • 제29권7호
    • /
    • pp.1013-1021
    • /
    • 2005
  • In this paper, we developed an automatic design optimization system for parametric shape optimization of cooling passages inside axial turbine blades. A parallel three-dimensional thermoelasticity finite element analysis code from an open source system was used to perform automatic thermal and stress analysis of different blade configuration. The developed code was connected to an evolutionary optimizer and built in a design optimization system. Using the optimization system, 279 feasible and optimal solutions were searched. It is provided not only one best solution of the searched solutions, but also information of variation structure and correlation of the 279 solutions in function, variable, and real design spaces. To explore design information, it is proposed a new interpretation approach based on evolutionary clustering and principal component analysis. The interpretation approach might be applicable to the increasing demands in the general area of design optimization.

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

  • Park, Ho-Sung;Oh, Sung-Kwun
    • International Journal of Control, Automation, and Systems
    • /
    • 제1권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.

Utilizing Particle Swarm Optimization into Multimodal Function Optimization

  • Pham, Minh-Trien;Baatar, Nyambayar;Koh, Chang-Seop
    • Proceedings of the KIEE Conference
    • /
    • 대한전기학회 2008년도 추계학술대회 논문집 전기기기 및 에너지변환시스템부문
    • /
    • pp.86-89
    • /
    • 2008
  • There are some modified methods such as K-means Clustering Particle Swarm Optimization and Niching Particle Swarm Optimization based on PSO which aim to locate all optima in multimodal functions. K-means Clustering Particle Optimization could locate all optima of functions with finite number of optima. Niching Particle Swarm Optimization is able to locate all of optima but high computing time. Because of those disadvantages, we proposed a new method that could locate all of optima with reasonal time. We applied our method and others as well to analytic functions. By comparing the outcomes, it is shown that our method is significantly more effective than the two others.

  • PDF

One-step spectral clustering of weighted variables on single-cell RNA-sequencing data (단세포 RNA 시퀀싱 데이터를 위한 가중변수 스펙트럼 군집화 기법)

  • Park, Min Young;Park, Seyoung
    • The Korean Journal of Applied Statistics
    • /
    • 제33권4호
    • /
    • pp.511-526
    • /
    • 2020
  • Single-cell RNA-sequencing (scRNA-seq) data consists of each cell's RNA expression extracted from large populations of cells. One main purpose of using scRNA-seq data is to identify inter-cellular heterogeneity. However, scRNA-seq data pose statistical challenges when applying traditional clustering methods because they have many missing values and high level of noise due to technical and sampling issues. In this paper, motivated by analyzing scRNA-seq data, we propose a novel spectral-based clustering method by imposing different weights on genes when computing a similarity between cells. Assigning weights on genes and clustering cells are performed simultaneously in the proposed clustering framework. We solve the proposed non-convex optimization using an iterative algorithm. Both real data application and simulation study suggest that the proposed clustering method better identifies underlying clusters compared with existing clustering methods.

Genetic Optimization of Fuzzy C-Means Clustering-Based Fuzzy Neural Networks (FCM 기반 퍼지 뉴럴 네트워크의 진화론적 최적화)

  • Choi, Jeoung-Nae;Kim, Hyun-Ki;Oh, Sung-Kwun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • 제57권3호
    • /
    • pp.466-472
    • /
    • 2008
  • The paper concerns Fuzzy C-Means clustering based fuzzy neural networks (FCM-FNN) and the optimization of the network is carried out by means of hierarchal fair competition-based parallel genetic algorithm (HFCPGA). FCM-FNN is the extended architecture of Radial Basis Function Neural Network (RBFNN). FCM algorithm is used to determine centers and widths of RBFs. In the proposed network, the membership functions of the premise part of fuzzy rules do not assume any explicit functional forms such as Gaussian, ellipsoidal, triangular, etc., so its resulting fitness values directly rely on the computation of the relevant distance between data points by means of FCM. Also, as the consequent part of fuzzy rules extracted by the FCM-FNN model, the order of four types of polynomials can be considered such as constant, linear, quadratic and modified quadratic. Since the performance of FCM-FNN is affected by some parameters of FCM-FNN such as a specific subset of input variables, fuzzification coefficient of FCM, the number of rules and the order of polynomials of consequent part of fuzzy rule, we need the structural as well as parametric optimization of the network. In this study, the HFCPGA which is a kind of multipopulation-based parallel genetic algorithms(PGA) is exploited to carry out the structural optimization of FCM-FNN. Moreover the HFCPGA is taken into consideration to avoid a premature convergence related to the optimization problems. The proposed model is demonstrated with the use of two representative numerical examples.

Identification of Fuzzy System Driven to Parallel Genetic Algorithm (병렬유전자 알고리즘을 기반으로한 퍼지 시스템의 동정)

  • Choi, Jeoung-Nae;Oh, Sung-Kwun
    • Proceedings of the KIEE Conference
    • /
    • 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
    • /
    • pp.201-203
    • /
    • 2007
  • The paper concerns the successive optimization for structure and parameters of fuzzy inference systems that is based on parallel Genetic Algorithms (PGA) and information data granulation (IG). PGA is multi, population based genetic algorithms, and it is used tu optimize structure and parameters of fuzzy model simultaneously, The granulation is realized with the aid of the C-means clustering. The concept of information granulation was applied to the fuzzy model in order to enhance the abilities of structural optimization. By doing that, we divide the input space to form the premise part of the fuzzy rules and the consequence part of each fuzzy rule is newly' organized based on center points of data group extracted by the C-Means clustering, It concerns the fuzzy model related parameters such as the number of input variables to be used in fuzzy model. a collection of specific subset of input variables, the number of membership functions according to used variables, and the polynomial type of the consequence part of fuzzy rules, The simultaneous optimization mechanism is explored. It can find optimal values related to structure and parameter of fuzzy model via PGA, the C-means clustering and standard least square method at once. A comparative analysis demonstrates that the Dnmosed algorithm is superior to the conventional methods.

  • PDF