Graph classification, small sample size #7032
raythroughspace
started this conversation in
General
Replies: 1 comment 2 replies
-
If I understand you correctly, you want to create subgraphs out of your graphs, which you then use for graph classification. Is this correct? One thing you could do is partition your graph via |
Beta Was this translation helpful? Give feedback.
2 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
-
What are some standard ways to deal with very small datasets (<20 graphs) for graph binary classification tasks? My graphs have tens of thousands of nodes with millions of edges. When I train a GNN on these large unfiltered graphs (<20 instances), I notice the GNN achieves 100% accuracy.
Nodes in my graph have gene expression values, when I filter out some nodes using standard genetic techniques, I notice the GNN can no longer correctly classify and will predict either all positive or all negative (even though all the nodes filtered out are low expressed genes which in theory should not affect the predictions).
My goal is to filter down the size of the graphs from ~20000 nodes to ~1000s of nodes and still have perfect accuracy (I know it is possible to achieve this using other ML techniques). But I've tried the standard GNN models (GCN, GAT, SAGE) with many different hyperparameters, and all of them will predict either all + or -. I feel like the small sample size may be the cause of my issues. Is there anything I can do in this case?
Beta Was this translation helpful? Give feedback.
All reactions