On the other hand, computing distance between n(n−1)/2 pairs of instances to construct the graph is also very expensive (Muja and Lowe, 2014).
we choose to use k-nearest neighborbased approach as it has been successfully used in other study (Steinbach et al., 2000).