Spatial data clustering with boundary detection

To deal with various types of data from diverse areas, where the amount of data is still increasing dramatically, data mining has become one of the fastest growing fields in computer industry in last decade. Data mining aims at discovery of knowledge implicitly stored in information repositories. Am...

Full description

Saved in:
Bibliographic Details
Main Author: Liu, Dong Quan
Other Authors: Olga Sourina
Format: Theses and Dissertations
Language:English
Published: 2010
Subjects:
Online Access:https://hdl.handle.net/10356/41852
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-41852
record_format dspace
spelling sg-ntu-dr.10356-418522023-07-04T17:36:38Z Spatial data clustering with boundary detection Liu, Dong Quan Olga Sourina School of Electrical and Electronic Engineering DRNTU::Engineering::Electrical and electronic engineering::Nanoelectronics To deal with various types of data from diverse areas, where the amount of data is still increasing dramatically, data mining has become one of the fastest growing fields in computer industry in last decade. Data mining aims at discovery of knowledge implicitly stored in information repositories. Among all data mining tasks, clustering is an approach to distinguish different groups of data (clusters) without given class labels. It is also named unsupervised learning in artificial intelligence (AI) research field. In this study, we focus on clustering methods for analyzing spatial data, especially on low dimensional data. Applications in large spatial databases, multimedia, point-based graphics, etc brought new requirements for spatial clustering such as automatic discovering of arbitrary shaped and/or non-homogeneous clusters, detecting various types of outliers and building cluster boundaries, etc. To fulfill such new requirements generated from different spatial applications we proposed and implemented three novel algorithms. Our research is concentrated on 2D algorithms implementation. In the study when the connectivity between data points is the most concern, we propose novel clustering algorithms based on specially constructed adaptive functions. The adaptive function-based clustering method applies functions as influence functions to simulate a relationship between data points in data set. Different features of the whole data set can be described by the field function which is built by the sum of influence functions of each data point. The clustering procedure is executed according to threshold value of the field function. The introduced adaptive parameters of influence functions are employed to localize the field function based on both local and global data distribution. DOCTOR OF PHILOSOPHY (EEE) 2010-08-18T08:00:28Z 2010-08-18T08:00:28Z 2008 2008 Thesis Liu, D. Q. (2008). Spatial data clustering with boundary detection. Doctoral thesis, Nanyang Technological University, Singapore. https://hdl.handle.net/10356/41852 10.32657/10356/41852 en 245 p. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic DRNTU::Engineering::Electrical and electronic engineering::Nanoelectronics
spellingShingle DRNTU::Engineering::Electrical and electronic engineering::Nanoelectronics
Liu, Dong Quan
Spatial data clustering with boundary detection
description To deal with various types of data from diverse areas, where the amount of data is still increasing dramatically, data mining has become one of the fastest growing fields in computer industry in last decade. Data mining aims at discovery of knowledge implicitly stored in information repositories. Among all data mining tasks, clustering is an approach to distinguish different groups of data (clusters) without given class labels. It is also named unsupervised learning in artificial intelligence (AI) research field. In this study, we focus on clustering methods for analyzing spatial data, especially on low dimensional data. Applications in large spatial databases, multimedia, point-based graphics, etc brought new requirements for spatial clustering such as automatic discovering of arbitrary shaped and/or non-homogeneous clusters, detecting various types of outliers and building cluster boundaries, etc. To fulfill such new requirements generated from different spatial applications we proposed and implemented three novel algorithms. Our research is concentrated on 2D algorithms implementation. In the study when the connectivity between data points is the most concern, we propose novel clustering algorithms based on specially constructed adaptive functions. The adaptive function-based clustering method applies functions as influence functions to simulate a relationship between data points in data set. Different features of the whole data set can be described by the field function which is built by the sum of influence functions of each data point. The clustering procedure is executed according to threshold value of the field function. The introduced adaptive parameters of influence functions are employed to localize the field function based on both local and global data distribution.
author2 Olga Sourina
author_facet Olga Sourina
Liu, Dong Quan
format Theses and Dissertations
author Liu, Dong Quan
author_sort Liu, Dong Quan
title Spatial data clustering with boundary detection
title_short Spatial data clustering with boundary detection
title_full Spatial data clustering with boundary detection
title_fullStr Spatial data clustering with boundary detection
title_full_unstemmed Spatial data clustering with boundary detection
title_sort spatial data clustering with boundary detection
publishDate 2010
url https://hdl.handle.net/10356/41852
_version_ 1772828418701787136