{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:53:07Z","timestamp":1742403187536},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540437048"},{"type":"electronic","value":"9783540478874"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-47887-6_35","type":"book-chapter","created":{"date-parts":[[2007,5,19]],"date-time":"2007-05-19T15:21:04Z","timestamp":1179588064000},"page":"341-355","source":"Crossref","is-referenced-by-count":34,"title":["Discovery of Frequent Tag Tree Patterns in Semistructured Web Documents"],"prefix":"10.1007","author":[{"given":"Tetsuhiro","family":"Miyahara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yusuke","family":"Suzuki","sequence":"additional","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":[[2002,4,29]]},"reference":[{"key":"35_CR1","unstructured":"S. Abiteboul, P. Buneman, and D. Suciu. Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, 2000."},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"T. Asai, K. Abe, S. Kawasoe, H. Arimura, H. Sakamoto, and S. Arikawa. Efficient substructure discovery from large semi-structured data. Proc. 2nd SIAM Int. Conf. Data Mining (SDM-2002) (to appear), 2002.","DOI":"10.1137\/1.9781611972726.10"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"C.-H. Chang, S.-C. Lui, and Y.-C. Wu. Applying pattern mining to web information extraction. Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-2001), Springer-Verlag, LNAI 2035, pages 4\u201315, 2001.","DOI":"10.1007\/3-540-45357-1_4"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"M. Fernandez and D. Suciu. Optimizing regular path expressions using graph schemas. Proceedings of the 14th International Conference on Data Engineering (ICDE-98), IEEE Computer Society, pages 14\u201323, 1998.","DOI":"10.1109\/ICDE.1998.655753"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"K. Furukawa, T. Uchida, K. Yamada, T. Miyahara, T. Shoudai, and Y. Nakamura. Extracting characteristic structures among words in semistructured documents. Proc. PAKDD-2002, Springer-Verlag, LNAI (to appear), 2002.","DOI":"10.1007\/3-540-47887-6_36"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0004-3702(99)00100-9","volume":"118","author":"N. Kushmerick","year":"2000","unstructured":"N. Kushmerick. Wrapper induction: efficiency and expressiveness. Artificial Intelligence, 118:15\u201368, 2000.","journal-title":"Artificial Intelligence"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"T. Miyahara, T. Shoudai, T. Uchida, K. Takahashi, and H. Ueda. Discovery of frequent tree structuted patterns in semistructured web documents. Proc. PAKDD-2001, Springer-Verlag, LNAI 2035, pages 47\u201352, 2001.","DOI":"10.1007\/3-540-45357-1_8"},{"key":"35_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/3-540-44669-9_32","volume-title":"Proc. FCT-2001, Springer-Verlag","author":"T. Shoudai","year":"2001","unstructured":"T. Shoudai, T. Uchida, and T. Miyahara. Polynomial time algorithms for finding unordered tree patterns with internal variables. Proc. FCT-2001, Springer-Verlag, LNCS 2138, pages 335\u2013346, 2001."},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0304-3975(88)90169-7","volume":"57","author":"W. Skarbek","year":"1988","unstructured":"W. Skarbek. Generating ordered trees. Theoretical Computer Science, 57:153\u2013159, 1988.","journal-title":"Theoretical Computer Science"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Y. Suzuki, T. Shoudai, T. Miyahara, and T. Uchida. Polynomial time inductive inference of ordered tree patterns with internal variables from positive data. Proc. LA Winter Symposium, Kyoto, Japan, pages 33-1\u201333-12, 2002.","DOI":"10.1007\/3-540-45435-7_12"},{"key":"35_CR11","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/69.846290","volume":"12","author":"K. Wang","year":"2000","unstructured":"K. Wang and H. Liu. Discovering structural association of semistructured data. IEEE Trans. Knowledge and Data Engineering, 12:353\u2013371, 2000.","journal-title":"IEEE Trans. Knowledge and Data Engineering"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47887-6_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T05:21:50Z","timestamp":1556428910000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47887-6_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540437048","9783540478874"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-47887-6_35","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}