计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (1): 147-148.DOI: 10.3778/j.issn.1002-8331.2009.01.046
• 数据库、信号与信息处理 • 上一篇 下一篇
武 妍,张春晖
收稿日期:
修回日期:
出版日期:
发布日期:
通讯作者:
WU Yan,ZHANG Chun-hui
Received:
Revised:
Online:
Published:
Contact:
摘要： 将Martin Ester提出的最小一致性覆盖方法应用于不完备规则集的规则提取。首先对不完备数据分别进行两种方法的预处理，然后通过定义数据间的一致性来使规则提取的覆盖问题转化成划分问题。经过UCI上两个数据集的测试，证明了这种方法的有效性。
关键词: 数据挖掘, 不完备数据集, 最小一致性覆盖, 粗糙集
Abstract: This paper applies minimum consistent subset cover，which is put forward by Martin Ester，to rule learning in incomplete rule set.First the rule set is complemented by two methods，then turn cover problem to partition issue by defining consistency between data.At last effectiveness of this method is proved with the experiment on two data sets on UCI.
Key words: data mining, incomplete data set, minimum consistent subset cover, rough set
武 妍,张春晖. 最小一致性覆盖在不完备规则集中的应用[J]. 计算机工程与应用, 2009, 45(1): 147-148.
WU Yan,ZHANG Chun-hui. Application of minimum consistent subset cover in incomplete rule set[J]. Computer Engineering and Applications, 2009, 45(1): 147-148.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/10.3778/j.issn.1002-8331.2009.01.046
http://cea.ceaj.org/CN/Y2009/V45/I1/147
