Basic GAM/K algorithm: Part 2

• initialize a raster map grid of 1000 by 1000

• read circle_X, circle_Y, circle_RADIUS

• compute “excess” (observed-expected cases)

• apply Epanechnikov kernel to create density estimated using circle_RADIUS as bandwidth

• surface summed over raster over map grid

• repeat for all “significant” circles

• map surface

• apply Cluster detector or eye-ball!

Previous slide

Next slide

Back to first slide

View graphic version