Aimed at avoiding repeatly scan decision system,attribute values in appeared U/P algorithm of Rough set is continuously compared and sorted,an indiscernibility relation tree is presented,which based on tree structure,and a fast algorithm of computing U/ P is implemented via indiscernibility relation tree.

The indiscernibility relation in range U is equivalence relation.

Knowledge acquirement through classic rough set approach is got by means of indiscernibility relation,but it is weak to resolve the sequencing classification problems which contain qualitative and quantitative attributes as well as criteria\'s.

Aimed at avoiding repeatly scan decision system,attribute values in appeared U/P algorithm of Rough set is continuously compared and sorted,an indiscernibility relation tree is presented,which based on tree structure,and a fast algorithm of computing U/ P is implemented via indiscernibility relation tree.

The algorithm is based on the concept of indiscernibility relation in rough sets theory and incorporates a novel rotating mask.

The general conceptions and basic theory of Rough Sets are outlined and a new method for image segmentation based on the indiscernibility relation of Rough Sets theory is presented, so the procedure on image processing and analysis based on Rough Sets is investigated elementally.

In order to effectively deal with imprecise linguistic terms in information tables and to improve the ability of dealing with initial fuzzy data, fuzzy indiscernibility relation is proposed.

This paper studies rough sets by means of extending an indiscernible relation to a morphological dilation.

Discretization method based on indiscernibility;

Firstly a expressing method of this kind incomplete information systems is introduced,and the fuzzy indiscernibility relation of information systems is established.