首页 | 本学科首页   官方微博 | 高级检索  
     

基于分治法的快速确定规则获取算法
引用本文:胡峰,王国胤.基于分治法的快速确定规则获取算法[J].模式识别与人工智能,2010,23(3):349-356.
作者姓名:胡峰  王国胤
作者单位:西南交通大学 信息科学与技术学院 成都 610031
重庆邮电大学 计算机科学与技术研究所 重庆 400065
基金项目:国家自然科学基金项目,重庆市重点自然科学基金项目,重庆市杰出青年基金项目,重庆市教育委员会科学技术研究项目
摘    要:值约简是Rough集理论研究的一个重要内容,目前已有的算法很难快速处理大数据集。文中通过在属性空间上对论域对象的分解,提出一种基于分治法的快速确定规则获取算法,并给出实例说明。该算法可直接从离散的决策表获取确定决策规则,在数据服从均匀分布的条件下,算法的时间复杂度低于n2,适合大数据集的确定规则获取。实验结果说明算法的高效性。

关 键 词:粗集  决策表  值约简  分治法  
收稿时间:2009-03-09

Quick Algorithm for Certain Rule Acquisition Based on Divide and Conquer Method
HU Feng,WANG Guo-Yin.Quick Algorithm for Certain Rule Acquisition Based on Divide and Conquer Method[J].Pattern Recognition and Artificial Intelligence,2010,23(3):349-356.
Authors:HU Feng  WANG Guo-Yin
Affiliation:School of Information Science and Technology,Southwest Jiaotong University,Chengdu 610031
Institute of Computer Science and Technology,Chongqing University of Posts and Telecommunications,Chongqing 400065
Abstract: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.
Keywords:Rough Set  Decision Table  Value Reduction  Divide and Conquer Method  
本文献已被 万方数据 等数据库收录!
点击此处可从《模式识别与人工智能》浏览原始摘要信息
点击此处可从《模式识别与人工智能》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号