G is composed of nodes (v) which correspond to possible intermediate steps in the process of completing the specified task, and edges (e) which connect nodes.
we can improve the clustering performance by using a distance metric learning algorithm to consider the correlation between features.