Back to search

Hosted by Utah State University Libraries

Optimal Candidate Generation in Spatial Co-Location Mining

Abstract

dc:description.abstract

Existing spatial co-location algorithms based on levels suffer from generating extra, nonclique candidate instances. Thus, they require cliqueness checking at every level. In this thesis, a novel, spatial co-location mining algorithm that automatically generates co-located spatial features without generating any nonclique candidates at any level is proposed. Subsequently, this algorithm generates fewer candidates than other existing level-wise, co-location algorithms without losing any pertinent information. The benefits of this algorithm have been clearly observed at early stages in the mining process.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Computer Science
Grantor dc:publisher
Hosted by Utah State University Libraries

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Lin, Zhongshan
Contributors dc:contributor
  • SeungJin Lim
  • Stephen Allan
  • Curtis Dyreson

Subjects

dc:subject × 5

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Utah State University
Base URL
digitalcommons.usu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Lin, Zhongshan. Optimal Candidate Generation in Spatial Co-Location Mining. Thesis thesis, Hosted by Utah State University Libraries, https://digitalcommons.usu.edu/etd/377