作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2010, Vol. 36 ›› Issue (19): 87-89. doi: 10.3969/j.issn.1000-3428.2010.19.030

• 软件技术与数据库 • 上一篇    下一篇

一种交替搜索空间拓扑关联的挖掘算法

方 刚,应 宏,熊 江,吴元斌   

  1. (重庆三峡学院数学与计算机科学学院,重庆 404000)
  • 出版日期:2010-10-05 发布日期:2010-09-27
  • 作者简介:方 刚(1978-),男,讲师、硕士,主研方向:数据挖掘,数据库,GIS;应 宏,教授;熊 江、吴元斌,副教授
  • 基金资助:

    重庆教委科技基金资助项目(KJ081109, KJ091108);重庆三峡学院科研基金资助项目(10QN-22)

Mining Algorithm of Alternately Search Spatial Topology Association

FANG Gang, YING Hong, XIONG Jiang, WU Yuan-bin   

  1. (College of Math and Computer Science, Chongqing Three Gorges University, Chongqing 404000, China)
  • Online:2010-10-05 Published:2010-09-27

摘要:

针对现有挖掘算法不能有效提取空间拓扑关联的问题,提出一种交替搜索空间拓扑关联的挖掘算法,适合在海量空间数据中挖掘空间拓扑关联规则。该算法从候选数字区间的两端,用数字递增和递减2种方式产生候选频繁项,实现交替搜索空间拓扑关联规则。在计算支持数时用数字特征减少被扫描的事务数,达到提高挖掘效率的目的。实验结果表明,在空间数据中挖掘空间拓扑关联规则时,该算法比现有算法更快速、有效。

关键词: 空间数据挖掘, 交替搜索, 拓扑关联规则, 数字递增, 数字递减

Abstract:

Aiming at the problem of presented algorithms inefficient extract spatial topology association, this paper proposes a mining algorithm of alternately search spatial topology association, which is suitable for mining spatial topology association rules in large data. From two endpoints of candidate digit interval, the algorithm uses two methods of generating candidate frequent itemsets in digit ascending and digit descending, in order to alternately search spatial topology association rules. The algorithm also uses digit feature to reduce the number of scanned transaction when computing support of itemsets, mining efficiency is improved. Experimental result shows that the algorithm is faster and more efficient than presented algorithms when mining spatial topology association rules in spatial data.

Key words: spatial data mining, alternately search, topology association rules, digit ascending, digit descending

中图分类号: