Reduction Algorithms of Incomplete Covering Decision Systems

摘要：

　　This paper discusses the reduction algorithms of an incomplete covering decision system.Firstly,we give the definition of a new pair of upper and lower approximations in an incomplete covering information system and give their axiomatic characterizations.Then,we introduce the special conditional entropy and the limitary conditional entropy of a covering decision system with multi-coverings and study the reduction of coverings by means of special conditional entropy (limitary conditional entropy) in β-consistent (inconsistent) covering decision systems.Two algorithms are designed to compute reductions of theβ-consistent and inconsistent covering decision systems,respectively.

关键词： Incomplete covering approximation system Reduction Conditional entropy Algorithm

作者: Shaopu Zhang Tao Feng

作者单位: Department of Mathematics and Physics, Shijiazhuang Tiedao University, Shijiazhuang, 050043,China College of Math and Info.Science, Hebei Normal University, Shijiazhuang, 050091, China

会议类型: 国际会议

会议名称: 2012 2nd international Conference on Materials Science and Information Technology(2012第二届材料科学与信息技术国际会议)(MSIT2012)

会议地点: 西安

会议语种:英文

页码: 1409-1413

在线出版日期: 2012-08-24（万方平台首次上网日期，不代表论文的发表时间）