• Title/Summary/Keyword: PCM clustering

Search Result 13, Processing Time 0.024 seconds

A New Fuzzy Clustering Algorithm (새로운 퍼지 군집화 알고리즘)

  • Kim, Jae-Young;Park, Dong-Chul;Han, Ji-Ho;Thuy, Huynh Thi Thanh;Song, Young-Soo
    • Proceedings of the KIEE Conference
    • /
    • 2009.07a
    • /
    • pp.1905_1906
    • /
    • 2009
  • 본 논문은 데이터의 군집화를 효율적으로 수행하기 위하여 새로운 군집화 알고리즘을 제안한다. 제안되는 군집화 알고리즘은 Fuzzy C-Means (FCM)에 기반을 두는데, FCM 알고리즘은 모든 데이터에 대한 거리에 기본을 둔 멤버쉽을 기초로 하기 때문에 잡음에 약한 제약을 지니고 있었다. 이를 개선하기 위하여, 제안되었던 PCM(Probabilistic C-Means), FPCM(Fuzzy PCM), PFCM(Probabilistic FCM) 등 여러가지 알고리즘이 제안 되었다. 그러나 이들 알고리즘들은 초기 파라미터값 설정과 과다한 계산양에 따른 문제가 증가하였으며, 또한 잡음에 어느 정도 민감한 문제점을 지니고 있었다. 이 논문에서는 잡음에 대해 효과적으로 대응할 수 있는 새로운 군집화 알고리즘을 제안하고, 전통적인 군집화를 위한 Iris 데이터에 대한 실험을 통하여 효용성을 확인하였다.

  • PDF

A Kernel based Possibilistic Approach for Clustering and Image Segmentation (클러스터링 및 영상 분할을 위한 커널 기반의 Possibilistic 접근 방법)

  • Choi, Kil-Soo;Choi, Byung-In;Rhee, Chung-Hoon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.14 no.7
    • /
    • pp.889-894
    • /
    • 2004
  • The fuzzy kernel c-means (FKCM) algorithm, which uses a kernel function, can obtain more desirable clustering results than fuzzy c-means (FCM) for not only spherical data but also non-spherical data. However, it can be sensitive to noise as in the FCM algorithm. In this paper, a kernel function is applied to the possibilistic c-means (PCM) algorithm and is shown to be robust for data with additive noise. Several experimental results show that the proposed kernel possibilistic c-means (KPCM) algorithm out performs the FKCM algorithm for general data with additive noise.

Diagnosis of Pet by Using FCM Clustering

  • Kim, Kwang-Baek
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.2
    • /
    • pp.39-44
    • /
    • 2021
  • In this paper, we propose a method of disease diagnosis system that can diagnose the health status of household pets for the people who lack veterinary knowledge. The proposed diagnosis system holds 50 different kinds of diseases with the symptoms for each of them as a database to provide results from symptom input. Each disease database has its own symptom codes for a disease, and by using the disease database, FCM clustering technique is applied to disease which outputs membership degree to determine diseases close to the input symptom as a pet diagnosis result. The implementation results of the proposed pet diagnosis system were obtained by the number of selected symptoms and the possibility values of the diseases that have the selected symptoms being sorted in descending order to derive top 3 diseases closest to the pet's symptom.