I worked on multipartite graphs and I think that approach can be valid : recommender systems can be approximated to bipartite graphs (users, content), I aimed to to generalise recommendations between different types of entities, by leveraging on entities properties.
As results, recommendations are good enough even if where there are no followers (or too few users).
I would use graph analytics on top of KG, where KG may describe types of Q and A.
Elaborating on your hint Matthias S. -
Grouping of Personae could be done in different ways, right now thinking about similarity measures but in case of dense networks also dimensionality reduction may proof good to cluterize.
I would groups types of questions and answers ( maybe bread for NLP teeth ), and ascribe those to types of "meta"-relationships in a KG, in attempt to abstract the scope of questions / answers from granularity of topics (like, imagine to map "raw ingredients" and "cooking details" into commodity classification and cooking procedures).
And then use relationships and extracted topics as properties in topological analyses, to classify types of Persons.
Inference could be done upon these results.
I used random walks between entities; I think it could be done between subgraphs of persons-topics-persons.
I tried random walks because reasoning does not always work well with shortest paths answers - but rather organising paths that are not trivial, and also not too long. They proved insightful.
I also would like to explore new approaches.
So to wrap up, I would use a KG to describe types of entities and relationships, and then use network science analytics to organise topics, persons, background, and then use statistical inference for suggestions of intermediate steps of learning paths.
For the sake of knowledge - any public grant to apply for a #common work ?
Or Robert M. does companies like McKinsey and similar may offer a small grant or would be receptive of a pilot proposal (cost-benefit opportunity 🙂 ) ?