You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hi, I just read your paper and try to use your code. As I am not familiar with this area, I got many questions. In the code, the gram matrix is computed for downstream tasks. So I wonder whether the gram matrix is the implicit representation of graphs or explicit representation. It seems the similarity can be calculated by the representation of graphs in each line and also the elements in the matrix already represent their similarity
By the way, your work is very interesting and useful. And I learn a lot from it!
The text was updated successfully, but these errors were encountered:
Hi, I just read your paper and try to use your code. As I am not familiar with this area, I got many questions. In the code, the gram matrix is computed for downstream tasks. So I wonder whether the gram matrix is the implicit representation of graphs or explicit representation. It seems the similarity can be calculated by the representation of graphs in each line and also the elements in the matrix already represent their similarity
By the way, your work is very interesting and useful. And I learn a lot from it!
The text was updated successfully, but these errors were encountered: