Skip to Main Content
Frequently Asked Questions
Submit an ETD
Global Search Box
Need Help?
Keyword Search
Participating Institutions
Advanced Search
School Logo
Files
File List
ucin1179521337.pdf (697.66 KB)
ETD Abstract Container
Abstract Header
FINDING CLUSTERS IN SPATIAL DATA
Author Info
SHENCOTTAH K.N., KALYANKUMAR
Permalink:
http://rave.ohiolink.edu/etdc/view?acc_num=ucin1179521337
Abstract Details
Year and Degree
2007, MS, University of Cincinnati, Engineering : Computer Science.
Abstract
Spatial data mining is the discovery of patterns in spatial databases. The driving factor for research in spatial data mining is the increase in collection of spatial data through business and geographical database systems. Some of the spatial data collected include remotely sensed images, geographical information with spatial attributes such as location, digital sky survey data, mobile phone usage data, and medical data. Spatial data mining takes into account spatial and non-spatial data attributes in these data. The goal of our research is to discover and merge cluster regions which contain spatial data values in a given standard deviation range. Our approach involves visualizing the data in a 2-D grid, and involves mining the data using quad-tree, a spatial data structure. Quad-tree stores the entire 2-D grid in its leaf node at level k. Cluster information such as standard deviation, mean, x-coordinate, y-coordinate, and number of nodes are calculated at k-1 level, and synthesized up the quad-tree. Based on the input standard deviation range, we discover clusters, determine adjacency of the clusters and merge interesting clusters. By increasing or decreasing the input standard deviation range, we observe that the cluster boundary changes and we discover clusters of different shapes such as rectangle, triangle, rhombus and concave. Our algorithm can be useful in identifying patterns such as increase or decrease in crime rate or spread of disease in a given region. The 2-D grid refers to the physical space, and the values in the cells refers to non-spatial attribute values such as crime, temperature etc. Spatial abstractions such as region, location etc. are a result of clustering of non-spatial attribute values.
Committee
Dr. Raj Bhatnagar (Advisor)
Pages
92 p.
Subject Headings
Computer Science
Keywords
clusters
;
Spatial data mining
;
Quad-Tree
;
Spatial clustering
Recommended Citations
Refworks
EndNote
RIS
Mendeley
Citations
SHENCOTTAH K.N., K. (2007).
FINDING CLUSTERS IN SPATIAL DATA
[Master's thesis, University of Cincinnati]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1179521337
APA Style (7th edition)
SHENCOTTAH K.N., KALYANKUMAR.
FINDING CLUSTERS IN SPATIAL DATA.
2007. University of Cincinnati, Master's thesis.
OhioLINK Electronic Theses and Dissertations Center
, http://rave.ohiolink.edu/etdc/view?acc_num=ucin1179521337.
MLA Style (8th edition)
SHENCOTTAH K.N., KALYANKUMAR. "FINDING CLUSTERS IN SPATIAL DATA." Master's thesis, University of Cincinnati, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1179521337
Chicago Manual of Style (17th edition)
Abstract Footer
Document number:
ucin1179521337
Download Count:
1,118
Copyright Info
© 2007, all rights reserved.
This open access ETD is published by University of Cincinnati and OhioLINK.