摘要
针对现有拓扑关联规则挖掘算法不能够有效地提取长频繁约束拓扑关联规则,提出一种基于区间映射的约束拓扑关联规则挖掘算法,该算法适合挖掘带约束空间布局关系的长频繁拓扑关联规则;该算法用区间映射法的下行搜索策略产生候选频繁拓扑项目集,利用逻辑"与"运算计算拓扑关系事务的支持数.实验证明在挖掘长频繁约束拓扑项目集时,该算法比现有算法更快速更有效.
For present topology association rules mining algorithm is not able to efficient extract long frequent constraint topology association rules,this paper proposed an algorithm of constraint topology association rules mining based on interval mapping,which is suitable for mining long frequent topology association rules with constraint spatial layout relation.The algorithm uses interval mapping to generate candidate frequent topology itemsets via down search strategy,and uses logic "and" operation to compute support of topology relation transaction.The experiment indicated that the algorithm is faster and more efficient than presented algorithms when mining long frequent constraint topology itemsets.
出处
《云南大学学报(自然科学版)》
CAS
CSCD
北大核心
2011年第5期521-526,共6页
Journal of Yunnan University(Natural Sciences Edition)
基金
重庆市教委科技项目(KJ091108)
重庆三峡学院重点科研项目(11ZD-18)资助
关键词
空间数据挖掘
拓扑关联规则
约束空间布局关系
区间映射
下行搜索
spatial data mining
topology association rules
constraint spatial layout relation
interval mapping
down search