Comparison of Lazy Classification Algorithms Based on Deterministic and Inhibitory Decision Rules

摘要：

In the paper,two lazy classification algorithms of polynomial time complexity are considered.These algorithms are based on deterministic and inhibitory decision rules,but the direct generation of rules is not required.Instead of this,for any new object the considered algorithms extract from a given decision table efficiently some information about the set of rules.Next,this information is used by a decision-making procedure.The reported results of experiments show that the algorithms based on inhibitory decision rules are often better than those based on deterministic decision rules.

关键词： Rough sets Decision tables Deterministic decision rules Inhibitory decision rules

作者: Pawel Delimata Mikhail Moshkov Andrzej Skowron Zbigniew Suraj

作者单位: Chair of Computer Science,University of Rzesz(o)w Rejtana 16A,35-310 Rzesz(o)w,Poland Institute of Computer Science,University of Silesia B(e)dzi(n)ska 39,41-200 Sosnowiec,Poland Institute of Mathematics,Warsaw University Banacha 2,02-097 Warsaw,Poland

会议类型: 国际会议

会议名称: The Third International Conference on Rough Sets and Knowledge Tevhnology(RSKT 2008)(第三届粗糙集与知识技术国际会议)

会议地点: 成都

会议语种:英文

页码: 55-62

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