Complex spatial relationships

被引：13

作者：

Munro, R ^{[1
]}

Chawla, S ^{[1
]}

Sun, P ^{[1
]}

机构：

[1] Univ Sydney, Sch Informat Technol, Sydney, NSW 2006, Australia

来源：

THIRD IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS | 2003年

关键词：

D O I：

10.1109/ICDM.2003.1250924

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This paper describes the need for mining complex relationships in spatial data. Complex relationships are defined as those involving two or more of multi-feature colocation, self-colocation, one-to-many relationships, self-exclusion and multi-feature exclusion. We demonstrate that even in the mining of simple relationships, knowledge of complex relationships is necessary to accurately calculate the significance of results. We implement a representation of spatial data such that it contains known weak-monotonic' properties, which are exploited for the efficient mining of complex relationships, and discuss the strengths and limitations of this representation.

引用

页码：227 / 234

页数：8

共 12 条

[1]

Agrawal R., 1994, P 20 INT C VER LARG, V1215, P487

[2]

[Anonymous], 1991, KNOWLEDGE DISCOVERY

[3]

BAILEY T. C., 1995, INTERACTIVE SPATIAL

[4]

Brin S, 2003, IEEE T KNOWL DATA EN, V15

[5]

HAN J, 2000, P 2000 ACM SIGMOD IN, P1, DOI DOI 10.1145/342009.335372

[6]

Huang Yan, 2003, P 18 ACM S APPL COMP

[7] Discovery of spatial association rules in geographic information databases [J].

Koperski, K ;

Han, JW .

ADVANCES IN SPATIAL DATABASES, 1995, 951 :47-66

[8]

MUNRO R, 2003, 539 U SYDN SCH INF T

[9]

Peuquet D. J., 2002, REPRESENTATIONS SPAC

[10]

SHEKHAR S, 2002, SPATIAL DATABASES TO

← 1 2 →