{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:42:32Z","timestamp":1725493352241},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001881"},{"type":"electronic","value":"9783540361824"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1007\/3-540-36182-0_32","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T17:10:33Z","timestamp":1193505033000},"page":"324-331","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Discovery of Maximal Analogies between Stories"],"prefix":"10.1007","author":[{"given":"Makoto","family":"Haraguchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigetora","family":"Nakano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaharu","family":"Yoshioka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"32_CR1","unstructured":"R. Agrawal, R. Srikant:: Fast Algorithms for Mining Association Rules, Proc. of the 20th Int\u2019l Conf. on Very Large Data Bases, pp. 478\u2013499, 1994."},{"issue":"2\u20133","key":"32_CR2","first-page":"169","volume":"17","author":"W. W. Cohen","year":"1996","unstructured":"W. W. Cohen & H. Hirsh: The Learnability of Description Logics with Equality Constraints, Machine Learning, Vol. 17, No. 2\u20133, pp 169\u2013199, 1996.","journal-title":"Machine Learning"},{"key":"32_CR3","unstructured":"Y. Ohsawa, N. E. Benson and M. Yachida: KeyGraph: automatic indexing by co-occurrence graph based on building construction metaphor, Proc. of IEEE International Forum on Research and Technology: Advances in Digital Libraries-ADL\u201998, pp.12\u201318, 1998."},{"key":"32_CR4","unstructured":"J. Sowa ed. Principles of Semantic Networks, Morgan Kaufmann,1991."}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36182-0_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:40:46Z","timestamp":1558276846000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36182-0_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001881","9783540361824"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-36182-0_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"8 November 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}