Geospatial Cluster Tessellation through the Complete Order-k Voronoi diagrams

Ickjai Lee; Reece Pershouse; Kyungmi Lee

doi:10.1007/978-3-540-74788-8_20

Geospatial Cluster Tessellation through the Complete Order-k Voronoi diagrams

Ickjai Lee, Reece Pershouse, Kyungmi Lee

Research output: Book chapter/Published conference paper › Conference paper › peer-review

3 Citations (Scopus)

Abstract

In this paper, we propose a postclustering process that robustly computes cluster regions at different levels of granularity through the complete Order-k Voronoi diagrams. The robustness and flexibility of the proposed method overcome the application-dependency and rigidity of traditional approaches. The proposed cluster tessellation method robustly models monotonic and nonmonotonic cluster growth, and provides fuzzy membership in order to represent indeterminacy of cluster regions. It enables the user to explore cluster structures hidden in a dataset in various scenarios and supports for 'what-if' and 'what-happen' analysis. Tessellated clusters can be effectively used for cluster reasoning and concept learning.

Original language	English
Title of host publication	COSIT
Subtitle of host publication	Conference on Spatial Information Theory 2007
Editors	B. Kuipers
Place of Publication	Berlin, German
Publisher	Springer-Verlag London Ltd.
Pages	321-336
Number of pages	16
Volume	4736/2007
DOIs	https://doi.org/10.1007/978-3-540-74788-8_20
Publication status	Published - 2007
Event	Conference on Spatial Information Theory - Melbourne, Australia, Australia Duration: 19 Sept 2007 → 23 Sept 2007

Conference

Conference	Conference on Spatial Information Theory
Country/Territory	Australia
Period	19/09/07 → 23/09/07

Access to Document

10.1007/978-3-540-74788-8_20

Cite this

@inproceedings{e6063c93f42d4cc18505624d215ffffb,

title = "Geospatial Cluster Tessellation through the Complete Order-k Voronoi diagrams",

abstract = "In this paper, we propose a postclustering process that robustly computes cluster regions at different levels of granularity through the complete Order-k Voronoi diagrams. The robustness and flexibility of the proposed method overcome the application-dependency and rigidity of traditional approaches. The proposed cluster tessellation method robustly models monotonic and nonmonotonic cluster growth, and provides fuzzy membership in order to represent indeterminacy of cluster regions. It enables the user to explore cluster structures hidden in a dataset in various scenarios and supports for 'what-if' and 'what-happen' analysis. Tessellated clusters can be effectively used for cluster reasoning and concept learning.",

keywords = "Cluster tessellation, Complete order-k Voronoi diagram",

author = "Ickjai Lee and Reece Pershouse and Kyungmi Lee",

note = "Imported on 03 May 2017 - DigiTool details were: publisher = Berlin, German: Springer-Verlag, 2007. editor/s (773b) = Winter, S , Duckham, M , Kulik, L , and Kuipers, B ; Event dates (773o) = 19-23 Sept 2007; Parent title (773t) = Conference on Spatial Information Theory. ISSNs: 0302-9743; ; Conference on Spatial Information Theory ; Conference date: 19-09-2007 Through 23-09-2007",

year = "2007",

doi = "10.1007/978-3-540-74788-8_20",

language = "English",

volume = "4736/2007",

pages = "321--336",

editor = "B. Kuipers",

booktitle = "COSIT",

publisher = "Springer-Verlag London Ltd.",

address = "Germany",

}

Lee, I, Pershouse, R & Lee, K 2007, Geospatial Cluster Tessellation through the Complete Order-k Voronoi diagrams. in B Kuipers (ed.), COSIT: Conference on Spatial Information Theory 2007. vol. 4736/2007, Springer-Verlag London Ltd., Berlin, German, pp. 321-336, Conference on Spatial Information Theory, Australia, 19/09/07. https://doi.org/10.1007/978-3-540-74788-8_20

TY - GEN

T1 - Geospatial Cluster Tessellation through the Complete Order-k Voronoi diagrams

AU - Lee, Ickjai

AU - Pershouse, Reece

AU - Lee, Kyungmi

N1 - Imported on 03 May 2017 - DigiTool details were: publisher = Berlin, German: Springer-Verlag, 2007. editor/s (773b) = Winter, S , Duckham, M , Kulik, L , and Kuipers, B ; Event dates (773o) = 19-23 Sept 2007; Parent title (773t) = Conference on Spatial Information Theory. ISSNs: 0302-9743;

PY - 2007

Y1 - 2007

N2 - In this paper, we propose a postclustering process that robustly computes cluster regions at different levels of granularity through the complete Order-k Voronoi diagrams. The robustness and flexibility of the proposed method overcome the application-dependency and rigidity of traditional approaches. The proposed cluster tessellation method robustly models monotonic and nonmonotonic cluster growth, and provides fuzzy membership in order to represent indeterminacy of cluster regions. It enables the user to explore cluster structures hidden in a dataset in various scenarios and supports for 'what-if' and 'what-happen' analysis. Tessellated clusters can be effectively used for cluster reasoning and concept learning.

AB - In this paper, we propose a postclustering process that robustly computes cluster regions at different levels of granularity through the complete Order-k Voronoi diagrams. The robustness and flexibility of the proposed method overcome the application-dependency and rigidity of traditional approaches. The proposed cluster tessellation method robustly models monotonic and nonmonotonic cluster growth, and provides fuzzy membership in order to represent indeterminacy of cluster regions. It enables the user to explore cluster structures hidden in a dataset in various scenarios and supports for 'what-if' and 'what-happen' analysis. Tessellated clusters can be effectively used for cluster reasoning and concept learning.

KW - Cluster tessellation

KW - Complete order-k Voronoi diagram

U2 - 10.1007/978-3-540-74788-8_20

DO - 10.1007/978-3-540-74788-8_20

M3 - Conference paper

VL - 4736/2007

SP - 321

EP - 336

BT - COSIT

A2 - Kuipers, B.

PB - Springer-Verlag London Ltd.

CY - Berlin, German

T2 - Conference on Spatial Information Theory

Y2 - 19 September 2007 through 23 September 2007

ER -

Geospatial Cluster Tessellation through the Complete Order-k Voronoi diagrams

Abstract

Conference

Access to Document

Fingerprint

Cite this