INNER CODE UNIT · Python

Finding_Neigbours

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

def Finding_Neigbours(YID, Y, node):
    Neigbours = []
    # YID.remove(node)
    End = len(Y[0]) -1
    E1 = Y[node][End]
    for item in YID:
        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]

View source record →