计算机科学 ›› 2011, Vol. 38 ›› Issue (1): 259-263.

• 人工智能 • 上一篇    下一篇

基于信息观点的约简算法比较

滕书华,孙即祥,周石琳,李智勇   

  1. (国防科学技术大学电子科学与工程学院 长沙410073)
  • 出版日期:2018-11-16 发布日期:2018-11-16
  • 基金资助:
    本文受自然科学基金项目(40901216)资助。

Comparison with Attribute Reduction Algorithms in Information View

TENG Shu-hua,SUN Ji-xiang,ZHOU Shi-lin,LI Zhi-yong   

  • Online:2018-11-16 Published:2018-11-16

摘要: 在相关文献的基础上,给出了三种不同条件嫡的性质,进而研究了基于三种条件墒的不同搜索策略的约简的算法之间的关系,包括对一致和不一致决策表约简的执行时间、约简质量和分类性能的比较。理论分析和实验结果表明三种条件嫡不同性质导致了三种条件嫡的约简算法存在各自的优缺点。上述工作为用户根据实际需要选择合适的约简算法提供了有益的参考。

关键词: 粗糙集,完备,约简,条件嫡,不一致决策表

Abstract: Many types of conditional entropy reduction have been proposed and applied in information systems. It is thus important to clarify the relationships among the existing types of conditional entropy reduction. In this paper, the properties of three different conditional entropies were compared and analyzed, then we investigated the relations among three conditional entropy reduction based on different selection strategies,including reduction quality,run time and classification accuracy in cosistent and inconsistent decision table. The experimental result shows that three conditional entropy reducts have different advantages and disadvantages. The above work can give a valuable reference for application.

Key words: Rough set, Complete, Reduction, Conditional entropy, Inconsistent decision table

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!