{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T22:40:02Z","timestamp":1737067202495,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429562"},{"type":"electronic","value":"9783540456506"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[[2001]]},"DOI":"10.1007\/3-540-45650-3_32","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T21:48:45Z","timestamp":1180907325000},"page":"378-388","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Mining Semi-structured Data by Path Expressions"],"prefix":"10.1007","author":[{"given":"Katsuaki","family":"Taniguchi","sequence":"first","affiliation":[]},{"given":"Hiroshi","family":"Sakamoto","sequence":"additional","affiliation":[]},{"given":"Hiroki","family":"Arimura","sequence":"additional","affiliation":[]},{"given":"Shinichi","family":"Shimozono","sequence":"additional","affiliation":[]},{"given":"Setsuo","family":"Arikawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,12,20]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF03037568","volume":"18","author":"S. Shimozono","year":"2000","unstructured":"Shimozono, S., Arimura, H., and Arikawa, S. Efficient discovery of optimal wordassociation patterns in large text databases. New Generation Computing 18:49\u201360, 2000.","journal-title":"New Generation Computing"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S. Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. Proc. 37th IEEE Symposium on Foundations of Computer Science, 2\u201312, 1996.","DOI":"10.1109\/SFCS.1996.548458"},{"key":"32_CR3","volume-title":"Data on the Web: From relations to semistructured data and XML","author":"S. Abiteboul","year":"2000","unstructured":"Abiteboul, S., Buneman, P., and Suciu, D. Data on the Web: From relations to semistructured data and XML, Morgan Kaufmann, San Francisco, CA, 2000."},{"key":"32_CR4","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D. Queries and concept learning. Machine Learning 2:319\u2013342, 1988.","journal-title":"Machine Learning"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Buneman, P., Davidson, S., Hillebrand, G., and Suciu, D. A query language and optimization techniques for unstructured data. University ofPennsylvania, Computer and Information Science Department, Technical Report MS-CIS 96-09, 1996.","DOI":"10.1145\/233269.233368"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Cohen, W. W. and Fan, W. Learning Page-Independent Heuristics for Extracting Data from Web Pages, Proc. WWW-99. 1999.","DOI":"10.1016\/S1389-1286(99)00047-X"},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0004-3702(00)00004-7","volume":"118","author":"M. Craven","year":"2000","unstructured":"Craven, M., DiPasquo, D., Freitag, D., McCallum, A., Mitchell, T., Nigam, K., and Slattery, S. Learning to construct knowledge bases from the World Wide Web, Artificial Intelligence 118:69\u2013113, 2000.","journal-title":"Artificial Intelligence"},{"key":"32_CR8","unstructured":"Freitag, D. Information extraction from HTML: Application of a general machine learning approach. Proc. the 15th National Conference on Artificial Intelligence, 517\u2013523, 1998"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Grieser, G., Jantke, K. P., Lange, S., and Thomas, B. A unifying approach to HTML wrapper representation and learning, Proc. the 3rd International Conference, DS2000, Lecture Notes in Artificial Intelligence 1967:50\u201364, 2000.","DOI":"10.1007\/3-540-44418-1_5"},{"key":"32_CR10","unstructured":"Hammer, J., Garcia-Molina, H., Cho, J., and Crespo, A. Extracting semistructured information from the Web. Proc. Workshop on Management ofSemistructur ed Data, 18\u201325, 1997."},{"key":"32_CR11","unstructured":"Hsu, C.-N. Initial results on wrapping semistructured web pages with finite-state transducers and contextual rules. Proc. 1998 Workshop on AI and Information Integration, 66\u201373, 1998."},{"key":"32_CR12","unstructured":"Kamada, T. Compact HTML for small information appliances. W3C NOTE 09-Feb-1998. http:\/\/www.w3.org\/TR\/1998\/NOTE-compactHTML-19980209 , 1998."},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0004-3702(99)00100-9","volume":"118","author":"N. Kushmerick","year":"2000","unstructured":"Kushmerick, N. Wrapper induction:efficiency and expressiveness. Artificial Intelligence 118:15\u201368,2000.","journal-title":"Artificial Intelligence"},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S.,and Kernighan, B.W. An effective heuristic algorithm for the travelling salesman problem.Operations Research 21:498\u2013516,1973.","journal-title":"Operations Research"},{"key":"32_CR15","unstructured":"Muslea, I., Minton, S.,and Knoblock, C. A. Wrapper induction for semistructured, web-based information sources.Proc.Conference on Automated Learning and Discovery,1998."},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Sakamoto, H., Arimura, H.,and Arikawa, S. Identification of tree translation rules from examples.Proc.the 5th International Colloquium on Grammatical Inference, LNAI 1891:241\u2013255,2000.","DOI":"10.1007\/978-3-540-45257-7_20"},{"key":"32_CR17","unstructured":"Thomas, B. Anti-unification based learning of T-Wrappers for information extraction,Proc.AAAI Workshop on Machine Learning for IE,15\u201320,AAAI,1999."},{"key":"32_CR18","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L.G. Valiant","year":"1984","unstructured":"Valiant, L.G. A theory of the learnable.Comm.ACM 27:1134\u20131142,1984.","journal-title":"Comm.ACM"},{"key":"32_CR19","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/191843.191863","volume":"\u201994","author":"J.T. Wang","year":"1994","unstructured":"Wang, J.T., Chirn, G.W., Marr, T.G., Shapiro, B., Shasha, D.,and Zhang, K. Combinatorial pattern discovery for scientific data:Some preliminary results.Proc. SIGMOD\u201994,115\u2013125,1994.","journal-title":"Proc. SIGMOD"}],"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-45650-3_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T22:06:38Z","timestamp":1737065198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45650-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429562","9783540456506"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45650-3_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"20 December 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}