计算机集成制造系统 ›› 2015, Vol. 21 ›› Issue (第7期): 1690-1701.DOI: 10.13196/j.cims.2015.07.003

• 产品创新开发技术 • 上一篇    下一篇

基于增量式的知识发现

王毅1,陈庆新2+,毛宁2,丁力行1   

  1. 1.仲恺农业工程学院机电工程学院
    2.广东工业大学机电工程学院
  • 出版日期:2015-07-31 发布日期:2015-07-31
  • 基金资助:
    国家863计划资助项目(2007AA04Z1A8);国家自然科学基金资助项目(51375098);广东省自然科学基金资助项目(S2011010002245)。

Knowledge discovery based on incremental

  • Online:2015-07-31 Published:2015-07-31
  • Supported by:
    Project supported by the National High-Tech.R&D Program,China(No.2007AA04Z1A8),the National Natural Science Foundation,China(No.51375098),and the Guangdong Provincial Natural Science Foundation,China(No.S2011010002245).

摘要: 鉴于运用基本粗糙集理论获取与更新经验性知识时,进行增量式更新过程中数据库时空开销大的问题,提出一种基于改进差别矩阵的增量式规则获取方法。首先对原有的差别矩阵进行优化,使其具有比较小的空间复杂度;然后在分析新增对象与原决策系统之间关系的基础上,设计了求核及其增量式更新算法以及基于差别函数的属性约简与增量式更新算法,提高了核的更新效率;通过计算规则的精度,设定规则的阈值,形成了规则提取算法;最后以改模方案和故障诊断知识的获取与增量式更新作为实例,验证了该方法的正确性与可行性。

关键词: 粗糙集, 差别矩阵, 增量式更新, 知识发现, 改模方案

Abstract: The acquisition and incremental updating of the experience knowledge could be obtained by using basic rough sets theory,but the time and space costs of the algorithm would be very large.Aiming at these problems,a rules incremental updating algorithm based on discernibility matrix was built.The original discernibility matrix was optimized to make its space complexity become small.By analyzing the relationship between new object and old decision table,the incremental updating algorithm for finding the core was built,and the incremental updating algorithm for attribution reduction based on discriminent function was designed.The updating efficiency of finding the core was increased.The incremental updating algorithm of rules was formed by calculating the accuracy of the rules and setting threshold of the rules.The validity and feasibility of the algorithm was verified by the acquisition and incremental updating of the mould repair schemes and fault diagnosis knowledge.

Key words: rough set, discernibility matrix, incremental updating, knowledge discovery, mould repair schemes

中图分类号: