Knowledge Reduction for Incomplete Connection-degree-based Rough Sets Model
Xianzhong Zhou · Jisuanji gongcheng · 2008
Knowledge reduction is one of the most important issues in rough sets theory. In incomplete information systems,researchers study connection-degree-based rough sets model. However,knowledge reduction for this model has never been researched. In this paper,the connection-degree-based rough sets model is improved and knowledge reduction for this mode is examined. Several knowledge reductions are proposed and the relations between them are showed. Using elementary discernibility matrix and the significance of attributes defined,a knowledge reduction algorithm for incomplete information systems is presented. Example analysis shows that this algorithm is valid.