咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >Quantization of Rough Set Base... 收藏

Quantization of Rough Set Based Attribute Reduction

Quantization of Rough Set Based Attribute Reduction

作     者:Bing Li Peng Tang Tommy W. S. Chow 

作者机构:Department of Electronic Engineering City University of Hong Kong 83 Tat Chee Avenue Kowloon Hong Kong 

出 版 物:《Journal of Software Engineering and Applications》 (软件工程与应用(英文))

年 卷 期:2012年第5卷第12期

页      面:117-123页

学科分类:08[工学] 0812[工学-计算机科学与技术(可授工学、理学学位)] 

主  题:attribute reduction extension rule distribution of solutions quantization 

摘      要:We demonstrate rough set based attribute reduction is a sub-problem of propositional satisfiability problem. Since satisfiability problem is classical and sophisticated, it is a smart idea to find solutions of attribute reduction by methods of satisfiability. By extension rule, a method of satisfiability, the distribution of solutions with different numbers of attributes is obtained without finding all attribute reduction. The relation between attribute reduction and missing is also analyzed from computational cost and amount of solutions.

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分