{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:43:38Z","timestamp":1725493418560},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540673828"},{"type":"electronic","value":"9783540455714"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45571-x_4","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:37:57Z","timestamp":1184603877000},"page":"5-16","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Polynomial Time Matching Algorithms for Tree-Like Structured Patterns in Knowledge Discovery"],"prefix":"10.1007","author":[{"given":"Tetsuhiro","family":"Miyahara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takayoshi","family":"Shoudai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoyuki","family":"Uchida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenichi","family":"Takahashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroaki","family":"Ueda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,3,24]]},"reference":[{"key":"4_CR1","unstructured":"S. D\u017eeroski. Inductive logic programming and knowledge discovery in databases. Advances in Knowledges Discovery and Data Mining, MIT Press, pages 118\u2013152, 1996."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"S. D\u017eeroski, N. Jacobs, M. Molina, C. Moure, S. Muggleton, and W. V. Laer. Detecting traffic problems with ILP. Proc. ILP-98, Springer-Verlag, LNAI 1446, pages 281\u2013290, 1998.","DOI":"10.1007\/BFb0027332"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1009863704807","volume":"3","author":"L. Dehaspe","year":"1999","unstructured":"L. Dehaspe and H. Toivonen. Discovery of frequent datalog patterns. Data Mining and Knowledge Discovery, 3:7\u201336, 1999.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"4_CR4","unstructured":"L. Dehaspe, H. Toivonen, and R. King. Finding frequent substructures in chemical compounds. Proceedings of the Third International Conference Knowledge Discovery and Data Mining, AAAI Press, pages 30\u201336, 1998."},{"key":"4_CR5","unstructured":"M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"S. Matsumoto, Y. Hayashi, and T. Shoudai. Polynomial time inductive inference of regular term tree languages from positive data. Proc. ALT-97, Springer-Verlag, LNAI 1316, pages 212\u2013227, 1997.","DOI":"10.1007\/3-540-63577-7_45"},{"key":"4_CR7","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.","DOI":"10.1007\/3-540-48751-4_21"},{"key":"4_CR8","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.","DOI":"10.1007\/3-540-48912-6_58"},{"key":"4_CR9","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.","journal-title":"Theoretical Computer Science"},{"key":"4_CR10","unstructured":"H. Toivonen. On knowledge discovery in graph-structured data. Proceedings of the PAKDD Workshop on Knowledge Discovery from Advanced Databases (KDAD-99), 1999."},{"issue":"2","key":"4_CR11","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.","journal-title":"IEICE Transactions on Information and Systems"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery and Data Mining. Current Issues and New Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45571-X_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T23:40:48Z","timestamp":1558482048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45571-X_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540673828","9783540455714"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45571-x_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"24 March 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}