{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T17:10:01Z","timestamp":1749575401087,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440376"},{"type":"electronic","value":"9783540456810"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1007\/3-540-45681-3_1","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T11:03:25Z","timestamp":1192791805000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Optimized Substructure Discovery for Semi-structured Data"],"prefix":"10.1007","author":[{"given":"Kenji","family":"Abe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinji","family":"Kawasoe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tatsuya","family":"Asai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroki","family":"Arimura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Setsuo","family":"Arikawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,18]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"K. Abe, S. Kawasoe, T. Asai, H. Arimura, S. Arikawa, Optimized substructure discovery for semi-structured data, DOI, Kyushu Univ., DOI-TR-206, Mar. 2002. ftp:\/\/ftp.i.kyushu-u.ac.jp\/pub\/tr\/trcs206.ps.gz","DOI":"10.1007\/3-540-45681-3_1"},{"key":"1_CR2","unstructured":"S. Abiteboul, P. Buneman, and D. Suciu. Data on the Web. Morgan Kaufmann, 2000."},{"key":"1_CR3","unstructured":"R. Agrawal, R. Srikant, Fast algorithms for mining association rules, In Proc. VLDB\u201994\/, 487\u2013499, 1994."},{"key":"1_CR4","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman. Data Structures and Algorithms. Addison-Wesley, 1983."},{"key":"1_CR5","first-page":"247","volume":"1501","author":"H. Arimura","year":"1998","unstructured":"H. Arimura, A. Wataki, R. Fujino, S. Arikawa, An efficient algorithm for text data mining with optimal string patterns, In Proc. ALT\u201998, LNAI 1501, 247\u2013261, 1998.","journal-title":"LNAI"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"H. Arimura, J. Abe, R. Fujino, H. Sakamoto, S. Shimozono, S. Arikawa, Text Data Mining: Discovery of Important Keywords in the Cyberspace, In Proc. IEEE Kyoto Int\u2019l Conf. on Digital Libraries, 2000.","DOI":"10.1109\/DLRP.2000.942178"},{"key":"1_CR7","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. In Proc. the 2nd SIAM Int\u2019l Conf. on Data Mining (SDM2002), 158\u2013174, 2002.","DOI":"10.1137\/1.9781611972726.10"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"R. J. Bayardo Jr. Efficiently mining long patterns from databases. In Proc. SIGMOD98, 85\u201393, 1998.","DOI":"10.1145\/276304.276313"},{"key":"1_CR9","unstructured":"S. Ben-David, N. Eiron, and P. M. Long, On the difficulty of Approximately Maximizing Agreements, In Proc. COLT 2000, 266\u2013274, 2000."},{"key":"1_CR10","unstructured":"L. Dehaspe, H. Toivonen, and R. D. King. Finding frequent substructures in chemical compounds. In Proc. KDD-98, 30\u201336, 1998."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"L. Devroye, L. Gyor., G. Lugosi, A Probablistic Theory of Pattern Recognition, Springer-Verlag, 1996.","DOI":"10.1007\/978-1-4612-0711-5"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"R. Fujino, H. Arimura, S. Arikawa, Discovering unordered and ordered phrase association patterns for text mining. In Proc. PAKDD2000, LNAI 1805, 2000.","DOI":"10.1007\/3-540-45571-X_34"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"T. Fukuda, Y. Morimoto, S. Morishita, and T. Tokuyama. Data mining using two-dimensional optimized association rules. In Proc. SIGMOD\u201996, 13\u201323, 1996.","DOI":"10.1145\/233269.233313"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1022631118932","volume":"11","author":"R. C. Holte","year":"1993","unstructured":"R. C. Holte, Very simple classification rules perform well on most commonly used datasets, Machine Learning, 11, 63\u201391, 1993.","journal-title":"Machine Learning"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"A. Inokuchi, T. Washio and H. Motoda An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data, In Proc. PKDD 2000, 13\u201323, 2000.","DOI":"10.1007\/3-540-45372-5_2"},{"issue":"2","key":"1_CR16","first-page":"115","volume":"17","author":"M. J. Kearns","year":"1994","unstructured":"M. J. Kearns, R. E. Shapire, L. M. Sellie, Toward efficient agnostic learning. Machine Learning, 17(2\u20133), 115\u2013141, 1994.","journal-title":"Machine Learning"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"W. Maass, Efficient agnostic PAC-learning with simple hypothesis, In Proc. COLT94, 67\u201375, 1994.","DOI":"10.1145\/180139.181016"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"T. Matsuda, T. Horiuchi, H. Motoda, T. Washio, et al., Graph-based induction for general graph structured data. In Proc. DS\u201999, 340\u2013342, 1999.","DOI":"10.1007\/3-540-46846-3_39"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"T. Miyahara, T. Shoudai, T. Uchida, K. Takahashi, and H. Ueda. Discovery of frequent tree structured patterns in semistructured web documents. In Proc. PAKDD-2001, 47\u201352, 2001.","DOI":"10.1007\/3-540-45357-1_8"},{"key":"1_CR20","first-page":"49","volume":"1532","author":"S. Morishita","year":"1998","unstructured":"S. Morishita, On classification and regression, In Proc. Discovery Science\u2019 98, LNAI 1532, 49\u201359, 1998.","journal-title":"LNAI"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"S. Morishita and J. Sese, Traversing Itemset Lattices with Statistical Metric Pruning, In Proc. PODS\u201900, 226\u2013236, 2000.","DOI":"10.1145\/335168.335226"},{"key":"1_CR22","volume-title":"C4.5: Program for Machine Learning","author":"J. R. Quinlan","year":"1993","unstructured":"J. R. Quinlan, C4.5: Program for Machine Learning, Morgan Kaufmann Publishers, San Mateo, CA, 1993."},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"R. Rastogi, K. Shim, Mining Optimized Association Rules with Categorical and Numeric Attributes, In Proc. ICDE\u201998, 503\u2013512, 1998.","DOI":"10.1109\/ICDE.1998.655813"},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF03037568","volume":"18","author":"H. Arimura","year":"2000","unstructured":"H. Arimura, S. Arikawa, S. Shimozono, Efficient discovery of optimal wordassociation patterns in large text databases New Gener. Comput., 18, 49\u201360, 2000.","journal-title":"New Gener. Comput."},{"key":"1_CR25","volume-title":"Approximaiton Algorithms","author":"V. V. Vazirani","year":"1998","unstructured":"V. V. Vazirani, Approximaiton Algorithms, Springer, Berlin, 1998."},{"key":"1_CR26","unstructured":"W3C Recommendation. Extensibe Markup Language (XML) 1.0, second edition, 06 October 2000. http:\/\/www.w3.org\/TR\/REC-xml."},{"issue":"3","key":"1_CR27","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/69.846290","volume":"12","author":"K. Wang","year":"2000","unstructured":"K. Wang and H. Q. Liu. Discovering structual association of semistructured data. IEEE Trans. Knowledge and Data Engineering (TKDE2000), 12(3):353\u2013371, 2000.","journal-title":"IEEE Trans. Knowledge and Data Engineering (TKDE2000)"},{"key":"1_CR28","unstructured":"M. J. Zaki. Efficiently mining frequent trees in a forest. Computer Science Department, Rensselaer Ploytechnic Institute, PRI-TR01-7-2001, 2001. http:\/\/www.cs.rpi.edu\/~zaki\/PS\/TR01-7.ps.gz"}],"container-title":["Lecture Notes in Computer Science","Principles of Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45681-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T16:35:26Z","timestamp":1749573326000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45681-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440376","9783540456810"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-45681-3_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"18 September 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}