首页 | 本学科首页   官方微博 | 高级检索  
     


Mining multiple-level spatial association rules for objects with a broad boundary
Authors:Eliseo Clementini  Paolino Di Felice  Krzysztof Koperski  
Affiliation:

a Department of Electrical Engineering, University of L'Aquila, 67040 Poggio di Roio, L'Aquila, Italy

b Mathsoft, Inc., 1700 Westlake Ave. N., Suite 500, Seattle, WA 98109-3044, USA

Abstract:Spatial data mining, i.e., mining knowledge from large amounts of spatial data, is a demanding field since huge amounts of spatial data have been collected in various applications, ranging from remote sensing to geographical information systems (GIS), computer cartography, environmental assessment and planning. The collected data far exceeds people's ability to analyze it. Thus, new and efficient methods are needed to discover knowledge from large spatial databases. Most of the spatial data mining methods do not take into account the uncertainty of spatial information. In our work we use objects with broad boundaries, the concept that absorbs all the uncertainty by which spatial data is commonly affected and allows computations in the presence of uncertainty without rough simplifications of the reality. The topological relations between objects with a broad boundary can be organized into a three-level concept hierarchy. We developed and implemented a method for an efficient determination of such topological relations. Based on the hierarchy of topological relations we present a method for mining spatial association rules for objects with uncertainty. The progressive refinement approach is used for the optimization of the mining process.
Keywords:Association rule  Data mining  Spatial database  Topological relation  Uncertainty
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号