{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:53:26Z","timestamp":1743054806933,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540047605"},{"type":"electronic","value":"9783540361756"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36175-8_58","type":"book-chapter","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T16:17:08Z","timestamp":1183479428000},"page":"582-594","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Finding Frequent Subgraphs from Graph Structured Data with Geometric Information and Its Application to Lossless Compression"],"prefix":"10.1007","author":[{"given":"Yuko","family":"Itokawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoyuki","family":"Uchida","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":[[2003,4,30]]},"reference":[{"key":"58_CR1","unstructured":"R. Agrawal and R. Srikant. Fast algorithms for mining association rules. Proc. of the 20th VLDB Conference, pages 487\u2013499, 1994."},{"key":"58_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.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"2","key":"58_CR3","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/5254.850825","volume":"15","author":"D. J. Cook","year":"2000","unstructured":"D. J. Cook and L. B. Holder. Graph-based data mining. IEEE Intelligent Systems, 15(2):32\u201341, 2000.","journal-title":"IEEE Intelligent Systems"},{"key":"58_CR4","doi-asserted-by":"crossref","unstructured":"A. Inokuchi, T. Washio, and H. Motoda. An Apriori-based algorithm for mining frequent substructures from graph data. Proc. PAKDD-2000, Springer-Verlag, LNAI 1805, pages 13\u201323, 2000.","DOI":"10.1007\/3-540-45372-5_2"},{"key":"58_CR5","doi-asserted-by":"crossref","unstructured":"T. Matsuda, T. Horiuchi, H. Motoda, and T. Washio. Extension of graph-based induction for general graph structured data. Proc. PAKDD-2000, Springer-Verlag, LNAI 1805, pages 420\u2013431, 2000.","DOI":"10.1007\/3-540-45571-X_49"},{"issue":"1","key":"58_CR6","first-page":"48","volume":"E84-D","author":"T. Miyahara","year":"2001","unstructured":"T. Miyahara, T. Uchida, T. Shoudai, T. Kuboyama, K. Takahashi, and H. Ueda. Discovering knowledge from graph structured data by using refutably inductive inference of formal graph systems. IEICE Trans. Inf. Syst., E84-D(1):48\u201356, 2001.","journal-title":"IEICE Trans. Inf. Syst."},{"key":"58_CR7","doi-asserted-by":"crossref","unstructured":"T. Uchida, Y. Itokawa, T. Shoudai, T. Miyahara, and Y. Nakamura. A new framework for discovering knowledge from two-dimensional structured data using layout formal graph system. Proc. ALT-00, Springer-Verlag, LNAI 1968, pages 141\u2013155, 2000.","DOI":"10.1007\/3-540-40992-0_11"},{"issue":"2","key":"58_CR8","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 Trans. Inf. Syst., E78-D(2):99\u2013112, 1995.","journal-title":"IEICE Trans. Inf. Syst."}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36175-8_58","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T21:58:27Z","timestamp":1675893507000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-36175-8_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540047605","9783540361756"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-36175-8_58","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"30 April 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}