{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:36:01Z","timestamp":1742916961668,"version":"3.40.3"},"publisher-location":"Dordrecht","reference-count":25,"publisher":"Springer Netherlands","isbn-type":[{"type":"print","value":"9789048197934"},{"type":"electronic","value":"9789048197941"}],"license":[{"start":{"date-parts":[[2010,8,18]],"date-time":"2010-08-18T00:00:00Z","timestamp":1282089600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,8,18]],"date-time":"2010-08-18T00:00:00Z","timestamp":1282089600000},"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":[[2011]]},"DOI":"10.1007\/978-90-481-9794-1_66","type":"book-chapter","created":{"date-parts":[[2010,9,17]],"date-time":"2010-09-17T21:21:08Z","timestamp":1284758468000},"page":"353-358","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data"],"prefix":"10.1007","author":[{"given":"Hiroki","family":"Arimura","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,8,18]]},"reference":[{"key":"66_CR1_66","unstructured":"S. Abiteboul, P. Buneman, D. Suciu, Data on the Web, Morgan Kaufmann, 2000."},{"key":"66_CR2_66","unstructured":"R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, A. I. Verkamo, Fast discovery of association rules, Advances in Knowledge Discovery and Data Mining, Chapter 12, AAAI Press\/The MIT Press, 1996."},{"key":"66_CR3_66","doi-asserted-by":"crossref","unstructured":"T. Asai, K. Abe, S. Kawasoe, H. Arimura, H. Sakamoto, S. Arikawa, Efficient Substructure Discovery from Large Semi-structured Data, Proc. SDM\u201902, 2002.","DOI":"10.1137\/1.9781611972726.10"},{"key":"66_CR4_66","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/978-3-540-39644-4_6","volume":"2843","author":"T. Asai","year":"2003","unstructured":"T. Asai, H. Arimura, T. Uno, S. Nakano, Discovering frequent substructures in large unordered trees, Discovery Science 2003, LNCS 2843, 47\u201361, 2003.","journal-title":"Discovery Science"},{"key":"66_CR5_66","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10878-006-9029-1","volume":"13","author":"H. Arimura","year":"2006","unstructured":"H. Arimura, T. Uno, An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence, Journal of Combinatorial Optimization, 13, 243\u2013262, 2006.","journal-title":"Journal of Combinatorial Optimization"},{"key":"66_CR6_66","first-page":"1","volume":"3625","author":"H. Arimura","year":"2005","unstructured":"H. Arimura, T. Uno, An output-polynomial time algorithm for mining frequent closed attribute trees, Proc. ILP\u201905, LNAI 3625, 1\u201319, August 2005.","journal-title":"Proc. ILP\u201905, LNAI"},{"key":"66_CR7_66","unstructured":"H. Arimura and T. Uno, A polynomial space and polynomial delay algorithm for enumerating maximal two-dimensional patterns with wildcards, Technical Report, TCS-TR-A-06-19, DCS, Hokkaido Univ., 18 July 2006."},{"key":"66_CR8_66","doi-asserted-by":"crossref","unstructured":"H. Arimura, Efficient algorithms for mining frequent and closed patterns from semi-structured data (invited talk), Proc. PAKDD\u201908, LNAI 5012, 2\u201313, 2008.","DOI":"10.1007\/978-3-540-68125-0_2"},{"key":"66_CR9_66","doi-asserted-by":"crossref","unstructured":"H. Arimura, T. Uno and S. Shimozono, Time and space efficient discovery of maximal geometric graphs, Proc. Discovery Science 2007, LNAI 4755, 42\u201355, 2007.","DOI":"10.1007\/978-3-540-75488-6_6"},{"key":"66_CR10_66","doi-asserted-by":"crossref","unstructured":"Hiroki Arimura and Takeaki Uno, Mining Maximal Flexible Patterns in a Sequence, Proc. LLLL\u201907, LNAI 4914, 2008.","DOI":"10.1007\/978-3-540-78197-4_29"},{"key":"66_CR11_66","doi-asserted-by":"crossref","unstructured":"H. Arimura and Takeaki Uno, Polynomial-delay and polynomial-space algorithms for mining closed sequences, graphs, and pictures in accessible set systems, Proc. the 9th SIAM Int\u2019l Conf. on Data Mining (SDM2009), 1087\u20131098, 2009.","DOI":"10.1137\/1.9781611972795.93"},{"key":"66_CR12_66","doi-asserted-by":"crossref","unstructured":"T. Asai, H. Arimura, K. Abe, S. Kawasoe, S. Arikawa, Online algorithms for mining semi-structured data stream, Proc. ICDM\u201902, IEEE, 27\u201334, 2002.","DOI":"10.1109\/ICDM.2002.1183882"},{"key":"66_CR13_66","doi-asserted-by":"crossref","unstructured":"T. Asai, H. Arimura, T. Uno, S. Nakano, Discovering frequent substructures in large unordered trees, Proc. Discovery Science 2003,LNAI, Springer, 2003.","DOI":"10.1007\/978-3-540-39644-4_6"},{"issue":"1\u20133","key":"66_CR14_66","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D. Avis","year":"1996","unstructured":"D. Avis, K. Fukuda, Reverse search for enumeration, Discrete Applied Mathematics, 65(1\u20133), 21\u201346, 1996.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"66_CR15_66","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"Y. Freund, R. E. Schapire, A decision-theoretic generalization of on-line learning and an application to boosting, J. Comput. Syst. Sci., 55(1): 119\u2013139, 1997.","journal-title":"J. Comput. Syst. Sci."},{"key":"66_CR16_66","doi-asserted-by":"crossref","unstructured":"D. Gunopulos, H. Mannila, R. Khardon, and H. Toivonen, Data mining, hypergraph transversals, and machine learning, Proc. PODS\u201997, ACM, 209\u2013216, 1997.","DOI":"10.1145\/263661.263684"},{"issue":"3","key":"66_CR17_66","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/A:1021726221443","volume":"50","author":"A. Inokuchi","year":"2003","unstructured":"A. Inokuchi, T. Washio, H. Motoda, Complete mining of frequent patterns from graphs: mining graph data, Machine Learning, 50(3), 321\u2013354, 2003.","journal-title":"Machine Learning"},{"key":"66_CR18_66","doi-asserted-by":"crossref","unstructured":"T. Katoh, H. Arimura and K. Hirata, Mining frequent k-partite episodes from event sequences, Proc. Discovery Science 2009, LNAI 5808, 136\u2013151, 2009.","DOI":"10.1007\/978-3-642-04747-3_13"},{"key":"66_CR19_66","doi-asserted-by":"crossref","unstructured":"T. Katoh, H. Arimura and K. Hirata, A polynomial-delay polynomial-space algorithm for extracting frequent diamond episodes from event sequences, Proc. PAKDD\u201909, LNAI 5476, Springer, 172\u2013183, 2009.","DOI":"10.1007\/978-3-642-01307-2_18"},{"key":"66_CR20_66","doi-asserted-by":"crossref","unstructured":"T. Katoh, K. Hirata, H. Arimura, S. Yokoyama and K. Matsuoka, Extracting sequential episodes representing replacements of bacteria from bacterial culture data, Proc. Complex Medical Engineering 2009, IEEE\/ICME, 2009.","DOI":"10.1109\/ICCME.2009.4906612"},{"issue":"259","key":"66_CR21_66","first-page":"289","volume":"1","author":"H. Mannila","year":"1997","unstructured":"H. Mannila, H. Toivonen, A. I. Verkamo Discovery of frequent episodes in event sequences, Data Mining and Knowledge Discovery 1, 259.289, 1997.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"66_CR22_66","doi-asserted-by":"crossref","unstructured":"S. Morinaga, H. Arimura, T. Ikeda, Y. Sakao, S. Akamine, Key Semantics Extraction by Dependency Tree Mining, Proc. KDD\u201905, ACM, 666\u2013671, 2005.","DOI":"10.1145\/1081870.1081954"},{"key":"66_CR23_66","doi-asserted-by":"crossref","unstructured":"Koji Tsuda, Taku Kudo, Clustering graphs by weighted substructure mining, ICML 2006, 953\u2013960, 2006.","DOI":"10.1145\/1143844.1143964"},{"key":"66_CR24_66","doi-asserted-by":"crossref","unstructured":"T. Uno, T. Asai, Y. Uchida, H. Arimura, An efficient algorithm for enumerating closed patterns in transaction databases, Proc. Discovery Science 2004, LNAI 3245, Springer, 16\u201330, 2004.","DOI":"10.1007\/978-3-540-30214-8_2"},{"key":"66_CR25_66","doi-asserted-by":"crossref","unstructured":"M. J. Zaki. Efficiently mining frequent trees in a forest, In Proc. SIGKDD\u201902, ACM, 2002.","DOI":"10.1145\/775047.775058"}],"container-title":["Lecture Notes in Electrical Engineering","Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-90-481-9794-1_66","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T22:20:56Z","timestamp":1740522056000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-90-481-9794-1_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,18]]},"ISBN":["9789048197934","9789048197941"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-90-481-9794-1_66","relation":{},"ISSN":["1876-1100","1876-1119"],"issn-type":[{"type":"print","value":"1876-1100"},{"type":"electronic","value":"1876-1119"}],"subject":[],"published":{"date-parts":[[2010,8,18]]},"assertion":[{"value":"18 August 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}