Extending Data Mining for Spatial Applications: A Case Study in Predicting Nest Locations

Loading...
Thumbnail Image

View/Download File

Persistent link to this item

Statistics
View Statistics

Journal Title

Journal ISSN

Volume Title

Title

Extending Data Mining for Spatial Applications: A Case Study in Predicting Nest Locations

Published Date

2000-04-18

Publisher

Type

Report

Abstract

Spatial data mining is a process to discover interesting and potentially useful spatial patterns embedded in spatial databases. Efficient tools for extracting information from spatial data sets can be of importance to organizations which own, generate and manage large geo-spatial data sets. The current approach towards solving spatial data mining problems is to use classical data mining tools after "materializing" spatial relationships and assuming independence between different data points. However, classical data mining methods often perform poorly on spatial data sets which have high spatial auto-correlation. In this paper we will review spatial statistical techniques which can effectively model the notion of spatial-autocorrelation and apply it to the problem of predicting bird nest locations in a marshland.

Keywords

Description

Related to

Replaces

License

Series/Report Number

Technical Report; 00-026

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Other identifiers

Suggested citation

Chawla, Sanjay; Shekhar, Shashi; WuLi, Wei; Ozesmi, Uygar. (2000). Extending Data Mining for Spatial Applications: A Case Study in Predicting Nest Locations. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215414.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.