Optimal Candidate Generation in Spatial Co-Location Mining
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...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
DigitalCommons@USU
2009
|
| Subjects: | |
| Online Access: | https://digitalcommons.usu.edu/etd/377 https://digitalcommons.usu.edu/cgi/viewcontent.cgi?article=1369&context=etd |