Interactive graph-matching using active query strategies ?
An interactive method is presented to improve the matching between graphs. Active strategies are used to select nodes the oracle has to interact with. Six different strategies have been adapted from classical active learning. We present a practical evaluation with four different graph databases.
active query strategies error-tolerant graph matching edit distance interactive node labelling