10,439 Hits in 2.8 sec

Inference of node replacement graph grammars

Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook
2007 Intelligent Data Analysis  
If subgraphs overlap by one node we propose a node replacement grammar production.  ...  We briefly discuss other grammar inference systems indicating that our study extends classes of learnable graph grammars.  ...  We are continuing our research in graph grammar inference to develop methods allowing for discovery of more powerful classes of graph grammars than discussed in this paper.  ... 
doi:10.3233/ida-2007-11405 fatcat:twxdznlcnfg3rln7r3wy2tn57e

Inference of Node Replacement Recursive Graph Grammars [chapter]

Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook
2006 Proceedings of the 2006 SIAM International Conference on Data Mining  
If subgraphs overlap by one node we propose a node replacement grammar production.  ...  If subgraphs overlap by one node we propose a node replacement grammar production.  ...  Conclusions and future work We described an algorithm for inferring certain types of graph grammars we call recursive node replacement graph grammars.  ... 
doi:10.1137/1.9781611972764.57 dblp:conf/sdm/KuklukHC06 fatcat:hqee2y7q2ffdtkdg2ok3xq27ju


2008 International journal on artificial intelligence tools  
We describe an algorithm and experiments for inference of edge replacement graph grammars.  ...  We guide the search for the graph grammar using the size of a graph.  ...  Eventually, we will integrate inference of non-recursive, node-replacement and edgereplacement productions into one graph-grammar inference system.  ... 
doi:10.1142/s0218213008004047 fatcat:cksdmrmqyfexfht4ifnbyterki

Inferring Graph Grammars by Detecting Overlap in Frequent Subgraphs

Jacek Kukluk, Lawrence Holder, Diane Cook
2008 International Journal of Applied Mathematics and Computer Science  
Inferring Graph Grammars by Detecting Overlap in Frequent Subgraphs In this paper we study the inference of node and edge replacement graph grammars.  ...  If the subgraphs overlap by one node, we propose a node replacement graph grammar production.  ...  We proposed the inference of edge replacement recursive graph grammars as an extension to the algorithm for node replacement inference.  ... 
doi:10.2478/v10006-008-0022-y fatcat:4dvhlg2wrraapbv7qj56uibhqu

Graph Grammar Induction on Structural Data for Visual Programming

Keven Ates, Jacek Kukluk, Lawrence Holder, Diane Cook, Kang Zhang
2006 Proceedings - International Conference on Tools with Artificial Intelligence, TAI  
Therefore, a technique for automatically constructing graph grammars-at least in part-is desirable. An induction method is given to infer node replacement graph grammars.  ...  The correctness of an inferred grammar is verified by parsing graphs not present in the training set.  ...  The correctness of the specification for a graph form can be controlled using graph grammars. The inference algorithm described in Section 4 is used to infer node replacement graph grammars.  ... 
doi:10.1109/ictai.2006.61 dblp:conf/ictai/AtesKHCZ06 fatcat:d5yyak6gwfhqrkrdcmu4ijd4eu

Discovering Program's Behavioral Patterns by Inferring Graph-Grammars from Execution Traces

Chunying Zhao, Keven Ates, Jun Kong, Kang Zhang
2008 2008 20th IEEE International Conference on Tools with Artificial Intelligence  
Taking advantage of graphs' expressiveness and intuitiveness for human cognition, we present a graph-grammar induction approach to discovering program's behavioral patterns by analyzing execution traces  ...  Software developers, however, often use graphs to illustrate the process of program executions, such as UML diagrams, flowcharts and call graphs.  ...  Several issues need to be addressed when inferring a graph-grammar, such as the selection and replacement of subgraphs.  ... 
doi:10.1109/ictai.2008.68 dblp:conf/ictai/ZhaoAKZ08 fatcat:3vqifekldfhx7mzm3nbkludi7i

Constructing VEGGIE: Machine Learning for Context-Sensitive Graph Grammars

Keven Ates, Kang Zhang
2007 19th IEEE International Conference on Tools with Artificial Intelligence(ICTAI 2007)  
The system is extended with novel work to infer contextsensitive graph grammars.  ...  Using existing technologies for graph grammars, a tool for the construction and parsing of context-sensitive graph grammars is combined with a tool for inducing context-free graph grammars.  ...  Department of Education.  ... 
doi:10.1109/ictai.2007.59 dblp:conf/ictai/AtesZ07 fatcat:hxb5d4a2hzcwlpiy3lumlnsbm4

Program Behavior Discovery and Verification: A Graph Grammar Approach

Chunying Zhao, Jun Kong, Kang Zhang
2010 IEEE Transactions on Software Engineering  
To address this, we present a semi-automatic graph grammar approach to retrieving the hierarchical structure of the program behavior.  ...  Furthermore, using the induced grammar to parse the behavioral structure of a new program could verify if the program has the same behavioral properties specified by the grammar.  ...  from G by replacing each instance of S with a single node.  ... 
doi:10.1109/tse.2010.3 fatcat:ys2by3b335drrfqejnvrrdlx7u

Probabilistic hypergraph grammars for efficient molecular optimization [article]

Egor Kraev, Mark Harley
2019 arXiv   pre-print
We infer a hypergraph replacement grammar from the ChEMBL database, count the frequencies of particular rules being used to expand particular nonterminals in other rules, and use these as conditional priors  ...  To do so, the agent has policies both to choose the next node in the graph to expand and to select the next grammar rule to apply.  ...  Comparison with the graph convolutional networks for that purpose will be the subject of further work.  ... 
arXiv:1906.01845v1 fatcat:6chznza7ebdi3jv3zad6f5r4om

Inferring Probability Distributions of Graph Size and Node Degree from Stochastic Graph Grammars [chapter]

Sourav Mukherjee, Tim Oates
2010 Proceedings of the 2010 SIAM International Conference on Data Mining  
In this paper we show that a stochastic graph grammar can be used to efficiently compute the probability mass functions of the number of nodes, the number of edges, and the degree of a node selected uniformly  ...  Stochastic graph grammars compactly represent probability distributions over graphs and can be learned from data, such as a set of graphs corresponding to proteins that have the same function.  ...  Both these algorithms learn node-replacement graph grammars.  ... 
doi:10.1137/1.9781611972801.43 dblp:conf/sdm/MukherjeeO10 fatcat:sd73vxrkcrdb5mrjnkljbwokke


2004 International journal on artificial intelligence tools  
We present an algorithm for the inference of context-free graph grammars from examples.  ...  Grammar features include recursion, variables and relationships.  ...  We describe an algorithm for the inference of context-free graph grammars-a set of grammar production rules that describe a graph-based database.  ... 
doi:10.1142/s0218213004001429 fatcat:j3qydsalmrgypalb6hlcmqh66m

Growing Graphs from Hyperedge Replacement Graph Grammars

Salvador Aguiñaga, Rodrigo Palacios, David Chiang, Tim Weninger
2016 Proceedings of the 25th ACM International on Conference on Information and Knowledge Management - CIKM '16  
Or, a stochastic application of the graph grammar rules can be used to quickly create random graphs.  ...  In this paper we show that a graph's clique tree can be used to extract a hyperedge replacement grammar.  ...  Figure 3 : 3 Example of hyperedge replacement grammar rule creation from the root node of the clique tree.  ... 
doi:10.1145/2983323.2983826 dblp:conf/cikm/AguinagaPCW16 fatcat:shkq7iqkbfflrbgpwpggw3qnze

Factor Graph Grammars [article]

David Chiang, Darcey Riley
2020 arXiv   pre-print
We propose the use of hyperedge replacement graph grammars for factor graphs, or factor graph grammars (FGGs) for short.  ...  For finite sets of graphs (but possibly infinite variable domains), a FGG can be converted to a single factor graph amenable to standard inference techniques.  ...  Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation.  ... 
arXiv:2010.12048v1 fatcat:w44dcfxvlnbqnihzc2smgdg7hq

Defining Models - Meta Models versus Graph Grammars

Berthold Hoffmann, Mark Minas
2010 Electronic Communications of the EASST  
The precise specification of software models is a major concern in model-driven design of object-oriented software. Metamodelling and graph grammars are apparent choices for such specifications.  ...  However, not all graph grammars that allow to specify practically relevant models are easily parseable.  ...  They can be easily inferred from the sorts of the incident nodes.  ... 
doi:10.14279/tuj.eceasst.29.411 dblp:journals/eceasst/HoffmannM10 fatcat:64uvaxjerjgszieifdngvs2g5e

Reinforced Molecular Optimization with Neighborhood-Controlled Grammars [article]

Chencheng Xu, Qiao Liu, Minlie Huang, Tao Jiang
2020 arXiv   pre-print
We extend the original neighborhood-controlled embedding grammars to make them applicable to molecular graph generation and design an efficient algorithm to infer grammatical production rules from given  ...  By transforming molecular graphs to parse trees with the inferred grammars, the molecular structure generation task is modeled as a Markov decision process where a policy gradient strategy is utilized.  ...  Acknowledgments and Disclosure of Funding  ... 
arXiv:2011.07225v1 fatcat:42pkxg3s45hklonof5c3p26rli
« Previous Showing results 1 — 15 out of 10,439 results