MEGA and MEGA++ embed meta-paths and meta-graphs for better network similarity.
problem Ignoring meta-paths in meta-graph-based relevance computing.
method MEGA++ uses tensor decomposition and coupled tensor-matrix decomposition for joint node embedding.
result MEGA and MEGA++ outperform state-of-the-art approaches in similarity search.