作者: Fang Huang , Shailesh P. Doshi
DOI:
关键词: Voltage graph 、 Power graph analysis 、 Graph property 、 Graph database 、 Mathematics 、 Graph rewriting 、 Theoretical computer science 、 Directed graph 、 Null graph 、 Clique-width
摘要: Graphs can be used to represent such diverse entities as chemical compounds, transportation networks, and the world wide web. Stochastic graph grammars are compact representations of probability distributions over graphs. We present an algorithm for inferring stochastic from data. That is, given a set graphs that, example, correspond all which have some desirable property, uncovers structure shared by represents it in form grammar. The inferred grammar assigns high was learned low other report results preliminary experiments compared target generated training