摘要
值约简是Rough集理论研究的一个重要内容,目前已有的算法很难快速处理大数据集.文中通过在属性空间上对论域对象的分解,提出一种基于分治法的快速确定规则获取算法,并给出实例说明.该算法可直接从离散的决策表获取确定决策规则,在数据服从均匀分布的条件下,算法的时间复杂度低于n2,适合大数据集的确定规则获取.实验结果说明算法的高效性.
Value reduction is a very important issue in rough set theory. Many efficient algorithms have been developed, however, few of them can process huge data sets quickly. In this paper, a quick algorithm for certain rule acquisition based on divide and conquer method is developed by dividing universe objects in attribute space. The proposed algorithm is illustrated by a case research as well. A certain rule set can be got quickly from a discrete decision table in this algorithm. If the data set is in uniform distribution, the time complexity of the algorithm is less than n2 , which is fit to process large data sets efficiently. Experiment results show its high efficiency.
出处
《模式识别与人工智能》
EI
CSCD
北大核心
2010年第3期349-356,共8页
Pattern Recognition and Artificial Intelligence
基金
国家自然科学基金项目(No.60573068
60773113)
重庆市重点自然科学基金项目(No.2008BA2017)
重庆市杰出青年基金项目(No.2008BA2041)
重庆市教育委员会科学技术研究项目(No.KJ090512)资助
关键词
粗集
决策表
值约简
分治法
Rough Set, Decision Table, Value Reduction, Divide and Conquer Method
