{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:36:05Z","timestamp":1725564965255},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540260769"},{"type":"electronic","value":"9783540319351"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11430919_101","type":"book-chapter","created":{"date-parts":[[2010,9,7]],"date-time":"2010-09-07T06:06:46Z","timestamp":1283839606000},"page":"850-860","source":"Crossref","is-referenced-by-count":3,"title":["Mining Frequent Trees with Node-Inclusion Constraints"],"prefix":"10.1007","author":[{"given":"Atsuyoshi","family":"Nakamura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mineichi","family":"Kudo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"101_CR1","unstructured":"Agrawal, R., Srikant, R.: First algorithms for mining association rules. In: Proc. 20th Int\u2019l Conf. on VLDB, pp. 487\u2013499 (1994)"},{"key":"101_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Mining sequential patterns. In: Proc. 11th Int\u2019l Conf. on Data Eng., pp. 3\u201314 (1995)","DOI":"10.1109\/ICDE.1995.380415"},{"key":"101_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\u2019l Conf. on Data Mining, pp. 158\u2013174 (2002)","DOI":"10.1137\/1.9781611972726.10"},{"key":"101_CR4","doi-asserted-by":"crossref","unstructured":"Cohen, W.W., Hurst, M., Jensen, L.S.: A flexible learning system for wrapping tables and lists in HTML documents. In: Proc. 11th Int\u2019l World Wide Web Conf., pp. 232\u2013241 (2002)","DOI":"10.1145\/511446.511477"},{"issue":"3","key":"101_CR5","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TKDE.2002.1000341","volume":"14","author":"M. Garofalakis","year":"2002","unstructured":"Garofalakis, M., Rastogi, R., Shim, K.: Mining sequential patterns with regular expression constraints. IEEE Transactions on Knowledge and Data Engineering\u00a014(3), 530\u2013552 (2002)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"101_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"A. Inokuchi","year":"2000","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Zighed, D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol.\u00a01910, pp. 13\u201323. Springer, Heidelberg (2000)"},{"key":"101_CR7","unstructured":"Hasegawa, H., Kudo, M., Nakamura, A.: Reputation Extraction Using Both Structural and Content Information. Technical Report TCS-TR-A-05-2 (2005), http:\/\/www-alg.ist.hokudai.ac.jp\/tra.html"},{"key":"101_CR8","doi-asserted-by":"crossref","unstructured":"Kushmerick, N.: Wrapper induction:efficiency and expressiveness. Artificial Intelligence (118), 15\u201368 (2000)","DOI":"10.1016\/S0004-3702(99)00100-9"},{"key":"101_CR9","unstructured":"Srikant, R., Vu, Q., Agrawal, R.: Mining association rules with item constraints. In: Proc. 3rd Int\u2019l Conf. on Knowledge Discovery and Data Mining, pp. 67\u201373 (1997)"},{"key":"101_CR10","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Efficiently mining frequent trees in a forest. In: Proc. SIGKDD 2002, pp. 71\u201380 (2002)","DOI":"10.1145\/775047.775058"}],"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\/11430919_101.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:57:30Z","timestamp":1605643050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11430919_101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540260769","9783540319351"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11430919_101","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}