期刊文献+

一种基于数据两方垂直分布的多维关联规则挖掘算法 被引量:6

AN ALGORITHM OF MULTIDIMENSIONAL ASSOCIATION RULES MINING BASED ON DATA VERTICALLY DISTRIBUTED IN TWO PARTS
在线阅读 下载PDF
导出
摘要 对垂直分布于不同站点的数据进行联合关联规则挖掘是一个重要的研究方向,然而已有的算法挖掘得到的都是全局单维关联规则,不能处理多维数据集并得到全局多维关联规则。针对此问题提出一种数据两方垂直分布条件下的多维关联规则挖掘算法TDDM(Two Part Vertically Distributed Data Mining),该算法结合数据立方体技术,直接在垂直分布于两方的数据上进行挖掘,得到多维关联规则。理论分析和实验结果表明,该算法可以有效挖掘数据两方垂直分布条件下的多维关联规则。 It is an important research direction that for the data vertically distributed in different parts the joint association rules mining is conducted. However what gained from the existing algorithms are all the global association rules in single dimension, and they cannot deal with the multidimensional data and get multidimensional global association rules. To solve this problem, we propose a new algorithm TDDM (two-part vertically distributed data mining), it is a multidimensional association rules mining algorithm under the condition of data distributed vertically on two parts. Combining the technology of data cube, the algorithm directly mine the data distributed vertically on two parts and obtains the multidimensional association rules. Theoretical analysis and experimental results show that the TDDM can effectively mine the multidimensional association rules under the condition of data vertically distributed on two parts.
出处 《计算机应用与软件》 CSCD 北大核心 2014年第1期18-21,80,共5页 Computer Applications and Software
基金 河北省自然科学基金青年基金项目(G2011203195) 河北省社会科学发展研究课题青年课题(201204040)
关键词 数据挖掘 数据两方垂直分布 数据立方体 多维关联规则 频繁谓词集 Data mining Data vertically distributed on two parts Data cube Multidimensional association rules Frequentpredicate sets
  • 相关文献

参考文献13

  • 1Erickson J. Database Technologies:Concepts,Methodologies,Tools,and Applications[M].Hershey:IGI Global,2009.
  • 2Skillicorn D B,Mcconnell S M. Distributed prediction from vertically partitioned data[J].{H}JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING,2008,(01):16-36.
  • 3Agrawal R,Shafer J C. Parallel mining of association rules[J].Knowl-edge and Data Engineering,1996,(06):962-969.
  • 4Cheung D W,Han J,Ng W T. A fast distributed algorithm for mining association rules[A].{H}IEEE,1996.31-42.
  • 5Vaidya J,Clifton C. Privacy preserving association rule mining in verti-cally partitioned data[A].{H}New York:ACM Press,2002.639-644.
  • 6黄毅群,卢正鼎,胡和平,李瑞轩.分布式环境下保持隐私的关联规则挖掘算法[J].计算机工程,2006,32(13):12-14. 被引量:7
  • 7Agrawal R,Imielinski T,Swami A. Mining association rules between sets of items in large databases[A].1993.207-216.
  • 8Gray J,Chaudhuri S. Data Cube:A Relational Aggregation Oper-ator Generalizing Group-By,Cross-Tab,and Sub-Totals[J].Data Min-ing and Knowledge Discovery,1997,(01):29-53.
  • 9Schlimmer J. Mushroom dataset[DB/OL].http://archive.ics.uci.edu/ml/machine-learning-databases/mushroom/agar-icus-lepiota.data,2012.
  • 10王家胜,牟肖光.读者借阅多维关联规则挖掘模型的建立与分析[J].计算机应用,2011,31(11):3084-3086. 被引量:12

二级参考文献23

  • 1钟勇,秦小麟,包磊.一种基于多维集的关联模式挖掘算法[J].计算机研究与发展,2006,43(12):2117-2123. 被引量:8
  • 2刘以安,羊斌.关联规则挖掘中对Apriori算法的一种改进研究[J].计算机应用,2007,27(2):418-420. 被引量:54
  • 3HanJiawei KamberM.数据挖掘-概念与技术[M].北京:高等教育出版社,2001..
  • 4AGRAWAL R, IMIELINSKI T, SWAMI A. Mining association rules between sets of items in large databases [ C]/! Proceedings of the ACM SIGMOD Conference on Management of Data. New York: ACM Press, 1993:207 -216.
  • 5HAN J, PEI J, YN Y. Mining frequent patterns without candidate gen- eration[ C]// Proceedings of the 2000 ACM SIGMOD International Con- ference on Management of Data. Dallas: ACM Press, 2000:1 - 12.
  • 6Han J,Proc 2000 ACM-SIGMOD Intl Conf on Management of Data,2000年
  • 7Han J,Concepts and Techniques,2000年,225页
  • 8Kamber M,Proc 1997 Conf Knowledge Discovery and Data Mining,1997年,207页
  • 9Park J S,Proc 1995 ACMSIGMOD Int'l Conf on Management of Data,1995年,175页
  • 10Fu Y,Proc 1st Intl Workshop Integration of Knowledge Discovery with Deductive and Object-Oriented Databas,1995年,39页

共引文献48

同被引文献62

引证文献6

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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