Given a graph, how can we extract good features for the nodes? For example, given two large graphs from the same domain, how can we use information in one to do classification in the other (i.e., perform across-network classification or transfer learning on graphs)? Also, if one of the graphs is anonymized, how can we use information in one to de-anonymize the other? The key step in all such graph mining tasks is to find effective node features. We propose ReFeX (Recursive Feature eXtraction), a novel algorithm, that recursively combines local (node-based) features with neighborhood (egonet-based) features; and outputs regional features –- capturing “behavioral” information. We demonstrate how these powerful regional features can be used in within-network and across-network classification, de-anonymization, and role discovery tasks –- with-out relying on homophily, or the availability of class labels.
Copyright. All Rights Reserved.