Date of Award

9-1-2003

Document Type

Thesis

Degree Name

Master of Science (MS)

Department

Computer Science

First Advisor

Dr. Zhengxin Chen

Abstract

Spatial data mining is a process of extraction of implicit information, such as weather patterns around latitudes, spatial features in a region, et., with a goal of knowledge discovery. The existing spatial data mining methods typically identify a specific datamining task for knowledge discovery. An example of a mining task may involve finding weather patterns in the northwestern region of U.S.A. To find such weather patterns one could employ an existing data structure, such as a B+ tree followed by the analysis of the mined weather data for knowledge discovery. This is a typical top-down approach of identifying a task, selecting a data structure, followed queries and analysis. This thesis provides a method and a simulation for mining spatial rules for the purpose of knowledge discovery. The thesis takes a bottom up approach: it employs Branch Grafted R-tree for the storage and retrieval of spatial data, followed by identifying tasks, followed by spatial queries and analysis. The Branch Grafted R-tree is an efficient data structure more suitable for efficient retrieval of data. This type of bottom up approach is unique and takes the advantage of the previous work carried out using Branch Grafted R-tree.

Comments

A Thesis Presented to the Department of Computer Science and the Faculty of the Graduate College University of Nebraska In Partial Fulfillment of the Requirements for the Degree Master of Science University of Nebraska at Omaha. Copyright 2003 Priyanka Dubey

Download

COinS