A Knowledge Reduction Algorithm Based on Discernible Boolean Matrix
The discernible Boolean matrix of information system is defmed.The model of attribute reduction in the form of linear logical equations is established.The method of transforming discernible Boolean matrix into simplest matrix by the elementary row transformation of Boolean matrix is proposed.And the necessary and sufficient condition for determining whether the attribute is absolutely necessary,relatively necessary and absolutely superfluous is given.Finally,an elementary knowledge reduction algorithm is proposed.
Peng Guanming Bian Bingchuan
Department of Applied Science and Technology, Taishan College, Taian 271021, Shandong, P.R.China
国内会议
山东泰安
英文
635-637
2009-08-15（万方平台首次上网日期，不代表论文的发表时间）