We develop an algorithm to integrate two graphs collected from different sources. We propose an active graph matching algorithm to exploit crowdsourcing. We suggest a random walk model to compute the matching probability between two nodes. We derive an inference method to estimate the matching probability with EM algorithm. For active learning, we devise a method to select the most informative query node.