-
Notifications
You must be signed in to change notification settings - Fork 11
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
The meaning of two types #1
Comments
@wangboyunze can correct me if I am wrong, but I think that these are two different methods for normalizing the weighted adjacency matrix of the graph for the random walk. In a symmetric network, the 'ave' option would create a degree-normalized (in unweighted networks)or col-sum-normalized (for weighted networks) graph laplacian. But due to the nature of matrix multiplication, the resulting matrix would not be symmetric. The 'gph' option creates a symmetric version of the normalized graph laplacian for random walks. However, I believe the TransitionFields.m script converts both of these matrices into a DSM for the random walk steps described in the paper. Wikipedia actually has a pretty nice page on the graph laplacians used in random walks. |
Ok, and would you like to share the codes that compute the FV and VLAD encodings with me? |
|
I remember the Wt I got is a doubly-stochastic matrix. |
是直接运行这个matlab的代码的吗? 我直接使用作者提供的matlab代码和demo中的butterfly的数据,但只是得到一个对称的矩阵,并不是双随机矩阵 |
In the file NE_dn.m , you mentioned 2 types :
ave
andgph
. However , I didn't see these words in your paper . So I want to know what's the meaning of these two types ?The text was updated successfully, but these errors were encountered: