• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.12a
• /
• pp.303-306
• /
• 2001

패턴 인식에서 선형 분류 가능한 경계면을 찾아 패턴을 분류하는 방법 중 가장 기본적인 방법은 퍼셉트론이라고 볼 수 있다. 하지만 선형 분류 불가능한 패턴에 대해서는 유용한 결과를 보여주지 못하였다. 먼저 제안된 퍼지 퍼셉트론은 베타영역 설정에 의해 수렴하지 못하는 특성을 보완하였다. 그러나 패턴의 순수한 전형성을 고려해 주지 못하는 단점이 있다. 이에 Crisp의 선형분류 특성과 퍼지의. 수렴특성을 합성하고자 Possibilistic 퍼셉트론을 제시한다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.1
• /
• pp.14-18
• /
• 2002

The perceptron algorithm, which is one of a class of gradient descent techniques, has been widely used in pattern recognition to determine linear decision boundaries. However, it may not give desirable results when pattern sets are nonlinerly separable. A fuzzy version was developed to male up for the weaknesses in the crisp perceptron algorithm. This was achieved by assigning memberships to the pattern sets. However, still another drawback exists in that the pattern memberships do not consider class typicality of the patterns. Therefore, we propose a possibilistic approach to the crisp perceptron algorithm. This algorithm combines the linearly separable property of the crisp version and the convergence property of the fuzzy version. Several examples are given to show the validity of the method.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.14 no.4
• /
• pp.240-248
• /
• 2014

We present a robust speaker identification algorithm that uses novel features based on soft bag-of-word representation and a simple Naive Bayes classifier. The bag-of-words (BoW) based histogram feature descriptor is typically constructed by summarizing and identifying representative prototypes from low-level spectral features extracted from training data. In this paper, we define a generalization of the standard BoW. In particular, we define three types of BoW that are based on crisp voting, fuzzy memberships, and possibilistic memberships. We analyze our mapping with three common classifiers: Naive Bayes classifier (NB); K-nearest neighbor classifier (KNN); and support vector machines (SVM). The proposed algorithms are evaluated using large datasets that simulate medical crises. We show that the proposed soft bag-of-words feature representation approach achieves a significant improvement when compared to the state-of-art methods.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.423-426
• /
• 2007

클러스터링은 주어진 데이터 포인트들을 주어진 개수의 그룹으로 나누는 비지도 학습의 한 방법이다. 클러스터링의 방법 중 하나로 널리 알려진 퍼지 클러스터링은 하나의 포인트가 모든 클러스터에 서로 다른 정도로 소속될 수 있도록 함으로써 각 포인트가 하나의 클러스터에만 속할 수 있도록 하는 K-means와 같은 방법에 비해 자연스러운 클러스터 형태의 유추가 가능하고, 잡음에 강한 장점이 있다. 이 논문에서는 기존의 퍼지 클러스터링 방법 중 소속도(membership)와 전형성(typicality)을 동시에 계산해 낼 수 있는 Possibilistic Fuzzy C-Means (PFCM) 방법에 Gath-Geva (GG)의 방법 을 적용하여 PFCM을 확장한다. 제안한 방법은 PFCM의 장점을 그대로 가지면서도, GG의 거리 척도에 의해 클러스터들 사이의 경계를 강조함으로써 분류 목적에 적합한 소속도를 계산할 수 있으며, 전형성은 가우스 형태의 분포에서 생성된 포인트들의 분포 함수를 정확하게 모사함으로써 확률 밀도 추정의 방법으로도 사용될 수 있다. 또한 GG 방법은 Gustafson-Kessel 방법과 달리 클러스터에 포함된 포인트의 개수가 확연히 차이 나는 경우에도 정확한 결과를 얻을 수 있다는 사실을 실험 결과를 통해 확인할 수 있었다.

• 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.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.506-511
• /
• 1998

In this paper we consider multiobjective linear programming problems with coefficients of the objective functions specified by possibility distributions. Possibly and necessarily efficient solution sets are defined as funny solution sets whose membership grades represent possibility and necessity degrees to which a feasible solution is efficient. Considering efficiency condition and its dual condition in ordinary multiobjective linear programming problem, we propose efficiency test methods based on an extreme ray generation method. Since the proposed methods can be put in the part of a bi-section method, we can develop calculation and methods of the degree of possible and necessary efficiency for feasible solutions.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.1
• /
• pp.139-157
• /
• 1993

This paper presents possibilistic job scheduling based on the membership function as an alternative to probabilistic job scheduling and illustrates a methodology for solving job sequencing problem which the opinions of experts greatly disagree in each processing time. Triangular fuzzy numbers are used to represent the processing times of experts. Here, the comparison method is based on the dominance property. The criteria for dominance are presented. By the dominance criteria, for each job, a mojor TFN and a minor TFN are selected and apessimistic sequence with mojor TFNs and an optimistic sequence with minor TFNs are computed. The three-machine flow shop problem is considered as an example to illustrate the approach.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.3
• /
• pp.185-191
• /
• 2007

Remote sensing images are multispectral image data collected from several band divided by wavelength ranges. The classification of remote sensing images is the method of classifying what has similar spectral characteristics together among each pixel composing an image as the important algorithm in this field. This paper presents a pattern classification method of remote sensing images by applying a possibilistic fuzzy c-means (PFCM) algorithm. The PFCM algorithm is a hybridization of a FCM algorithm, which adopts membership degree depending on the distance between data and the center of a certain cluster, combined with a PCM algorithm, which considers class typicality of the pattern sets. In this proposed method, we select the training data for each class and perform supervised classification using the PFCM algorithm with spectral signatures of the training data. The application of the PFCM algorithm is tested and verified by using Landsat TM and IKONOS remote sensing satellite images. As a result, the overall accuracy showed a better results than the FCM, PCM algorithm or conventional maximum likelihood classification(MLC) algorithm.