期刊文献+

基于概念格的空间关联规则挖掘优化 被引量:4

Amelioration of Spatial Association Rule Mining Based on Concept Lattice
下载PDF
导出
摘要 关联规则挖掘会产生大量的项集和规则,其中只有少部分是用户感兴趣和有价值的,其他大部分是冗余的或已知的。在已有的空间关联规则挖掘研究中,用户对数据库中存在的强制约束缺少考虑。本文分析了空间数据库中的已知空间依赖,发现已有的Apriori算法和闭频繁项集挖掘难以消除该空间依赖,为此提出了基于概念格方法的已知空间依赖剔除策略,包括概念格中每个闭频繁节点的产生子获得方法和利用概念格产生子实现最优频繁地理模式挖掘的方法,最后通过实验验证了概念格产生子方法的有效性和优越性。 Association rule mining could bring a lot of itemsets and rules,only parts of them would attract user's interesting and valuable.In the existing studies of spatial association rule mining,researchers do not take the compellent restriction concealed in database into consideration.After introducing the existing compellent restriction,That Apriori and Colse Set mining algorithms can't guarantee to eliminate known restriction was pointed out in this paper.Then the relevant concepts of Concept Lattice as well as its generator were analyzed.And beyond the analysis,a way to eliminate known spatial restriction with Concept Lattice were proposed,including the method of generated factors in closed frequent itemsets and the most optimized frequent mining methods by using generator of concept lattice.Finally,an experimentation was taken to validate the validity of the proposed way.
出处 《测绘科学技术学报》 CSCD 北大核心 2013年第3期304-307,共4页 Journal of Geomatics Science and Technology
基金 国家自然科学基金项目(40871183 41140012 41271392)
关键词 空间依赖 概念格 产生子 关联规则挖掘 闭频繁项集 spatial restriction Concept Lattice generated factors association rule mining closed frequent itemset
  • 相关文献

参考文献7

  • 1陈虎,李丽,李宏伟,马雷雷.本体辅助的约束空间关联规则挖掘方法[J].测绘科学技术学报,2011,28(6):458-462. 被引量:3
  • 2BOGORNY V,KUIJPERS B, ALVARES L O. Reducing Unin- teresting Spatial Association Rules in Geographic Databases U- sing Background Knowledge: A Summary of Results [ J ]. Int J Geogr Inf Sci, 2008,22 (4) : 361-386.
  • 3PEI J, HAN J, MAO R. CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets[ C]//Pmce.edings of the ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery.USA, New York : ACM Press,2000:21-30.
  • 4ZAKI M, CHING JUI H. CHARM:An Efficient Algorithm for Closed Itemset Mining [ C ]//Proceedings of the Second SIAM International Conference on Data Mining. USA, Philadelphia Press, 2002 : 457-473.
  • 5方刚.基于空间布局约束的拓扑关联规则挖掘[J].计算机工程,2011,37(18):38-40. 被引量:1
  • 6ZAKI M J, OGIHARA M. Theoretical Foundations of Associa- tion Rules[ C ]//3rd SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery. USA, New York : ACM Press ,2002 : 1-8.
  • 7PASQUIER N, BASTIDE Y, TAOUIL R, et al. Discovering Fre- quent Closed Itemsets for Association Rules [ C ] ,//Proceedings of the Seventh International Conference on Database Theory. Berlin : Springer, 1999 : 398-416.

二级参考文献15

共引文献2

同被引文献41

引证文献4

二级引证文献21

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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