期刊文献+

网格环境下基于WEKA4WS的分布式矩阵关联规则挖掘算法 被引量:2

WEKA4WS-Based Distributed Mining Algorithm for Matrix Association Rules Under Grid Environment
下载PDF
导出
摘要 在相关矩阵理论的研究基础上,将网格与Web服务技术融合,以分布式问题求解环境和开源数据挖掘类库weka为底层支撑,构建了网格环境下面向服务的分布式数据挖掘体系,提出一种基于矩阵的分布式关联规则算法.该算法不需要进行复杂的寻找频繁项集的过程,直接通过关联矩阵就可以判断出,给出了算法的理论证明,并通过实例验证了算法的正确性、有效性和体系结构的可行性,对于解决分布式关联规则挖掘问题有了一个新的突破. On the basis of in-depth research of the matrix theory and the association of grid and Web service technology,the paper presents a service-oriented distributed data mining system under grid environment,which is supported by distributed solution environment and Weka library.A matrix-based association rule algorithm is given,which can be judged directly by association matrix rather than by complicated seeking of frequent item sets.The algorithm is theoretically and practically proved to be correct,valid and feasible,which indicates a breakthrough in dealing with the distributed mining problem of association rule.
出处 《南通大学学报(自然科学版)》 CAS 2010年第3期76-82,共7页 Journal of Nantong University(Natural Science Edition) 
基金 国家高技术研究发展计划(863计划)项目(2007AA01Z126) 总装武器装备预研基金(9140A0605409JB8102) 解放军理工大学预研基金(2009JSJ11)
关键词 网格 weak4ws 分布式关联规则 挖掘算法 grid weka4ws distributed association rule mining algorithm
  • 相关文献

参考文献1

二级参考文献10

  • 1皮德常,秦小麟,王宁生.基于动态剪枝的关联规则挖掘算法[J].小型微型计算机系统,2004,25(10):1850-1852. 被引量:16
  • 2AGRAWAL R,IMIELINSKI T,SWAMI A.Mining association rules between sets of items in large database[A].In Proc.of the ACM SIGMOD Intl Conf.on Management of Data[C].Washington,D.C.,1993.207 -216.
  • 3PARK JS,CHEN MS,YU PS.An effective hash based algorithm for mining association rules[A].ACM SIGMOD International Conference Management of Data[C].1995.175-186.
  • 4SAVASERE A,OMIECINSKI E,NAVATHE S.An efficient algorithm for mining association rules in large database[A].In:Proc.of 21th Intl Conf.on Very Large DataBase[C].Zurich,Swizerland,1995.432-443.
  • 5PASQUIER N,BASTIDE Y,TAOUIL R,et al.Discovering frequent closed item sets for association rules[A].ICDT'99,Israel[C].1999.398 -416.
  • 6HAN J,PEI J,YIN Y.Mining frequent patterns without candidate generation[A].In:Proceedings of the 2000 ACM SIGMOD Internal Conference on Management of Data[C].Dallas,Texas:ACM Press,2000.1-12.
  • 7PASQUOER N,BASTIDE Y,TAOUIL R.Effictient mining of association rules using closed item set lattices[J].Information System,1999,24(1):25 -46.
  • 8BERZAL F,CUBERO J-C,MARIN N.TBAR:An efficient method for association rule mining in relational databases[J].Data & Knowledge Engineering,2001,37:47-64.
  • 9HAN J-W,KAMBR M.Data mining concepts and techniques[M].Beijing:Higher Education Press,2001.255-279.
  • 10张禾瑞,赫炳新.高等代数[M].第3版.北京:高等教育出版社,1993.

共引文献52

同被引文献4

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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