Algorithm 3.
1: | Σ1, Σ2 = two sets of activity curves |
2: | //Return a change score S |
3: | C1 = Aggregate Activity Curves(Σ1) |
4: | C2 = Aggregate Activity Curves(Σ2) |
5: | Γ = Align Curves(C1, C2) |
6: | for all alignment pairs (u, υ) in Γ do : |
7: | Calculate SDKL(D1,u‖D2,υ) between activity distribution D1,u ∈ C1 and D2,υ ∈ C2. |
8: | Perform significance testing of estimated distance by querying Dîst. |
9: | if change is significant : |
10: | S = S + 1 |
11: | end for |
12: | return S |