{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:55:47Z","timestamp":1725584147544},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212536"},{"type":"electronic","value":"9783642212543"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21254-3_12","type":"book-chapter","created":{"date-parts":[[2011,5,27]],"date-time":"2011-05-27T09:38:04Z","timestamp":1306489084000},"page":"167-178","source":"Crossref","is-referenced-by-count":0,"title":["Characterizing Compressibility of Disjoint Subgraphs with NLC Grammars"],"prefix":"10.1007","author":[{"given":"Robert","family":"Brijder","sequence":"first","affiliation":[]},{"given":"Hendrik","family":"Blockeel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2-3","key":"12_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01692060","volume":"20","author":"M. Bauderon","year":"1987","unstructured":"Bauderon, M., Courcelle, B.: Graph expressions and graph rewritings. Mathematical Systems Theory\u00a020(2-3), 83\u2013127 (1987)","journal-title":"Mathematical Systems Theory"},{"key":"12_CR2","unstructured":"Blockeel, H., Brijder, R.: Learning non-confluent NLC graph grammar rules. In: Ambos-Spies, K., L\u00f6we, B., Merkle, W. (eds.) 5th Conference on Computability in Europe (CiE 2009), Mathematical Theory and Computational Practice, Abstract Booklet, pp. 60\u201369 (2009)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Blockeel, H., Brijder, R.: Non-confluent NLC graph grammar inference by compressing disjoint subgraphs. Accepted for Journal of Logic and Computation. Preprint version: [arXiv:0901.4876] (2010)","DOI":"10.1093\/logcom\/exr046"},{"key":"12_CR4","unstructured":"Blockeel, H., Nijssen, S.: Induction of node label controlled graph grammar rules. In: Proceeding of the 6th International Workshop on Mining and Learning with Graphs, MLG 2008 (2008)"},{"key":"12_CR5","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1613\/jair.43","volume":"1","author":"D. Cook","year":"1994","unstructured":"Cook, D., Holder, L.: Substructure discovery using minimum description length and background knowledge. Journal of Artificial Intelligence Research\u00a01, 231\u2013255 (1994)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"4","key":"12_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/51.940050","volume":"20","author":"D. Cook","year":"2001","unstructured":"Cook, D., Holder, L., Su, S., Maglothin, R., Jonyer, I.: Structural mining of molecular biology data. IEEE Engineering in Medicine and Biology\u00a020(4), 67\u201374 (2001)","journal-title":"IEEE Engineering in Medicine and Biology"},{"key":"12_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, KBCS 2002 (2002)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Engelfriet, J., Rozenberg, G.: Graph grammars based on node rewriting: An introduction to NLC graph grammars. In: Graph-Grammars and Their Application to Computer Science, pp. 12\u201323 (1990)","DOI":"10.1007\/BFb0017374"},{"key":"12_CR9","unstructured":"Florencio, C., Ramon, J., Daenen, J., van den Bussche, J., van Dyck, D.: Context-free graph grammars as a language-bias mechanism for graph pattern mining. In: Blockeel, H., Borgwardt, K., Yan, X. (eds.) 7th International Workshop on Mining and Learning with Graphs, Extended Abstracts (2009)"},{"issue":"4","key":"12_CR10","doi-asserted-by":"crossref","first-page":"377","DOI":"10.3233\/IDA-2007-11405","volume":"11","author":"J. Kukluk","year":"2007","unstructured":"Kukluk, J., Holder, L., Cook, D.: Inference of node replacement graph grammars. Intelligent Data Analysis\u00a011(4), 377\u2013400 (2007)","journal-title":"Intelligent Data Analysis"},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1142\/S0218213008004047","volume":"17","author":"J. Kukluk","year":"2008","unstructured":"Kukluk, J., Holder, L., Cook, D.: Inference of edge replacement graph grammars. International Journal on Artificial Intelligence Tools\u00a017(3), 539\u2013554 (2008)","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"12_CR12","unstructured":"Kukluk, J., You, C., Holder, L., Cook, D.: Learning node replacement graph grammars in metabolic pathways. In: Arabnia, H., Yang, M., Yang, J. (eds.) BIOCOMP, pp. 44\u201350. CSREA Press (2007)"},{"issue":"7","key":"12_CR13","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1016\/j.patcog.2008.10.033","volume":"42","author":"L. Lin","year":"2009","unstructured":"Lin, L., Wu, T., Porway, J., Xu, Z.: A stochastic graph grammar for compositional object representation and recognition. Pattern Recognition\u00a042(7), 1297\u20131307 (2009)","journal-title":"Pattern Recognition"},{"key":"12_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-540-39917-9_19","volume-title":"Inductive Logic Programming","author":"T. Oates","year":"2003","unstructured":"Oates, T., Doshi, S., Huang, F.: Estimating maximum likelihood parameters for stochastic context-free graph grammars. In: Horv\u00e1th, T., Yamamoto, A. (eds.) ILP 2003. LNCS (LNAI), vol.\u00a02835, pp. 281\u2013298. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21254-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,24]],"date-time":"2021-11-24T07:50:50Z","timestamp":1637740250000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21254-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212536","9783642212543"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21254-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}