Complex spatial relationships

Robert Munro, Sanjay Chawla, Pei Sun

Research output: Chapter in Book/Report/Conference proceedingConference contribution

24 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - IEEE International Conference on Data Mining, ICDM
Pages227-234
Number of pages8
Publication statusPublished - 2003
Externally publishedYes
Event3rd IEEE International Conference on Data Mining, ICDM '03 - Melbourne, FL
Duration: 19 Nov 200322 Nov 2003

Other

Other3rd IEEE International Conference on Data Mining, ICDM '03
CityMelbourne, FL
Period19/11/0322/11/03

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Munro, R., Chawla, S., & Sun, P. (2003). Complex spatial relationships. In Proceedings - IEEE International Conference on Data Mining, ICDM (pp. 227-234)

Complex spatial relationships. / Munro, Robert; Chawla, Sanjay; Sun, Pei.

Proceedings - IEEE International Conference on Data Mining, ICDM. 2003. p. 227-234.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Munro, R, Chawla, S & Sun, P 2003, Complex spatial relationships. in Proceedings - IEEE International Conference on Data Mining, ICDM. pp. 227-234, 3rd IEEE International Conference on Data Mining, ICDM '03, Melbourne, FL, 19/11/03.
Munro R, Chawla S, Sun P. Complex spatial relationships. In Proceedings - IEEE International Conference on Data Mining, ICDM. 2003. p. 227-234
Munro, Robert ; Chawla, Sanjay ; Sun, Pei. / Complex spatial relationships. Proceedings - IEEE International Conference on Data Mining, ICDM. 2003. pp. 227-234
@inproceedings{ebafdc187c3748b58d846ae7920e79ca,
title = "Complex spatial relationships",
abstract = "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.",
author = "Robert Munro and Sanjay Chawla and Pei Sun",
year = "2003",
language = "English",
isbn = "0769519784",
pages = "227--234",
booktitle = "Proceedings - IEEE International Conference on Data Mining, ICDM",

}

TY - GEN

T1 - Complex spatial relationships

AU - Munro, Robert

AU - Chawla, Sanjay

AU - Sun, Pei

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=18844461110&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=18844461110&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:18844461110

SN - 0769519784

SN - 9780769519784

SP - 227

EP - 234

BT - Proceedings - IEEE International Conference on Data Mining, ICDM

ER -