期刊文献+

基于UML Profile的关联规则挖掘元模型研究

Design data mining metamodel based on UML Profile
下载PDF
导出
摘要 针对目前数据挖掘系统缺乏通用性和复用性的问题,对UML进行轻量级扩展,采用UML Profile机制建立了一套关联规则挖掘元模型,实现了关联规则挖掘在概念层上的建模设计,取代了以往在具体的表结构和数据仓库系统上进行建模的方法,并在某大型钢结构企业的决策支持系统中验证了模型的有效性。最后在Analy-sis Services 2008上经过验证,利用UML Profile机制建立的关联规则挖掘元模型可较早地伴随决策系统进入设计阶段,减少开发的时间和代价。 Aiming at lack generality and reusability in data mining system, established a set of association rule mining metamodel by using the lightweight extension mechanism of UML. With this profile, replaced the traditional method which considering on the final table structure and DWs. And finally put it into decision making support system of a large steel company. Practice proves that the metamodel can be easily used in the design of the decision making system,thus reduces the time and cost.
出处 《计算机应用研究》 CSCD 北大核心 2010年第1期68-70,共3页 Application Research of Computers
基金 国家自然科学基金资助项目(70572098 70471056)
关键词 统一建模语言扩展 版类 关联规则 数据挖掘 元模型 决策支持系统 UML Profile stereotype association rules data mining metamodel decision support system
  • 相关文献

参考文献10

  • 1KANG K C, COHEN S G, HESS .l A, et at. Feature oriented domain analysis (FODA) feasibility study, CMU/SEI-90-TR-21 [ R]. Pittsburgh: Software Engineering Institute, Carnegie Mellon University, 1990.
  • 2CRNKOVIC I. Component based software engineering new challenges in software development[J]. Software Focus,2001,2(4) :127-133.
  • 3JOSE Z, JUAN T. An UML 2.0 profile to design association rule mining models in the multidimensional conceptual modeling of data warehouses[J]. Data & Knowledge Engineering, 2007,63( 1 ): 44-62.
  • 4邵维忠,蒋严冰,麻志毅.UML现存的问题和发展道路[J].计算机研究与发展,2003,40(4):509-516. 被引量:22
  • 5刘德喜,何炎祥,邢显黎.一种新的频繁项集挖掘算法[J].计算机应用研究,2007,24(2):17-19. 被引量:8
  • 6张忠平,李岩,杨静.基于矩阵的频繁项集挖掘算法[J].计算机工程,2009,35(1):84-86. 被引量:19
  • 7AGRAWAL R, IMIELINSKI T, SWAMI A. Mining asociation rulesbetween sets of items in large data bases[ C]//Pmc of ACM SIGMOD International Conference on Management of Data. New York:ACM Press, 1993:207-216.
  • 8HAN Jia-wei, PEI Jian, YIN Yi-wei. Mining frequent patterns without candidate generation[ C]//Proc of the 19th ACM SIGMOD International Conference on Management of Data. New York : ACM Press, 2000.
  • 9COKROWIJOYO H, TANIAR D. A framework for mining association rules in data warehouses [ C ]//Proc of the 5th International Conference on Intelligent Data Engineering and Automated Learning. Berlin : Springer, 2004 : 159-165.
  • 10JOSE N M, JUAN T. An MDA approach for the development of data warehouses[J]. Decision Support Systems, 2008,45( 1 ) :41-58.

二级参考文献21

  • 1焦学磊,王新庄.基于矩阵的频繁项集发现算法[J].江汉大学学报(自然科学版),2007,35(1):43-46. 被引量:6
  • 2CrisKobryn.UML2001 : A standardization Odyssey[J].Communications of the ACM,1999,42(10):29-37.
  • 3CrisKobryn.The road to UML2.0: Fast track or detour[J].Software Deve1opment,2001,.
  • 4Fbarbier Bhenderson-Se11ers.Object mode1ing 1anguage: An eva1uation and some key expectation for future[J].Anna1s of Software Engineering,2000,10(10):67-101.
  • 5HANJ KAMBERM.DATA MINING concepts and techniques[M].北京:高等教育出版社,2001..
  • 6Agrawal R, Imielinski T, Swami A. Mining Association Rules Between Sets of Items in Large Databases[C]//Proc. of ACMSIGMOD Int'l Conf. on Management of Data. Washington D. C., USA: [s. n.], 1993.
  • 7Han Jiawei, Pei Jian, Yin Yiwei. Mining Frequent Patterns Without Candidate Generation[C]//Proc. of the 2000 ACM-SIGMOD Int'l Conf. on Management of Data. Dallas, TX, USA: [s. n.], 2000.
  • 8Wu Fan. A New Approach to Mine Frequent Patterns Using Item-transformation Methods[J]. Information Systems, 2007, 32(7): 1056-1072.
  • 9王柏盛,刘寒冰,靳书和,马丽艳.基于矩阵的关联规则挖掘算法[J].微计算机信息,2007,23(05X):144-145. 被引量:18
  • 10姚淑珍 唐发根.UML参考手册[M].北京:机械工业出版社,2001..

共引文献46

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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