1 code implementation • 25 Jul 2018 • George Berry, Antonio Sirianni, Nathan High, Agrippa Kellum, Ingmar Weber, Michael Macy
This is a three step procedure which entails: 1) walking the graph starting from an arbitrary node; 2) learning a classifier on the nodes in the walk; and 3) applying a post-hoc adjustment to classification labels.
Social and Information Networks
