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

Keywords

Computer science, Rule-based machine translation, Graph, Graph property, Random graph

References

• Comparing Graph Representations of Protein Structure for Mining Family-Specific Residue-Based Packing MotifsJ. Donald Johnson, R.L. Jolley — 2005
• Inferring the Structure of Graph Grammars from DataShailesh P. Doshi, Fang Huang — 2003
• MDL-Based Context-Free Graph Grammar InductionIstván Jónyer, Lawrence B. Holder, Diane J. Cook — 2003
• Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: FoundationsGrzegorz Rozenberg — 1997
• Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distributionHartmut Ehrig, H-J Kreowski, Ugo Montanari — 1999
• Applications of stochastic context-free grammars using the Inside-Outside algorithmKimia Bazargan Lari, S. Young — 1990
• PROTEIN STRUCTURE: INSIGHTS FROM GRAPH THEORYSaraswathi Vishveshwara, K. V. Brinda, N. KANNAN — 2002
• A graph distance metric based on the maximal common subgraphHorst Bunke, Kim Shearer — 1998
• Grammatical inference by hill climbingCraig M. Cook, Azriel Rosenfeld, Alan R. Aronson — 1976
• Inference of Edge Replacement Graph GrammarsJacek P. Kukluk, Lawrence B. Holder, Diane J. Cook — 2008
• Precise N-Gram Probabilities From Stochastic Context-Free GrammarsAndreas Stolcke, Jonathan Segal — 1994
• New Ranking Algorithms for Parsing and Tagging: Kernels over Discrete Structures, and the Voted PerceptronMichael Collins, Nigel Duffy — 2002
• gSpan: graph-based substructure pattern miningXifeng Yan, Jiawei Han — 2002
• The estimation of stochastic context-free grammars using the Inside-Outside algorithmKimia Bazargan Lari, S. Young — 2003
• On Graph Kernels: Hardness Results and Efficient AlternativesThomas, Gaertner, Flach, Peter, Stefan, Wrobel — 2003
• Handbook of Graph Grammars and Computing by Graph Transformation1997
• Inducing Probabilistic Grammars by Bayesian Model MergingAndreas Stolcke, Stephen M. Omohundro — 1994
• Grammatical Inference Based on Hyperedge ReplacementE. Jeltsch, H. Kreowski — 1990
• Estimating Maximum Likelihood Parameters for Stochastic Context-Free Graph GrammarsT. Oates, Shailesh Doshi, Fang Huang — 2003
• The Power of AmnesiaD. Ron, Y. Singer, Naftali Tishby — 1993

Cited by

• Best Paper: Jörg Stucke-„Optimizing Malware Signature Databases with String Signaturesy“. Best Presentation: Santiago Londoño and Olana Missura-„Graph Gram- mars for Super Mario Bros Levels“. Best Poster: Mohammad Khatami-„BundleMAP: A Novel Method for Tract-Based Analysis of Neuroimaging Data“. BF. Orlandi, Pascal Welke, E. Langetepe — 2015

Related papers

• Sandwiching random graphs: universality between random graph modelsJ.H. Kim, Van H. Vu — 2004
• Every monotone graph property is testableNoga Alon, A. Shapira — 2005
• Random graph processes and optimisationJ Cain — 2006
• A logician's view of graph polynomialsJohann A. Makowsky, Elena V. Ravve, Tomer Kotek — 2017
• A graph-theoretic approach to predicting molecular propertiesSubhash C. Basak, Gerald J. Niemi, Gilman D. Veith — 1990
• The r-covered property of the line graphsDaqing Yang — 2005
• Historical Notes on Some Basic Concepts in Graph TheoryCheng Zhao — 2011
• M-Polynomials and Topological Indices for Line Graphs of Chain Silicate Network and H-Naphtalenic NanotubesMuhammad Irfan, Hamood Ur Rehman, Hassan Almusawa — 2021