Inexact Attributed Subgraph Matching

Thomas K. Tu, Jacob D. Moorman, Dominic Yang, Qinyi Chen, Andrea L. Bertozzi

Abstract: We present an approach for inexact subgraph matching on attributed graphs optimizing the graph edit distance. By combining lower bounds on the cost of individual assignments, we obtain a heuristic for a backtracking tree search to identify optimal solutions. We evaluate our algorithm on a knowledge graph dataset derived from real-world data, and analyze the space of optimal solutions.