-
Notifications
You must be signed in to change notification settings - Fork 189
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
link prediction? #33
Comments
Hi George, Yes, modifying 'parse_example' (or design other functions) to return a pair of examples sounds feasible. Happy to discuss further if you have any thought/suggestion. Cheers, |
Hi Da-Cheng, Cool, I think I will go with modifying the function, parse_example, to get another function, parse_link, and try to design some other function to grab associated neighbours of the link. I can contribute the code once it's functional if that is of interest? Cheers, |
Sounds great : ) |
Another approach we could take is to generalize preprocessing/parsing tools to generate random walks instead of just neighbors. This would enable us to do combine NSL with graph likelihood defined here Learning Edge Representations via Low-Rank Asymmetric Projections |
@ppham27 yea, that definitely could be another option but will focus on the other approach first. |
@ggerogiokas, thanks for your interest in NSL! I am assigning this issue to you for now since you are prototyping the proposed approach(es). Feel free to pass it back to us once you have something or want to discuss more. |
@ggerogiokas I am also interested in this aspect of NSL. Did you make any progress on this idea?? |
Hi,
Yea unfortunately, I have this low on my priority list. Haven't had time
to do this! Though one simple thing you can do is just treat edge
embeddings as node embeddings and then you have to redefine the network.
George
…On Sun, 26 Apr 2020, 10:56 Shrey, ***@***.***> wrote:
@ggerogiokas <https://github.com/ggerogiokas> I am also interested in
this aspect of NSL. Did you make any progress on this idea??
—
You are receiving this because you were mentioned.
Reply to this email directly, view it on GitHub
<#33 (comment)>,
or unsubscribe
<https://github.com/notifications/unsubscribe-auth/ADAOA5QZDCV3ZAMDSGGDCVDROQALFANCNFSM4JJAJEYA>
.
|
Closing this issue for now due to inactivity. Feel free to reopen if you have any progress or updates on the link prediction idea. |
Hi,
I have been thinking about using NSL in the context of link prediction. It can definitely be reframed as a classification problem I believe. The only thing I am wondering about is if anyone has thought of an elegant way to add the neighbours (I guess in this case of both nodes which form the link ). Has anyone been working on this?
I guess a decent way of going about it would be changing the parse_example function:
so, that it can take a pair of examples which are part of a link.
Thanks,
George
The text was updated successfully, but these errors were encountered: