{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:50:53Z","timestamp":1725486653349},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540412373"},{"type":"electronic","value":"9783540409922"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-40992-0_11","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T20:01:19Z","timestamp":1181678479000},"page":"141-155","source":"Crossref","is-referenced-by-count":3,"title":["A New Framework for Discovering Knowledge from Two-Dimensional Structured Data Using Layout Formal Graph System"],"prefix":"10.1007","author":[{"given":"Tomoyuki","family":"Uchida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuko","family":"Itokawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takayoshi","family":"Shoudai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuhiro","family":"Miyahara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasuaki","family":"Nakamura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,19]]},"reference":[{"key":"11_CR1","series-title":"Lect Notes Comput Sci","first-page":"416","volume-title":"Proc. Graph Drawing\u2019 94","author":"F. J. Brandenburg","year":"1994","unstructured":"F. J. Brandenburg. Designing graph drawings by layout graph grammars. Proc. Graph Drawing\u2019 94, Lecture Notes in Computer Science, Vol. 894:416\u2013427, 1994. 143, 149, 153"},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1613\/jair.43","volume":"1","author":"D. J. Cook","year":"1994","unstructured":"D. J. Cook and L. B. Holder. Substructure discovery using minimum description length and background knowledge. Journal of Artificial Intelligence Research, 1:231\u2013255, 1994. 143","journal-title":"Journal of Artificial Intelligence Research"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"P. Finn, S. Muggleton, D. Page, and A. Srinivasan. Pharmacophore discovery using the inductive logic programming system progol. Machine Learning, pages 241\u2013270, 1998. 142","DOI":"10.1023\/A:1007460424845"},{"key":"11_CR4","unstructured":"M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979. 147"},{"key":"11_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/3-540-18771-5_41","volume-title":"Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science","author":"A. Habel","year":"1987","unstructured":"A. Habel and H.-J. Kreowski. May we introduce to you: hyperedge replacement. Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science, LNCS 291, pages 15\u201326, 1987. 149, 151"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0020-0255(80)90038-9","volume":"20","author":"D. Janssens","year":"1980","unstructured":"D. Janssens and G. Rozenberg. On the structure of node-label-controlled graph languages. Information Sciences, 20:191\u2013216, 1980. 151","journal-title":"Information Sciences"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"J. W. Lloyd. Foundations of Logic Programming, Second, Extended Edition. Springer-Verlag, 1987. 149","DOI":"10.1007\/978-3-642-83189-8"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"T. Miyahara, T. Shoudai, T. Uchida, T. Kuboyama, K. Takahashi, and H. Ueda. Discovering new knowledge from graph data using inductive logic programming. Proc. ILP-99, Springer-Verlag, LNAI 1634, pages 222\u2013233, 1999. 142, 153","DOI":"10.1007\/3-540-48751-4_21"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"T. Miyahara, T. Uchida, T. Kuboyama, T. Yamamoto, K. Takahashi, and H. Ueda. KD-FGS: a knowledge discovery system from graph data using formal graph system. Proc. PAKDD-99, Springer-Verlag, LNAI 1574, pages 438\u2013442, 1999. 142, 153","DOI":"10.1007\/3-540-48912-6_58"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"S. Muggleton, A. Srinivasan, R.D. King, and M.J.E Sternberg. Biochemical knowledge discovery using inductive logic programming. Proc. DS-98, Springer-Verlag, LNAI 1532, pages 326\u2013341, 1998. 142","DOI":"10.1007\/3-540-49292-5_29"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0304-3975(95)91135-D","volume":"137","author":"Y. Mukouchi","year":"1995","unstructured":"Y. Mukouchi and S. Arikawa. Towards a mathematical theory of machine discovery from facts. Theoretical Computer Science, 137:53\u201384, 1995. 153, 154","journal-title":"Theoretical Computer Science"},{"key":"11_CR12","first-page":"81","volume":"1","author":"L. R. Quinlan","year":"1986","unstructured":"L. R. Quinlan. Induction of decision trees. Machine Learning 1, pages 81\u2013106, 1986. 142","journal-title":"Machine Learning"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J. Rissanen","year":"1978","unstructured":"J. Rissanen. Modeling by the shortest data description. Automatica 14, pages 465\u2013471, 1978. 143","journal-title":"Automatica"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1006\/inco.1994.1006","volume":"108","author":"T. Shinohara","year":"1994","unstructured":"T. Shinohara. Rich classes inferable from positive data: length-bounded elementary formal systems. Information and Computation, 108:175\u2013186, 1994. 154","journal-title":"Information and Computation"},{"key":"11_CR15","unstructured":"T. Uchida, T. Miyahara, and Y. Nakamura. Formal graph systems and node-label controlled graph grammars. Proc. 41st Inst. Syst. Control and Inf. Eng., pages 105\u2013106, 1997. 151, 153"},{"issue":"2","key":"11_CR16","first-page":"99","volume":"E78-D","author":"T. Uchida","year":"1995","unstructured":"T. Uchida, T. Shoudai, and S. Miyano. Parallel algorithm for refutation tree problem on formal graph systems. IEICE Transactions on Information and Systems, E78-D(2):99\u2013112, 1995. 142, 145, 149","journal-title":"IEICE Transactions on Information and Systems"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-40992-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T22:08:28Z","timestamp":1556489308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40992-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540412373","9783540409922"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-40992-0_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}