• Title/Summary/Keyword: 퍼지 C-Means Clustering

Search Result 146, Processing Time 0.03 seconds

Effective Fuzzy Clustering Algorithm Using Evolution Program (진화 프로그램을 이용한 효율적인 퍼지 클러스터링 알고리즘)

  • 정창호;박주영;박대희
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1997.10a
    • /
    • pp.139-142
    • /
    • 1997
  • 본 논문에서는 기존 FCM(Fuzzy C-Means) 타입 클러스터링 알고리즘의 선은 향상을 위한 설계 방법을 제시한다. 우선 클러스터의 응집성(compactness)과 분리성(separation)을 동시에 고려한 성능 지수를 정의하고, 이를 진화 프로그램을 통하여 최적화 한다. 또한 실험을 통하여 기존 연구들과의 비교 및 제안된 방법론의 유효성을 보인다.

  • PDF

Improvement of the PFCM(Possibilistic Fuzzy C-Means) Clustering Method (PFCM 클러스터링 기법의 개선)

  • Heo, Gyeong-Yong;Choe, Se-Woon;Woo, Young-Woon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.1
    • /
    • pp.177-185
    • /
    • 2009
  • Cluster analysis or clustering is a kind of unsupervised learning method in which a set of data points is divided into a given number of homogeneous groups. Fuzzy clustering method, one of the most popular clustering method, allows a point to belong to all the clusters with different degrees, so produces more intuitive and natural clusters than hard clustering method does. Even more some of fuzzy clustering variants have noise-immunity. In this paper, we improved the Possibilistic Fuzzy C-Means (PFCM), which generates a membership matrix as well as a typicality matrix, using Gath-Geva (GG) method. The proposed method has a focus on the boundaries of clusters, which is different from most of the other methods having a focus on the centers of clusters. The generated membership values are suitable for the classification-type applications. As the typicality values generated from the algorithm have a similar distribution with the values of density function of Gaussian distribution, it is useful for Gaussian-type density estimation. Even more GG method can handle the clusters having different numbers of data points, which the other well-known method by Gustafson and Kessel can not. All of these points are obvious in the experimental results.

MRI Data Segmentation Using Fuzzy C-Mean Algorithm with Intuition (직관적 퍼지 C-평균 모델을 이용한 자기 공명 영상 분할)

  • Kim, Tae-Hyun;Park, Dong-Chul;Jeong, Tai-Kyeong;Lee, Yun-Sik;Min, Soo-Young
    • Journal of IKEEE
    • /
    • v.15 no.3
    • /
    • pp.191-197
    • /
    • 2011
  • An image segmentation model using fuzzy c-means with intuition (FCM-I) model is proposed for the segmentation of magnetic resonance image in this paper. In FCM-I, a measurement called intuition level is adopted so that the intuition level helps to alleviate the effect of noises. A practical magnetic resonance image data set is used for image segmentation experiment and the performance is compared with those of some conventional algorithms. Results show that the segmentation method based on FCM-I compares favorably to several conventional clustering algorithms. Since FCM-I produces cluster prototypes less sensitive to noises and to the selection of involved parameters than the other algorithms, FCM-I is a good candidate for image segmentation problems.

Classification of Music Data using Fuzzy c-Means with Divergence Kernel (분산커널 기반의 퍼지 c-평균을 이용한 음악 데이터의 장르 분류)

  • Park, Dong-Chul
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.3
    • /
    • pp.1-7
    • /
    • 2009
  • An approach for the classification of music genres using a Fuzzy c-Means(FcM) with divergence-based kernel is proposed and presented in this paper. The proposed model utilizes the mean and covariance information of feature vectors extracted from music data and modelled by Gaussian Probability Density Function (GPDF). Furthermore, since the classifier utilizes a kernel method that can convert a complicated nonlinear classification boundary to a simpler linear one, he classifier can improve its classification accuracy over conventional algorithms. Experiments and results on collected music data sets demonstrate hat the proposed classification scheme outperforms conventional algorithms including FcM and SOM 17.73%-21.84% on average in terms of classification accuracy.

Backlit Region Detection Using Adaptively Partitioned Block and Fuzzy C-means Clustering for Backlit Image Enhancement (역광 영상 개선을 위한 퍼지 C-평균 분류기와 적응적 블록 분할을 사용한 역광 영역 검출)

  • Kim, Nahyun;Lee, Seungwon;Paik, Joonki
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.2
    • /
    • pp.124-132
    • /
    • 2014
  • In this paper, we present a novel backlit region detection and contrast enhancement method using fuzzy C-means clustering and adaptively partitioned block based contrast stretching. The proposed method separates an image into both dark backlit and bright background regions using adaptively partitioned blocks based on the optimal threshold value computed by fuzzy logic. The detected block-wise backlit region is refined using the guided filter for removing block artifacts. Contrast stretching algorithm is then applied to adaptively enhance the detected backlit region. Experimental results show that the proposed method can successfully detect the backlit region without a complicated segmentation algorithm and enhance the object information in the backlit region.

Improvement on Density-Independent Clustering Method (밀도에 무관한 클러스터링 기법의 개선)

  • Kim, Seong-Hoon;Heo, Gyeongyong
    • 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.

Movement Intention Detection of Human Body Based on Electromyographic Signal Analysis Using Fuzzy C-Means Clustering Algorithm (인체의 동작의도 판별을 위한 퍼지 C-평균 클러스터링 기반의 근전도 신호처리 알고리즘)

  • Park, Kiwon;Hwang, Gun-Young
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.1
    • /
    • pp.68-79
    • /
    • 2016
  • Electromyographic (EMG) signals have been widely used as motion commands of prosthetic arms. Although EMG signals contain meaningful information including the movement intentions of human body, it is difficult to predict the subject's motion by analyzing EMG signals in real-time due to the difficulties in extracting motion information from the signals including a lot of noises inherently. In this paper, four Ag/AgCl electrodes are placed on the surface of the subject's major muscles which are in charge of four upper arm movements (wrist flexion, wrist extension, ulnar deviation, finger flexion) to measure EMG signals corresponding to the movements. The measured signals are sampled using DAQ module and clustered sequentially. The Fuzzy C-Means (FCMs) method calculates the center values of the clustered data group. The fuzzy system designed to detect the upper arm movement intention utilizing the center values as input signals shows about 90% success in classifying the movement intentions.

Optimal Design of Fuzzy Relation-based Fuzzy Inference Systems Based on Evolutionary Information Granulation (진화론적 정보 입자에 기반한 퍼지 관계 기반 퍼지 추론 시스템의 최적 설계)

  • Park, Keon-Jun;Kim, Hyun-Ki;Oh, Sung-Kwun
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.340-342
    • /
    • 2004
  • In this paper, we introduce a new category of fuzzy inference systems baled 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. 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 polyminial 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(GAs) and the least square method. The proposed model is contrasted with the performance of the conventional fuzzy models in the literature.

  • PDF

Optimization of Fuzzy Set-based Fuzzy Inference Systems Based on Evolutionary Data Granulation (진화론적 데이터 입자에 기반한 퍼지 집합 기반 퍼지 추론 시스템의 최적화)

  • Park, Keon-Jun;Lee, Bong-Yoon;Oh, Sung-Kwun
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.343-345
    • /
    • 2004
  • We propose a new category of fuzzy set-based fuzzy inference systems based on data granulation related to fuzzy space division for each variables. Data granules are viewed as linked collections of objects(data, in particular) drawn together by the criteria of proximity, similarity, or functionality. Granulation of data 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 polyminial 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(GAs) and the least square method. Numerical example is included to evaluate the performance of the proposed model.

  • PDF

Development of Classification Model on SAC Refrigerant Charge Level Using Clustering-based Steady-state Identification (군집화 기반 정상상태 식별을 활용한 시스템 에어컨의 냉매 충전량 분류 모델 개발)

  • Jae-Hee, Kim;Yoojeong, Noh;Jong-Hwan, Jeung;Bong-Soo, Choi;Seok-Hoon, Jang
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.35 no.6
    • /
    • pp.357-365
    • /
    • 2022
  • Refrigerant mischarging is one of the most frequently occurring failure modes in air conditioners, and both undercharging and overcharging degrade cooling performance. Therefore, it is important to accurately determine the amount of charged refrigerant. In this study, a support vector machine (SVM) model was developed to multi-classify the refrigerant mischarge through steady-state identification via fuzzy clustering techniques. For steady-state identification, a fuzzy clustering algorithm was applied to the air conditioner operation data using the difference between moving averages. The identification results using the proposed method were compared with those using existing steady-state determination techniques studied through the inversed Fisher's discriminant ratio (IFDR). Subsequently, the main features were selected using minimum redundancy maximum relevance (mRMR) considering the correlation among candidate features, and an SVM multi-classification model was devised using the derived features. The proposed method achieves satisfactory accuracy and robustness from test data collected in the new domain.