INNER CODE UNIT · Python

B2

lzz19980125/awesome-time-series-segmentation-papers · DASSA-master/dassa.py:115

        B2 = Y[item][End-1]
        if (E1 == B2):
            Neigbours.append(item)
    return Neigbours


def get_distance(node1, node2, P_Xtilde_Y):
    V1 = node1
    V2 = node2
    if len(P_Xtilde_Y) > 1:
        a = P_Xtilde_Y[:, V1]
        b = P_Xtilde_Y[:, V2]
    else:
        a = P_Xtilde_Y[0][V1]
        b = P_Xtilde_Y[0][V2]
    dist = 0
    for i in range(len(a)):
        dist = (a[i] - b[i])**2

View source record →