{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:46:25Z","timestamp":1725558385219},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540201441"},{"type":"electronic","value":"9783540399179"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39917-9_25","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T04:02:15Z","timestamp":1277697735000},"page":"383-400","source":"Crossref","is-referenced-by-count":6,"title":["An Effective Grammar-Based Compression Algorithm for Tree Structured Data"],"prefix":"10.1007","author":[{"given":"Kazunori","family":"Yamagata","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":"Yasuaki","family":"Nakamura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","volume-title":"Data on the Web: From Relations to Semistructured Data and XML","author":"S. Abiteboul","year":"2000","unstructured":"Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, San Francisco (2000)"},{"key":"25_CR2","volume-title":"Data Structures and Algorithms","author":"A.V. Aho","year":"1983","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms. Addison-Wesley, Reading (1983)"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Asai, T., Abe, K., Kawasoe, S., Arimura, H., Sakamoto, H., Arikawa, S.: Efficient substructure discovery from large semi-structured data. In: Proc. 2nd SIAM Int. Conf. Data Mining (SDM 2002), pp. 158\u2013174 (2002)","DOI":"10.1137\/1.9781611972726.10"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Charikar, M., Lehman, E., Liu, D., Panigrahy, R.: Approximating the smallest grammar: Kolmogorov Complexity in natural models. In: Proc. 34th ACM STOC 2002, pp. 792\u2013801 (2002)","DOI":"10.1145\/509907.510021"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/5254.850825","volume":"15","author":"D.J. Cook","year":"2000","unstructured":"Cook, D.J., Holder, L.B.: Graph-based data mining. IEEE Intelligent Systems\u00a015, 32\u201341 (2000)","journal-title":"IEEE Intelligent Systems"},{"volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","year":"1997","key":"25_CR6","unstructured":"Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a01. World Scientific Publishing, Singapore (1997)"},{"key":"25_CR7","series-title":"LNAI","first-page":"582","volume-title":"Proc. PAKDD-2003","author":"Y. Itokawa","year":"2003","unstructured":"Itokawa, Y., Uchida, T., Shoudai, T., Miyahara, T., Nakamura, Y.: Finding frequent subgraphs from graph structured data with geometric information and its application to lossless. In: Proc. PAKDD-2003. LNCS (LNAI), vol.\u00a02637, pp. 582\u2013594. Springer, Heidelberg (2003)"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1109\/18.841160","volume":"46","author":"J.C. Kieffer","year":"2000","unstructured":"Kieffer, J.C., Yang, E.-h.: Grammar based codes: A new class of universal lossless source codes. IEEE Transactions on Information Theory\u00a046, 737\u2013754 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"25_CR9","unstructured":"Lehman, E., Shelat, A.: Approximations algorithms for grammar-based compression. In: Proc. SODA 2002, pp. 205\u2013212 (2002)"},{"key":"25_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/3-540-36187-1_46","volume-title":"AI 2002: Advances in Artificial Intelligence","author":"S. Matsumoto","year":"2002","unstructured":"Matsumoto, S., Shoudai, T., Miyahara, T., Uchida, T.: Learning of finite unions of tree patterns with internal structured variables from queries. In: McKay, B., Slaney, J.K. (eds.) Canadian AI 2002. LNCS (LNAI), vol.\u00a02557, pp. 523\u2013534. Springer, Heidelberg (2002)"},{"key":"25_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/3-540-47887-6_35","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"T. Miyahara","year":"2002","unstructured":"Miyahara, T., Suzuki, Y., Shoudai, T., Uchida, T., Takahashi, K., Ueda, H.: Discovery of frequent tag tree patterns in semistructured web documents. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol.\u00a02336, pp. 341\u2013355. Springer, Heidelberg (2002)"},{"issue":"2\/3","key":"25_CR12","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1093\/comjnl\/40.2_and_3.103","volume":"40","author":"C. Nevill-Manning","year":"1997","unstructured":"Nevill-Manning, C., Witten, I.: Compression and explanation using hierarchical grammars. Computer Journal\u00a040(2\/3), 103\u2013116 (1997)","journal-title":"Computer Journal"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Sakamoto, H.: A fully linear-time approximation algorithm for grammar-based compression. DOI Technical Report 214, Department of Informatics, Kyushu University (2003)","DOI":"10.1007\/3-540-44888-8_25"},{"key":"25_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/3-540-45435-7_12","volume-title":"Computational Learning Theory","author":"Y. Suzuki","year":"2002","unstructured":"Suzuki, Y., Akanuma, R., Shoudai, T., Miyahara, T., Uchida, T.: Polynomial time inductive inference of ordered tree patterns with internal structured variables from positive data. In: Kivinen, J., Sloan, R.H. (eds.) COLT 2002. LNCS (LNAI), vol.\u00a02375, pp. 169\u2013184. Springer, Heidelberg (2002)"},{"key":"25_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/3-540-40992-0_11","volume-title":"Algorithmic Learning Theory","author":"T. Uchida","year":"2000","unstructured":"Uchida, T., Itokawa, Y., Shoudai, T., Miyahara, T., Nakamura, Y.: A new framework for discovering knowledge from two-dimensional structured data using layout formal graph system. In: Arimura, H., Sharma, A.K., Jain, S. (eds.) ALT 2000. LNCS (LNAI), vol.\u00a01968, pp. 141\u2013155. Springer, Heidelberg (2000)"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/69.846290","volume":"12","author":"K. Wang","year":"2000","unstructured":"Wang, K., Liu, H.: Discovering structural association of semistructured data. IEEE Trans. Knowledge and Data Engineering\u00a012, 353\u2013371 (2000)","journal-title":"IEEE Trans. Knowledge and Data Engineering"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39917-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T13:33:49Z","timestamp":1559223229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39917-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201441","9783540399179"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39917-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}