f7274c1889e6c31ab89dc0409fa2ac92e6f01228,pyod/models/sod.py,SOD,_snn,#SOD#,118

Before Change

            for j in range(n):
                _count.append(_dist(ind[i], ind[j]))
            // get the indices of points with most shared neighbours
            temp = sorted(range(len(_count)), key=_count.__getitem__, reverse=True)
            temp.remove(i)  // remove the point of being a reference to itself
            refSet[i]=temp[:self.ref_set]
        return refSet

After Change

        for i in range(n):
            // get the previous cached result
            // the point with itself needed to maintain indices order
            _count[i:, range(i+1)] = list(_count[range(i),i]) + [self.n_neighbors]
            for j in range(i+1, n):
                _count[i,j] = _dist(ind[i], ind[j])
        return np.flip(np.argsort(_count), axis=1)[:,range(self.ref_set)]

Instances