• Title/Summary/Keyword: crisp Perceptron

Search Result 4, Processing Time 0.016 seconds

A Possibilistic Based Perceptron Algorithm for Finding Linear Decision Boundaries (선형분류 경계면을 찾기 위한 Possibilistic 퍼셉트론 알고리즘)

  • Kim, Mi-Kyung;Rhee, Frank Chung-Hoon
    • 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.

A Possibilistic Perceptron Algorithm for Pattern Recognition (패턴 인식을 위한 Possibilistic 퍼셉트론 알고리즘)

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

  • PDF

An Interval Type-2 Fuzzy Perceptron for Finding Linear Decision Boundaries (선형분류 경계면을 찾기위한 Interval 제2종 퍽지퍼셉트론)

  • Hwang, Cheul;Rhee, Frank Chung-Hoon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.4
    • /
    • pp.294-299
    • /
    • 2002
  • This paper presents an interval type-2 fuzzy perceptron algorithm that is an extension of the type-1 fuzzy perceptron algorithm proposed in [1]. In our proposed method, the membership values for each pattern vector are extended as interval type-2 fuzzy memberships by assigning uncertainty to the type-1 memberships. By doing so, the decision boundary obtained by interval type-2 fuzzy memberships can converge to a more desirable location than the boundary obtained by crisp and type-1 fuzzy perceptron methods. Experimental results are given to show the effectiveness of our method.

An Interval Type-2 Fuzzy Perceptron (Interval 제2종 퍼지 퍼셉트론)

  • Hwang, Cheul;Rhee, Chung-Hoon
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2002.05a
    • /
    • pp.223-226
    • /
    • 2002
  • This Paper presents an interval type-2 fuzzy perceptron algorithm that is an extension of the type-1 fuzzy perceptron algorithm proposed in [1]. In our proposed method, the membership values for each Pattern vector are extended as interval type-2 fuzzy memberships by assigning uncertainty to the type-1 memberships. By doing so, the decision boundary obtained by interval type-2 fuzzy memberships can converge to a more desirable location than the boundary obtained by crisp and type-1 fuzzy perceptron methods. Experimental results are given to show the effectiveness of our method

  • PDF