Abstract: One or more computer processors creating a plurality of k-hop neighborhood contextual subgraphs utilizing extracted labelled nodes from an input graph; compute an eigenvector centrality score for each node contained in each created subgraph in the plurality of k-hop neighborhood contextual subgraphs; propagate a label for each node in each subgraph in the plurality of k-hop neighborhood contextual subgraphs leveraging an aggregated mathematical decay function, preserving a topical context of the label; calculate an attributable prestige vector for each node in each subgraph in the plurality of k-hop neighborhood contextual subgraphs based on the propagated label and the computed eigenvector centrality score associated with each node in each subgraph in the plurality of k-hop neighborhood contextual subgraph; and unsupervised predict a subsequent label for one or more subsequent nodes, subgraphs, or graphs utilizing the calculated attributable prestige vectors for each node in each subgraph.

Abstract: One or more computer processors creating a plurality of k-hop neighborhood contextual subgraphs utilizing extracted labelled nodes from an input graph; compute an eigenvector centrality score for each node contained in each created subgraph in the plurality of k-hop neighborhood contextual subgraphs; propagate a label for each node in each subgraph in the plurality of k-hop neighborhood contextual subgraphs leveraging an aggregated mathematical decay function, preserving a topical context of the label; calculate an attributable prestige vector for each node in each subgraph in the plurality of k-hop neighborhood contextual subgraphs based on the propagated label and the computed eigenvector centrality score associated with each node in each subgraph in the plurality of k-hop neighborhood contextual subgraph; and unsupervised predict a subsequent label for one or more subsequent nodes, subgraphs, or graphs utilizing the calculated attributable prestige vectors for each node in each subgraph.