{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:11:54Z","timestamp":1740287514132,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540201441"},{"type":"electronic","value":"9783540399179"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39917-9_19","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T04:02:15Z","timestamp":1277697735000},"page":"281-298","source":"Crossref","is-referenced-by-count":7,"title":["Estimating Maximum Likelihood Parameters for Stochastic Context-Free Graph Grammars"],"prefix":"10.1007","author":[{"given":"Tim","family":"Oates","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shailesh","family":"Doshi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fang","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","volume-title":"Proceedings of the second international workshop on graph grammars and their applications to computer science","author":"B. Bartsch-Sprol","year":"1983","unstructured":"Bartsch-Sprol, B.: Grammatical inference of graph grammars for syntactic pattern recognition. In: Ehrig, H., Nagl, M., Rozenberg, G. (eds.) Proceedings of the second international workshop on graph grammars and their applications to computer science, Springer, Heidelberg (1983)"},{"key":"19_CR2","volume-title":"Statistical language learning","author":"E. Charniak","year":"1993","unstructured":"Charniak, E.: Statistical language learning. MIT Press, Cambridge (1993)"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1109\/51.940050","volume":"20","author":"D. Cook","year":"2001","unstructured":"Cook, D., Holder, L.B., Su, S., Maglothin, R., Jonyer, I.: Structural mining of molecular biology data. IEEE Engineering in Medicine and Biology\u00a020, 231\u2013255 (2001)","journal-title":"IEEE Engineering in Medicine and Biology"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0304-3975(87)90102-2","volume":"55","author":"B. Courcelle","year":"1987","unstructured":"Courcelle, B.: An axiomatic definition of context-free rewriting and its application to NLC graph grammars. Theoretical Computer Science\u00a055, 141\u2013181 (1987)","journal-title":"Theoretical Computer Science"},{"key":"19_CR5","volume-title":"Handbook of graph grammars and computing by graph transformation: Foundations","author":"B. Courcelle","year":"1997","unstructured":"Courcelle, B.: The expression of graph properties and graph transformations in monadic second-order logic. In: Rozenberg, G. (ed.) Handbook of graph grammars and computing by graph transformation: Foundations, World Scientific Publishing Company, Singapore (1997)"},{"key":"19_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A.P. Dempster","year":"1977","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society Series B\u00a039, 1\u201338 (1977)","journal-title":"Journal of the Royal Statistical Society Series B"},{"key":"19_CR7","unstructured":"Doshi, S., Huang, F., Oates, T.: Inferring the structure of graph grammars from data. In: Proceedings of the International Conference on Knowledge-Based Computer Systems (2002)"},{"key":"19_CR8","volume-title":"Handbook of graph grammars and computing by graph transformation: Foundations","author":"F. Drewes","year":"1997","unstructured":"Drewes, F., Kreowski, H.J., Habel, A.: Hyperedge replacement graph grammars. In: Rozenberg, G. (ed.) Handbook of graph grammars and computing by graph transformation: Foundations, World Scientific Publishing Company, Singapore (1997)"},{"volume-title":"Handbook of graph grammars and computing by graph transformation: Applications, languages and tools","year":"1999","key":"19_CR9","unstructured":"Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.): Handbook of graph grammars and computing by graph transformation: Applications, languages and tools. World Scientific Publishing Company, Singapore (1999)"},{"key":"19_CR10","volume-title":"Handbook of graph grammars and computing by graph transformation: Foundations","author":"J. Engelfriet","year":"1997","unstructured":"Engelfriet, J., Rozenberg, G.: Node replacement graph grammars. In: Rozenberg, G. (ed.) Handbook of graph grammars and computing by graph transformation: Foundations, World Scientific Publishing Company, Singapore (1997)"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1080\/09540090110072327","volume":"13","author":"P. Fletcher","year":"2001","unstructured":"Fletcher, P.: Connectionist learning of regular graph grammars. Connection Science\u00a013, 127\u2013188 (2001)","journal-title":"Connection Science"},{"key":"19_CR12","unstructured":"Hong, P., Huang, T.S.: Spatial pattern discovery by learning a probabilistic parametric model from multiple attributed relational graphs. Journal of Discrete Applied Mathematics (2002)"},{"key":"19_CR13","volume-title":"Introduction to automata theory, languages, and computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages, and computation. Addison-Wesley Publishing Company, Reading (1979)"},{"key":"19_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0539-5","volume-title":"Descriptive complexity","author":"N. Immerman","year":"1999","unstructured":"Immerman, N.: Descriptive complexity. Springer, Heidelberg (1999)"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BFb0017406","volume-title":"Graph Grammars and Their Application to Computer Science","author":"E. Jeltsch","year":"1991","unstructured":"Jeltsch, E., Kreowski, H.J.: Grammatical inference based on hyperedge replacement. In: Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) Graph Grammars 1990. LNCS, vol.\u00a0532, pp. 461\u2013474. Springer, Heidelberg (1991)"},{"key":"19_CR16","unstructured":"Jonyer, I., Holder, L.B., Cook, D.J.: Concept formation using graph grammars. In: Working Notes of the KDD Workshop on Multi-Relational Data Mining (2002)"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0885-2308(90)90022-X","volume":"4","author":"K. Lari","year":"1990","unstructured":"Lari, K., Young, S.J.: The estimation of stochastic context-free grammars using the inside-outside algorithm. Computer Speech and Language\u00a04, 35\u201356 (1990)","journal-title":"Computer Speech and Language"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF00289017","volume":"27","author":"C. Lautemann","year":"1990","unstructured":"Lautemann, C.: The complexity of graph languages generated by hyperedge replacement. Acta Informatica\u00a027, 399\u2013421 (1990)","journal-title":"Acta Informatica"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Mosbah, M.: Properties of random graphs generated by probabilistic graph grammars. In: Proceedings of the The Fifth International Workshop on Graph Grammars and their Application to Computer Science (1994)","DOI":"10.1007\/3-540-56402-0_51"},{"key":"19_CR20","unstructured":"Muggleton, S.: Stochastic logic programs. In: De Raedt, L. (ed.) Advances in inductive logic programming, pp. 254\u2013264 (1996)"},{"key":"19_CR21","unstructured":"Office of Technology Assessment, U.C. Information technologies for control of money laundering. OTA-ITC-360 (1995)"},{"key":"19_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511571220","volume-title":"Algebraic models for social networks","author":"P.E. Pattison","year":"1993","unstructured":"Pattison, P.E.: Algebraic models for social networks. Cambridge University Press, Cambridge (1993)"},{"key":"19_CR23","unstructured":"Stolcke, A.: Bayesian learning of probabilistic language models. Doctoral dissertation, University of California, Berkeley (1994)"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39917-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T08:32:34Z","timestamp":1740213154000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39917-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201441","9783540399179"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39917-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}