The Attributes Reduce Of Relational Neighborhood Systems

Rough set model and neighborhood system model are two different models in granular computing. Rough set is based on different relationships to build knowledge granular. In the processing of constructing granular, the important degree of attributes is different, so the reduce of attributes is a fundamental problem in rough set theory, and the tradition method is discernibility matrix. In this paper, firstly,the nature of neighborhood system and the condition for neighborhood systems form a topology space is given; then in the rough set model which based on the neighborhood systems,the equivalence condition of attributes reducible element is also introduced into relational neighborhood systems.Especially,the relationship between the attributes reduce and the topology of neighborhood systems are proved on the dominance relation condition.