Skip to main content
. Author manuscript; available in PMC: 2012 Oct 15.
Published in final edited form as: Stat Med. 2011 Jul 22;30(23):2854–2866. doi: 10.1002/sim.4309

Algorithm 3.

Routine BHC

input: spatiotemporal source coordinates C = {cnt |n ∈ N*, t ∈ T*}
initialize: number of clusters m = |N*| × |T*| where each cluster contains a single 4-D coordinate
cnt in C
while m > 1 do
 Merge pair of coordinates with the highest probability of the merged hypothesis (see Section 2.3.1)
end while
output: clustered coordinates in space and time A = [A1, …, AK ]