The whole process is summarized in Algorithm 1.
due to the huge number of operations for finding nearest concepts, we use K-D Tree 8 to store concept vectors, which greatly improves the time efficiency.