Rough 집합을 이용한 근사 패턴 분류

Approximate Pattern Classification with Rough set

In this paper, We propose the concept of approximate Classification in the field of two group discriminan analysis. In our approach, an attribute space is divided into three subspaces. Two subspaces are for given two group and one subspace is for a boundary area between the two groups. We propose Approximate Pattern Classification with Rough set. We also propose learning procedures of neural networks for approximate classification. We propose two weighting methods which lead to possibility analysis and necessity analysis. We illustrate the proposed methods by numerical examples.