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

How to use for graph level unsupervised clustering, not the node? #20

Open
PeterDeSOM opened this issue Jul 16, 2023 · 1 comment
Open

Comments

@PeterDeSOM
Copy link

I have millions of graph data that cannot be labeled by human efforts. I need it to be classified by unsupervised technique, not semi and not the node level. Is it possible?

@yueliu1999
Copy link
Owner

Thanks for your attention. It's possible to conduct graph-level clustering. The general pipeline is as follows. 1) Conduct representation learning on graphs via self-supervised techniques, e.g., contrastive learning. 2) Apply the readout function (pooling function) on the learned node embeddings to obtain the graph embeddings. 3) Conduct clustering on the learned graph embeddings. (Maybe borrow some methods in this repository). I hope these suggestions help you.

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

2 participants