I'd like to run a classifier on data I have for which each data point is itself a graph/network. I have hundreds of graphs of different types (so labelled, though I'm interested in doing both unsupervised and supervised learning), but I'm having trouble finding out of this has been done before. Graph neural networks mainly seem to be used for within-graph classification. I've found only a little material on graph-level classification.
What are established approaches to this kind of problem? I thought of extracting features from the graphs, then using said features as inputs? Or flattening the adjacency matrices and using these as inputs to an NN. Both of these methods seem like they may discard too much information to work though?