因此生成的元路径仅仅由边的类型组成，在许多需要考虑节点类型的情形下难以

Therefore, the generated meta-path is only composed of edge types, which is difficult to use in many situations where node types need to be considered. <br>In addition, in the similarity measurement of complex heterogeneous networks [38], a query-based meta path generation algorithm (QMPG) was proposed by Wang et al. to generate the required meta path candidate set. . <br>This method requires a given path length l, by searching for all qualified short element path sets with length l2 from the starting point and the end point on the query-based network mode defined by itself, and finally by merging the two short element path sets The meta-paths that can be merged to form a set of meta-paths with length l from the start point to the end point. <br>This method needs to specify the length l in advance. For enumerating all possible lengths, the time complexity of this algorithm is too high.

Therefore, the resulting metapath consists only of the type of edge, which is difficult to use in many cases when node types need to be considered.<br>In addition, in the similarity measure of complex heterogeneity networks, the query-based metapath rapid generation method (Query-base Meta Path Generation Algorithm, QMPG) was proposed by Wang et al. to generate the desired set of metapath candidates.<br>The method requires a given path length l, by searching for all eligible sets of short metapaths with l2 lengths from the start and end points on their own defined query-based network patterns, and finally by merging the merged metapaths in the two short metapath collections, thus forming a collection of metapaths with a length of l from start to end.<br>This method requires specifying the length l in advance, and for enumeration of all possible lengths, the time complexity of the algorithm is too high.

Therefore, the generated meta path is only composed of edge types, which is difficult to use in many cases where node types need to be considered.<br>In addition, in the similarity measurement of complex heterogeneous networks [38], query based meta path generation algorithm (qmpg) was proposed by Wang et al. To generate the required meta path candidate set.<br>This method needs to give the path length L, search all qualified short meta path sets with length of L2 from the starting point and the end point respectively on the self-defined query based network mode, and finally merge the meta paths that can be merged in the two short meta path sets to form the meta path set with length L from the starting point to the end point.<br>This method needs to specify the length L in advance, which is too time-consuming for enumerating all possible lengths.<br>