期刊文献+

一种基于概率图模型的关联规则更新方法 被引量:1

An approach for updating association rules based on probabilistic graphical model
原文传递
导出
摘要 针对事务库发生变化后关联规则的更新问题,讨论了一种只对具有实用价值的关联规则更新其前件的方法.首先分析了关联规则各组件间的依赖关系及其不确定性,进而建立描述其中所蕴含不确定性知识的贝叶斯网模型(称为规则贝叶斯网),并提出了基于Gibbs采样的规则贝叶斯网近似推理算法,从而实现关联规则的更新.实验结果表明,作者提出的基于概率图模型的关联规则前件更新方法具有高效性和可行性. Aiming at the update of association rules with respect to the changes of the transaction database,in this paper,we discussed an approach for updating the former components of valuable association rules.First,we analyzed the dependency relationships and uncertainty among the components in association rules.Then,we constructed the Bayesian network(BN) model,called rule BN,to represent this uncertain knowledge.As well,we proposed an algorithm for RBN's approximate reasoning based on Gibbs sampling,so that the update of association rules can be fulfilled.Experimental results show that our proposed method for updating the antecedents of association rules is feasible efficient.
出处 《云南大学学报(自然科学版)》 CAS CSCD 北大核心 2013年第2期155-161,共7页 Journal of Yunnan University(Natural Sciences Edition)
基金 国家自然科学基金项目(61063009 61163003) 国家教育部博士点基金新教师类课题(20105301120001) 云南省中青年学术技术带头人后备人才培养项目(2012HB004) 云南省教育厅科研基金项目(2011Z015 2011Y500)
关键词 关联规则更新 不确定性 贝叶斯网 GIBBS采样 概率推理 association rule update uncertainty Bayesian network Gibbs sampling probabilistic reasoning
  • 相关文献

参考文献14

  • 1AGRAWAL R, IMIELINSKI T, SWAMI A. Mining association rules between sets of items in large database [ C ]. Proceedings of 1993 ACM Special Interest Group on Management of Data( SIGMOD 1993), 1993:207-216.
  • 2方刚,熊江,吴鸿娟,钟静.基于区间映射的约束拓扑关联规则挖掘[J].云南大学学报(自然科学版),2011,33(5):521-526. 被引量:2
  • 3LIU M,ZHANG J,WONG L. Controlling false positives in association rule mining[ C]. PVLDB ,2012 ,5 (2) :145-156.
  • 4申彦,宋顺林,朱玉全.基于磁盘表存储FP-TREE的关联规则挖掘算法[J].计算机研究与发展,2012,49(6):1313-1322. 被引量:14
  • 5CHEUNG D, HAN J, NG V. Maintenance of discovered association rules in large databases : an incremental updating technique [ C ]. Proceedings of 1996 International Conference on Data Engineering( ICDE 1996), 1996 : 106-114.
  • 6DUDEK D. RMAIN: Association rules maintenance without reruns through data[ J]. Information Sciences ,2009,179 (24) : 4 123-4 139.
  • 7朱群雄,赵春,冯磊,林晓勇.关联规则的动态维护及其在财务数据中的应用[J].清华大学学报(自然科学版),2012,52(5):694-698. 被引量:4
  • 8BRIN S, MOTWANI R, SILVERSTEIN C. Beyond market basket:Generalizing association rules to correlations [ C ]. Proceed- ings of 1997 ACM Special Interest Group on Management of Data( SIGMOD 1997), 1997:265-276.
  • 9PEARL J. Probabilistic reasoning in intelligent systems : Networks of plausible inference [ M ]. San Mateo, CA : Morgan Kauf- mann Publishers, 1988.
  • 10VEDULA V, THATAVARTI S. Binary association rule mining using bayesian network [ C ]. Proceedings of 2011 International Conference on Information and Network Technology( ICINT 2011 ) ,2011 (4) : 171-176.

二级参考文献32

  • 1易彤,徐宝文,吴方君.一种基于FP树的挖掘关联规则的增量更新算法[J].计算机学报,2004,27(5):703-710. 被引量:32
  • 2宋余庆,朱玉全,孙志挥,杨鹤标.一种基于频繁模式树的约束最大频繁项目集挖掘及其更新算法[J].计算机研究与发展,2005,42(5):777-783. 被引量:21
  • 3马荣华,何增友.从空间数据库中挖掘频繁邻近类别集的一种新算法[J].武汉大学学报(信息科学版),2007,32(2):112-114. 被引量:8
  • 4FANG Gang,XIONG Jiang. An algorithm of mining spa- tial topology association rules based on apriori [ C ]//In IEEE International Conference on Intelligent Computing and Intelligent Systems. Xiamen, China: IEEE Press, 2010 : 101-104.
  • 5TANG Xiao-bin, FANG Gang. An algorithm of mining spatial topology association rules based on complement set[ C ]//The 3rd International Conference on Comput- er and Automation Engineering. Chongqing, China. IEEE Press ,2010,3:54-57.
  • 6FANG Gang,TU Cheng-sheng. Spatial constraint topoi- ogy association rules mining based on apriori [ C ] //In the 2nd International Conference on Information Engi- neering and Computer Science. Wuhan, China: IEEE Press,2010:858-861.
  • 7Witten L H,Frank E.数据挖掘:实用机器学习技术及Java实现[M].北京:机械工业出版社,2003.
  • 8Agrawal R, Imielinski T, Swami A. Mining association rules between sets of items in large databases [C] //Proe of ACM SIGMOD Int Conf on Management of Data (SIGMOD'93). New York: ACM, 1993:207-216.
  • 9Han Jiawei, Pei Jian, Yin Yiwen. Mining frequent patterns without candidate generation [C] //Proe of the ACM SIGMOD Int Conf on Management of Data. New York: ACM, 2000 : 1-12.
  • 10Mohaminad E H, Zaiane O R. Cofi approach for mining frequent itemsets revisited [C] //Proc of ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery. New York: ACM, 2004:70-75.

共引文献17

同被引文献15

引证文献1

二级引证文献23

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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