How to approach graphed data for a binary classification system?
Super comprehensive question. You are basically asking for tones of directions! I'd suggest to start with link prediction problem. So assume you have a directed/signed/weighted graph and you want to find the most probable next interaction (link/edge). I'd suggest to have a look at Jerome Kunegis papers and you may see it as a starting point and go on from there.