期刊文献+

基于多最小支持度的空间关联规则发现 被引量:7

Discovery of spatial association rules based on multiple minimum supports
在线阅读 下载PDF
导出
摘要 空间关联规则挖掘可应用于发现空间数据库中大量空间谓词与非空间谓词之间的特定空间关系。论文针对区县道路交通数据提出了一种基于多最小支持度的空间关联规则挖掘算法,并给出了在GIS中进行空间关联规则挖掘的一般方法和流程。该挖掘算法可以从城市道路地理信息数据库中发现用户感兴趣的空间关联规则,经实际应用于城市道路规划管理系统,证明该算法是有效、可行的。 Mining spatial association rules can be predicate and nonspatial predicate in the spatial database. used to discover the special spatial relationship between spatial A multiple minimum supports-based algorithm for the discovery of spatial association rules was proposed, aiming at the read information of downtown area, and the general method of mining spatial association rules in GIS was presented. The algorithm can find the spatial association rules which users are interested in from city read geographical information database. Through the application in the city road planning and management system, the algorithm is proved to be effective and viable.
机构地区 同济大学CAD中心
出处 《计算机应用》 CSCD 北大核心 2005年第9期2171-2174,共4页 journal of Computer Applications
基金 上海市科学技术委员会科研计划项目(042112060)
关键词 空间关联规则 GIS 空间聚类 多最小支持度 最大频繁项目集 spatial association rules GIS spatial clustering multiple minimum supports maximum frequent itemset
  • 相关文献

参考文献6

二级参考文献20

  • 1Yang Bingru(School of information Engineering,University of Science and Technology of BeiJing,100083, P. R. China)Xiong Fanlun(The institute of Intelligent Machine, Academic Sinica,Hefei 230031, P. R. China).KD(D&K) and Double-Bases Cooperating Mechanism[J].Journal of Systems Engineering and Electronics,1999,10(2):48-54. 被引量:7
  • 2Liu B,Hsu W, Ma Y.Mining Association Rules with Multiple Minimum Supports.KDD-99,1999.
  • 3Nag B,Deshpande P M,Dewitt D J.Using a Knowledge Cache for Interactive Discovery of Association Rules.KDD-99,1999:244-253.
  • 4Han J,Fu Y.Discovery of Multiple-level from Large Databases.Zurich,Switzerland:In Proc. 21th VLDB Conf., 1995-09:420-431.
  • 5Agrawal R,Imielinski T,Wami A S.Mining Association Rules Between Sets of Items in Large Databases.In:Proc. of the ACM SIGMOD Conference on Management of Data,Washington, D.C.,1993-05:207-216.
  • 6G Karypis,E-H Han,V Kumar, CHAMELEON :A hierarchical clustering algorithm using dynamic modeling,COMPUTER, 1999.
  • 7E Kolatch.Clustefing Algorithms for Spatial Databases:A Survey.2001.
  • 8Kaufman,Leonard,Peter J Rousseeuw.Finding Groups in Data:An Introduction to Cluster Analysis[M].John Wiley & Sons Inc, 1990.
  • 9M Stonebraker,J Frew,K Gardels et al.The SEQUOIA 2000 storage benchmark[C]:Proc ACM SIGMOD Int Conf on Management of Data, 1993-05.
  • 10W Wang,J Yang,R Muntz.STING:A statistical information grid approach to spatial data mining[C].In:VLDB'97,Athens,Greece,1997-08.

共引文献40

同被引文献33

引证文献7

二级引证文献22

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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