Finding strong, common and discriminating characteristics of clusters from thematic maps
The goal of the thesis is to discover knowledge on large spatial databases. Specifically, it discusses the problem of extracting patterns and characteristics of clusters from thematic maps. For instance, a characteristic of an expensive housing cluster may be that the average household income is...
Main Author: | |
---|---|
Format: | Others |
Language: | English |
Published: |
2009
|
Online Access: | http://hdl.handle.net/2429/4566 |
id |
ndltd-UBC-oai-circle.library.ubc.ca-2429-4566 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-UBC-oai-circle.library.ubc.ca-2429-45662018-01-05T17:32:03Z Finding strong, common and discriminating characteristics of clusters from thematic maps Yu, YiQing The goal of the thesis is to discover knowledge on large spatial databases. Specifically, it discusses the problem of extracting patterns and characteristics of clusters from thematic maps. For instance, a characteristic of an expensive housing cluster may be that the average household income is over 100,000 dollars. Three key issues are addressed in this thesis. The first issue is how to measure the interest/utility values of characteristics. In order to accommodate different kinds of thematic maps, two measures are proposed and analysed: one based on entropy, and the other on standard deviation. Both measures satisfy all the desirable properties, and work effectively in practice. The second issue is how to extract patterns from multiple clusters. Two pattern extraction operations are defined. The common() operation is able to find the common characteristics among multiple clusters. The different() operations is capable of discovering the characteristics which distinguish one cluster from another. The third issue is how to compute characteristics utility measures and pattern extraction operations efficiently. Four different methods are proposed and evaluated for the computation of utility measures. Complexity and experimental results indicates that a technique based on isothetic rectangle intersections is the most efficient, outperforming all the other techniques such as a technique based on R-tree technique. For the problem of how to extract patterns of multiple clusters efficiently. Two different methods for pattern extraction are evaluated. The technique based on isothetic rectangle intersections again outperforms the technique based on R-tree, and can extract patterns from hundreds of thematic maps in seconds of CPU time. Science, Faculty of Computer Science, Department of Graduate 2009-02-14T01:08:18Z 2009-02-14T01:08:18Z 1996 1996-11 Text Thesis/Dissertation http://hdl.handle.net/2429/4566 eng For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use. 3084039 bytes application/pdf |
collection |
NDLTD |
language |
English |
format |
Others
|
sources |
NDLTD |
description |
The goal of the thesis is to discover knowledge on large spatial databases. Specifically, it
discusses the problem of extracting patterns and characteristics of clusters from thematic
maps. For instance, a characteristic of an expensive housing cluster may be that the average
household income is over 100,000 dollars. Three key issues are addressed in this thesis. The
first issue is how to measure the interest/utility values of characteristics. In order to
accommodate different kinds of thematic maps, two measures are proposed and analysed: one
based on entropy, and the other on standard deviation. Both measures satisfy all the desirable
properties, and work effectively in practice. The second issue is how to extract patterns from
multiple clusters. Two pattern extraction operations are defined. The common() operation is
able to find the common characteristics among multiple clusters. The different() operations is
capable of discovering the characteristics which distinguish one cluster from another. The third
issue is how to compute characteristics utility measures and pattern extraction operations
efficiently. Four different methods are proposed and evaluated for the computation of utility
measures. Complexity and experimental results indicates that a technique based on isothetic
rectangle intersections is the most efficient, outperforming all the other techniques such as a
technique based on R-tree technique. For the problem of how to extract patterns of multiple
clusters efficiently. Two different methods for pattern extraction are evaluated. The technique
based on isothetic rectangle intersections again outperforms the technique based on R-tree, and
can extract patterns from hundreds of thematic maps in seconds of CPU time. === Science, Faculty of === Computer Science, Department of === Graduate |
author |
Yu, YiQing |
spellingShingle |
Yu, YiQing Finding strong, common and discriminating characteristics of clusters from thematic maps |
author_facet |
Yu, YiQing |
author_sort |
Yu, YiQing |
title |
Finding strong, common and discriminating characteristics of clusters from thematic maps |
title_short |
Finding strong, common and discriminating characteristics of clusters from thematic maps |
title_full |
Finding strong, common and discriminating characteristics of clusters from thematic maps |
title_fullStr |
Finding strong, common and discriminating characteristics of clusters from thematic maps |
title_full_unstemmed |
Finding strong, common and discriminating characteristics of clusters from thematic maps |
title_sort |
finding strong, common and discriminating characteristics of clusters from thematic maps |
publishDate |
2009 |
url |
http://hdl.handle.net/2429/4566 |
work_keys_str_mv |
AT yuyiqing findingstrongcommonanddiscriminatingcharacteristicsofclustersfromthematicmaps |
_version_ |
1718586844332949504 |