Before revision:  Specifically, we utilize a k-nearest neighbor graph (kNNG) based on the similarity of node attributes to replace the GNN's computation graph defined by the neighborhood-based aggregation of each node.
After revision:  Specifically, we start by constructing a k-nearest neighbor graph (kNNG) based on the similarity of node attributes to replace the GNN's computation graph defined by the neighborhood-based aggregation of each node.