期刊文献+

基于概念格的关联规则在排产管理的应用 被引量:3

Application of association rule based on concept lattice for scheduling management
下载PDF
导出
摘要 针对汽车冲压厂生产数据量急剧增加的问题,研究了如何在冲压厂生产信息数据中运用基于概念格的关联规则挖掘技术,采用横向拆分与纵向合并的策略构造概念格,将普通概念格转化为量化概念格来生成关联规则。实验结果表明,该方法具有较高的挖掘效率,且能有效地寻找数据间隐藏的信息。从而为企业排产管理提供理论依据,达到优化排产的目的,在实际应用中取得了良好的分析效果。 Aimed at the problem that production data volume has increased dramatically in automotive stamping,how to use association rule mining based on concept lattice in production information data is explored. The concept lattice is structured with the strategy of horizontal split and vertical merge, and the association rules are generated by transforming ordinary concept lattice into quantitative concept lattice. The example results show that this method has high mining effi-ciency and the hidden information among data can be discovered effectively. The theoretical basis of scheduling guidance for companies is provided, and the purpose of optimizing scheduling is also realized. Furthermore, effective analytical results are obtained in the practical application.
出处 《计算机工程与应用》 CSCD 2014年第9期264-270,共7页 Computer Engineering and Applications
基金 国家自然科学基金(No.61261911) 江西省研究生创新专项资金项目(No.YC2013-S057)
关键词 数据挖掘 关联规则 概念格 排产管理 data mining association rule concept lattice scheduling management
  • 相关文献

参考文献13

二级参考文献92

  • 1张凯,胡运发,王瑜.基于互关联后继树的概念格构造算法[J].计算机研究与发展,2004,41(9):1493-1499. 被引量:15
  • 2李云,刘宗田,陈崚,徐晓华,程伟.多概念格的横向合并算法[J].电子学报,2004,32(11):1849-1854. 被引量:50
  • 3Tonella P. Using a Concept Lattice of Decomposition Slices for Program Understanding and Impact Analysis [ J ]. IEEE Transactions on Software Engineering, 2003, 29 ( 6 ) :495 - 509.
  • 4Fabbrini F, Fusani M, Gnesi S, et al. Controlling Requirements Evolution: A Formal Concept Analysis -based Approach [ EB/ OL]. [2010 - 10 -29]. http://www - vs. infonnatik, uni - ulm. de/de/intra/bib/2007/ICSEA07/data/068 % 20Controlling% 20Re quirements% 20Evolution. pdf.
  • 5Stumme G, Wille R, Witle U. Conceptual Knowledge Discovery in Databases Using Formal Concept Analysis Methods [ EB/OL ]. [ 2010 - 10 - 12 ]. http ://citeseerx. ist. psu. edu/viewdoc/download? doi = 10.1.1.57. 6133&rep = repl &type = pdf.
  • 6Stumme G. Conceptual Knowledge Discovery with Frequent Concept Lattices[ EB/OL]. [ 2010 - 10 - 12]. http://citeseerx, ist. psu. edu/viewdoc/download ;jsessionid = 923B8204DFDOAE19846 60669348676A97 doi = 10.1.1.14. 1608&rep = repl&type = pdf.
  • 7Hereth J, Stumme G, Wille R, et al. Conceptual Knowledge Discovery and Data Analysis [ EB/OL ]. [ 2010 - 10 - 12 ]. http:// citeseerx, ist. psu. edu/viewdoc/download? doi = 10. 1. 1. 92. 9519&rep = repl &type = pdf.
  • 8Stumme G, Taouil R, Bastide Y, et al. Fast Computation of Concept Lattices Using Data Mining Technics[ EB/OL]. [ 2010 -10 -12 ]. http ://kobra. bibliothek, uni - kassel, de/bitstream/urn:nbn : de : hebis : 34 - 2009013026110/1/StummeFastComputation_ 2000. pdf.
  • 9Bastide Y, Pasquier N, Taouil R, et al. Mining Minimal Non -redundant Association Rules Using Frequent Closed Itemsets [ EB/ OL]. [2010 - 10 - 14 ]. http://kobra, bibliothek, uni - kassel. de/bitstream/um : nbn : de : hebis : 34 - 2009022326389/1/StummeMining_2000, pdf.
  • 10Stumme G. Efficient Data Mining Based on Formal Concept Analysis[ C]. In: Proceedings of the 13th International Conference on Database and Expert Systems Applications. London : Springer - Vetlag, 2002:534 -546.

共引文献47

同被引文献32

引证文献3

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部