Algorithm with database technology for Computing the Core Based on Skowrons Discernibility Matrix

摘要：

Designing efficient algorithm for computing the core of decision table is a very meaningful work because the core is the foundation of constructing attribute reduction of the decision table and multi-variable decision tree. To improve the efficiency of the algorithm for computing the core based on Skowrons discernibility matrix with database technology, the new simplified decision table of the old decision table is defined. And it is proved that the core of the new simplified decision table based on positive region is the same as the core of the old one based on Skowrons discernibility matrix. Then an efficient algorithm is proposed for computing the new simplicity decision table. On this condition, an efficient algorithm for computing the core based on Skowrons disceribility matrix by using database technology is designed. At the end, an example is used to illustrate the efficiency of the new algorithm.

关键词： discernibility matrix database simplified decision table complexity core

作者: Guiying Wei

作者单位: School of Economics and Management University of Science and Technology Beijing Beijing, China

会议类型: 国际会议

会议名称: The 2nd IEEE International Conference on Advanced Computer Control(第二届先进计算机控制国际会议 ICACC 2010)

会议地点: 沈阳

会议语种:英文

页码: 380-384

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