2012 | OriginalPaper | Buchkapitel
A Message Passing Graph Match Algorithm Based on a Generative Graphical Model
verfasst von : Gang Shen, Wei Li
Erschienen in: Active Media Technology
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In This paper, we present a generative model to measure the graph similarity, assuming that an observed graph is generated from a template by a Markov random field. The potentials of this random process are characterized by two sets of parameters: the attribute expectations specified by the the template graph, and the variances that can be learned by a maximum likelihood estimator from a collection of samples. Once a sample graph is observed, a max-product loopy belief propagation algorithm is applied to approximate the most probable explanation of the template’s vertices, mapped to the sample’s vertices. As demonstrated by the experiments, compared with other algorithms, the proposed approach performed better for near isomorphic graphs in the typical graph alignment and information retrieval applications.