节点文献

基于任意分割的串行进位链规则获取的计算流程

Calculating Process with Serial Carry Chain for Rules Extraction Based on the Arbitrary Division

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 程玉胜张佑生胡学钢章晓良

【Author】 CHENG Yu-sheng1,ZHANG You-sheng2,3,HU Xue-gang3,ZHANG Xiao-liang4(1.School of Computer and Information,Anqing Teachers College,Anqing,Anhui 246011,China;2.Department of Computer science &Technology,Anhui Sanlian University,Hefei,Anhui 230601,China;3.School of Computer Science,Hefei University of Technology,Hefei,Anhui 230009,China;4.School of Mechanical and Automotive Engineering,Hefei University of Technology,Hefei,Anhui 230009,China)

【机构】 安庆师范学院计算机与信息学院安徽三联学院计算机科学与技术系合肥工业大学计算机与信息学院合肥工业大学机械与汽车工程学院

【摘要】 分析了等价矩阵和联合决策矩阵规则提取算法对于大数据集低效性的根源.提出了基于任意分割的规则获取方法和相应的串行进位链计算流程.这种计算流程将大数据集上的规则获取,转化为通过分割后多个智能体(子系统)及其智能体间数据共享的"并行+串行"的规则提取计算过程,有效的解决了大数据集上规则获取问题.复杂度分析表明该算法在效率上较现有的算法有显著的提高;实例分析验证了该方法的可行性;相应的对比实验表明这种计算流程对大数据集上的规则获取的实用性和高效性.

【Abstract】 Based on equivalence matrix and joint decision matrix,the reason of the existing algorithms inefficiency for rules extraction in massive data set is analyzed.The method of rules extraction and calculating process with serial carry chain based on the arbitrary division are presented.This process about the rules extraction will be changed into many agent(sub-systems) and inter-agent to share data by the "Parallel plus Serial" rule calculation,which can effectively improve the algorithm on the massive data set.Complexity analysis shows that the algorithm is more efficient than those existing algorithms.An example is used to illustrate the efficiency of the new algorithm.At last,experimental result shows that the calculating process with serial carry chain for rules extraction is not only efficient but also scalable.

【基金】 安徽省自然科学基金(No.070412061)
  • 【文献出处】 电子学报 ,Acta Electronica Sinica , 编辑部邮箱 ,2009年12期
  • 【分类号】TP18
  • 【下载频次】139
节点文献中: 

本文链接的文献网络图示:

本文的引文网络