Skip to content
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

Enforcing Sparsity #68

Open
nassimaab opened this issue Aug 20, 2020 · 0 comments
Open

Enforcing Sparsity #68

nassimaab opened this issue Aug 20, 2020 · 0 comments

Comments

@nassimaab
Copy link

First, thank you very much for this great project!

I want to generate realistic variants of Citeseer, so I tried to use your GVAE implementation. However, sampling adjacency matrices from the probability matrix computed by the GVAE leads to very dense graphs (~ 600.000 edges). Is this behavior expected? Or am I missing something? By inspecting the probability matrix, I found that more than 50.000 entries had a probability greater than 0.9.
Should I explicitly incorporate a term that enforces sparsity? Or maybe a sampling scheme that imposes constraints on the number of edges?

Best regards,

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant