{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:23Z","timestamp":1761611243971},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,6,12]],"date-time":"2009-06-12T00:00:00Z","timestamp":1244764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2009,7]]},"DOI":"10.1007\/s10994-009-5115-9","type":"journal-article","created":{"date-parts":[[2009,6,11]],"date-time":"2009-06-11T19:20:33Z","timestamp":1244748033000},"page":"137-173","source":"Crossref","is-referenced-by-count":18,"title":["Learning block-preserving graph patterns and its application to data mining"],"prefix":"10.1007","volume":"76","author":[{"given":"Hitoshi","family":"Yamasaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yosuke","family":"Sasaki","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":"Yusuke","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,6,12]]},"reference":[{"key":"5115_CR1","unstructured":"Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules. In Proceedings of the 20th VLDB conference (pp. 487\u2013499)."},{"key":"5115_CR2","volume-title":"The design and analysis of computer algorithms","author":"A. V. Aho","year":"1974","unstructured":"Aho, A. V., Hopcroft, J. D., & Ullman, J. D. (1974). The design and analysis of computer algorithms. Reading: Addison-Wesley."},{"key":"5115_CR3","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"Angluin, D. (1980a). Finding patterns common to a set of strings. Journal of Computer and System Science, 21, 46\u201362.","journal-title":"Journal of Computer and System Science"},{"key":"5115_CR4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Angluin","year":"1980","unstructured":"Angluin, D. (1980b). Inductive inference of formal languages from positive data. Information and Control, 45, 117\u2013135.","journal-title":"Information and Control"},{"key":"5115_CR5","series-title":"LNCS(LNAI)","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/3-540-45583-3_24","volume-title":"Proceedings of the 12th workshop on algorithmic learning theory","author":"H. Arimura","year":"2001","unstructured":"Arimura, H., Sakamoto, H., & Arikawa, S. (2001). Efficient learning of semi-structured data from queries. In LNCS(LNAI): Vol.\u00a02225. Proceedings of the 12th workshop on algorithmic learning theory (pp. 315\u2013331). Berlin: Springer."},{"key":"5115_CR6","doi-asserted-by":"crossref","unstructured":"Asai, T., Abe, K., Kawasoe, S., Arimura, H., Sakamoto, H., & Arikawa, S. (2002). Efficient substructure discovery from large semi-structured data. In Proceedings of the second SIAM international conference on data mining (SDM-2002) (pp. 158\u2013174).","DOI":"10.1137\/1.9781611972726.10"},{"key":"5115_CR7","series-title":"LNCS(LNAI)","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/978-3-540-39644-4_6","volume-title":"Discovery science (DS-2003)","author":"T. Asai","year":"2003","unstructured":"Asai, T., Arimura, H., Uno, T., & Nakano, S. (2003). Discovering frequent substructures in large unordered trees. In LNCS(LNAI): Vol.\u00a02843. Discovery science (DS-2003) (pp. 47\u201361). Berlin: Springer."},{"key":"5115_CR8","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1613\/jair.43","volume":"1","author":"D. J. Cook","year":"1994","unstructured":"Cook, D. J., & Holder, L. (1994). Substructure discovery using minimum description length and background knowledge. Journal of Artificial Intelligence Research, 1, 231\u2013255.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"5115_CR9","volume-title":"Mining graph data","author":"D. J. Cook","year":"2007","unstructured":"Cook, D. J., & Holder, L. (2007). Mining graph data. New York: Wiley-Interscience."},{"key":"5115_CR10","first-page":"1277","volume":"11","author":"E. A. Dinic","year":"1970","unstructured":"Dinic, E. A. (1970). Algorithm for solution of a problem of maximum flow in a network with power estimation. Soviet Mathematics Doklady, 11, 1277\u20131280.","journal-title":"Soviet Mathematics Doklady"},{"key":"5115_CR11","doi-asserted-by":"crossref","unstructured":"Fung, B. C. M., Wang, K., & Ester, M. (2003). Hierarchical document clustering using frequent itemsets. In Proceedings of the 3rd SIAM international conference on data mining (SDM-2003) (pp. 59\u201370).","DOI":"10.1137\/1.9781611972733.6"},{"key":"5115_CR12","volume-title":"Data mining: concepts and techniques","author":"J. Han","year":"2001","unstructured":"Han, J., & Kamber, M. (2001). Data mining: concepts and techniques. San Mateo: Morgan Kaufmann."},{"issue":"1","key":"5115_CR13","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J. Han","year":"2004","unstructured":"Han, J., Pei, J., Yin, Y., & Mao, R. (2004). Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Mining and Knowledge Discovery, 8(1), 53\u201387.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"5115_CR14","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft, J., & Karp, R. (1973). An n 5\/2 algorithm for maximum matching in bipartite graphs. SIAM Journal on Computing, 2, 225\u2013231.","journal-title":"SIAM Journal on Computing"},{"key":"5115_CR15","unstructured":"Hopcroft, J. E., & Wong, J. K. (1974). Linear time algorithm for isomorphism of planar graphs. In Proceedings of the 6th annual ACM symposium on theory of computing (pp. 172\u2013184)."},{"key":"5115_CR16","doi-asserted-by":"crossref","unstructured":"Horv\u00e1th, T., Roman, J., & Wrobel, S. (2006). Frequent subgraph mining in outerplanar graphs. In Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 197\u2013206).","DOI":"10.1145\/1150402.1150427"},{"key":"5115_CR17","series-title":"LNCS","first-page":"12","volume-title":"Proceedings of the 4th European conference on principles of data mining and knowledge discovery (PKDD-2000)","author":"A. Inokuchi","year":"2000","unstructured":"Inokuchi, A., Washio, T., & Motoda, H. (2000). An apriori-based algorithm for mining frequent substructures from graph data. In LNCS: Vol.\u00a01910. Proceedings of the 4th European conference on principles of data mining and knowledge discovery (PKDD-2000) (pp. 12\u201323). Berlin: Springer."},{"key":"5115_CR18","unstructured":"NCI (2000). The NCI Open Database, Release 2, August 2000 2D file. National Cancer Institute. http:\/\/cactus.nci.nih.gov\/ncidb2\/download.html . Accessed 1 November 2008."},{"key":"5115_CR19","unstructured":"Kashima, H., & Koyanagi, T. (2002). Kernels for semi-structured data. In Proceedings of the 19th international conference on machine learning (ICML-2002) (pp. 291\u2013298)."},{"key":"5115_CR20","series-title":"Advances in soft computing","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/3-540-33521-8_53","volume-title":"Proceedings of the international conference on intelligent information systems 2006: new trends in intelligent information processing and web mining","author":"M. Kryszkiewicz","year":"2006","unstructured":"Kryszkiewicz, M., & Skonieczny, L. (2006). Hierarchical document clustering using frequent closed sets. In Advances in soft computing. Proceedings of the international conference on intelligent information systems 2006: new trends in intelligent information processing and web mining (pp. 489\u2013498). Berlin: Springer."},{"key":"5115_CR21","unstructured":"Kuboyama, T., Hirata, K., Aoki, K. F., Kashima, H., & Yasuda, H. (2006). A gram distribution kernel applied to glycan classification and motif extraction. In Proceedings of the 17th international conference on genome informatics (GIW-2006) (pp. 25\u201334)."},{"key":"5115_CR22","unstructured":"Kudo, T., Maeda, E., & Matsumoto, Y. (2004). An application of boosting to graph classification. In Proceedings of the 18th annual conference on neural information processing systems (NIPS-2004)."},{"key":"5115_CR23","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., & Karypis, G. (2001). Frequent subgraph discovery. In Proceedings of the 2001 IEEE international conference on data mining (pp. 313\u2013320).","DOI":"10.1109\/ICDM.2001.989534"},{"key":"5115_CR24","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0304-3975(89)90011-X","volume":"63","author":"A. Lingas","year":"1989","unstructured":"Lingas, A. (1989). Subgraph isomorphism for biconnected outerplanar graphs in cubic time. Theoretical Computer Science, 63, 295\u2013302.","journal-title":"Theoretical Computer Science"},{"key":"5115_CR25","series-title":"LNCS(LNAI)","first-page":"5","volume-title":"Proceedings of the 4th Pacific-Asia conference on knowledge discovery and data mining (PAKDD-2000)","author":"T. Miyahara","year":"2000","unstructured":"Miyahara, T., Shoudai, T., Uchida, T., Takahashi, K., & Ueda, H. (2000). Polynomial time matching algorithms for tree-like structured patterns in knowledge discovery. In LNCS(LNAI): Vol.\u00a01805. Proceedings of the 4th Pacific-Asia conference on knowledge discovery and data mining (PAKDD-2000) (pp. 5\u201316). Berlin: Springer."},{"key":"5115_CR26","series-title":"LNCS(LNAI)","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/978-3-540-75225-7_25","volume-title":"Proceedings of the 18th international conference on algorithmic learning theory (ALT-2007)","author":"R. Okada","year":"2007","unstructured":"Okada, R., Matsumoto, S., Uchida, T., Suzuki, Y., & Shoudai, T. (2007). Exact learning of finite unions of graph patterns from queries. In LNCS(LNAI): Vol.\u00a04754. Proceedings of the 18th international conference on algorithmic learning theory (ALT-2007) (pp. 298\u2013312). Berlin: Springer."},{"key":"5115_CR27","series-title":"LNCS(LNAI)","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/978-3-540-78469-2_24","volume-title":"Proceedings of the 17th international conference on inductive logic programming (ILP 2007)","author":"Y. Sasaki","year":"2008","unstructured":"Sasaki, Y., Yamasaki, H., Shoudai, T., & Uchida, T. (2008). Mining of frequent block preserving outerplanar graph structured patterns. In LNCS(LNAI): Vol.\u00a04894. Proceedings of the 17th international conference on inductive logic programming (ILP 2007) (pp. 239\u2013253). Berlin: Springer."},{"key":"5115_CR28","series-title":"LNCS(LNAI)","first-page":"115","volume-title":"RIMS symposia on software science and engineering","author":"T. Shinohara","year":"1982","unstructured":"Shinohara, T. (1982). Polynomial time inference of extended regular pattern languages. In LNCS(LNAI): Vol.\u00a0147. RIMS symposia on software science and engineering (pp. 115\u2013127). Berlin: Springer."},{"key":"5115_CR29","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/3-540-44669-9_32","volume-title":"Proceedings of the 13th international symposium on fundamentals of computation theory (FCT-2001)","author":"T. Shoudai","year":"2001","unstructured":"Shoudai, T., Uchida, T., & Miyahara, T. (2001). Polynomial time algorithms for finding unordered tree patterns with internal variables. In LNCS: Vol.\u00a02138. Proceedings of the 13th international symposium on fundamentals of computation theory (FCT-2001) (pp. 335\u2013346). Berlin: Springer."},{"key":"5115_CR30","series-title":"LNCS(LNAI)","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/3-540-36468-4_18","volume-title":"Proceedings of the 12nd international workshop on inductive logic programming (ILP-2002)","author":"Y. Suzuki","year":"2003","unstructured":"Suzuki, Y., Shoudai, T., Miyahara, T., & Uchida, T. (2003). A polynomial time matching algorithm of structured ordered tree patterns for data mining from semistructured data. In LNCS(LNAI): Vol.\u00a02583. Proceedings of the 12nd international workshop on inductive logic programming (ILP-2002) (pp. 270\u2013284). Berlin: Springer."},{"key":"5115_CR31","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.tcs.2005.10.022","volume":"350","author":"Y. Suzuki","year":"2006","unstructured":"Suzuki, Y., Shoudai, T., Uchida, T., & Miyahara, T. (2006). Ordered term tree languages which are polynomial time inductively inferable from positive data. Theoretical Computer Science, 350, 63\u201390.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"5115_CR32","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1587\/transinf.E92.D.181","volume":"E92-D","author":"R. Takami","year":"2009","unstructured":"Takami, R., Suzuki, Y., Uchida, T., & Shoudai, T. (2009). Polynomial time inductive inference of TTSP graph languages from positive data. IEICE Transactions on Information and Systems, E92-D(2), 181\u2013190.","journal-title":"IEICE Transactions on Information and Systems"},{"key":"5115_CR33","series-title":"LNCS(LNAI)","first-page":"351","volume-title":"Proceedings of the 8th Pacific-Asia conference on knowledge discovery and data mining (PAKDD-2004)","author":"T. Uchida","year":"2004","unstructured":"Uchida, T., Mogawa, T., & Nakamura, Y. (2004). Finding frequent structural features among words in tree-structured documents. In LNCS(LNAI): Vol.\u00a03056. Proceedings of the 8th Pacific-Asia conference on knowledge discovery and data mining (PAKDD-2004) (pp. 351\u2013360). Berlin: Springer."},{"issue":"2","key":"5115_CR34","first-page":"99","volume":"E78-D","author":"T. Uchida","year":"1995","unstructured":"Uchida, T., Shoudai, T., & Miyano, S. (1995). Parallel algorithm for refutation tree problem on formal graph systems. IEICE Transactions on Information and Systems, E78-D(2), 99\u2013112.","journal-title":"IEICE Transactions on Information and Systems"},{"key":"5115_CR35","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/978-3-540-72504-6_6","volume-title":"Proceedings of the 4th international conference of theory and applications of models of computation (TAMC-2007)","author":"H. Yamasaki","year":"2007","unstructured":"Yamasaki, H., & Shoudai, T. (2007). A polynomial time algorithm for finding linear interval graph patterns. In LNCS: Vol.\u00a04484. Proceedings of the 4th international conference of theory and applications of models of computation (TAMC-2007) (pp. 67\u201378). Berlin: Springer."},{"key":"5115_CR36","first-page":"871","volume-title":"Proceedings of the 7th international conference on machine learning and applications (ICMLA\u201908)","author":"H. Yamasaki","year":"2008","unstructured":"Yamasaki, H., & Shoudai, T. (2008). Mining of frequent externally extensible outerplanar graph patterns. In Proceedings of the 7th international conference on machine learning and applications (ICMLA\u201908) (pp.\u00a0871\u2013876). Los Alamitos: IEEE Computer Society."},{"key":"5115_CR37","series-title":"LNCS(LNAI)","first-page":"330","volume-title":"Proceedings of the 18th international conference on inductive logic programming (ILP 2008)","author":"H. Yamasaki","year":"2008","unstructured":"Yamasaki, H., Sasaki, Y., Shoudai, T., Uchida, T., & Suzuki, Y. (2008). Learning block-preserving outerplanar graph patterns and its application to data mining. In LNCS(LNAI): Vol.\u00a05194. Proceedings of the 18th international conference on inductive logic programming (ILP 2008) (pp. 330\u2013347). Berlin: Springer."},{"key":"5115_CR38","unstructured":"Yan, X., & Han, J. (2002). gSpan: Graph-based substructure pattern mining. In Proceedings of the third SIAM international conference on data mining (SDM03) (pp. 721\u2013724)."},{"issue":"1","key":"5115_CR39","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0004-3702(94)00066-A","volume":"75","author":"K. Yoshida","year":"1995","unstructured":"Yoshida, K., & Motoda, H. (1995). Clip: concept learning from inference patterns. Artificial Intelligence, 75(1), 63\u201392.","journal-title":"Artificial Intelligence"},{"key":"5115_CR40","doi-asserted-by":"crossref","unstructured":"Zaki, M. J. (2002). Inductive inference by stepwise pair expansion. In Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining (pp. 71\u201380).","DOI":"10.1145\/775047.775058"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-009-5115-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-009-5115-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-009-5115-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T14:47:29Z","timestamp":1710427649000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-009-5115-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,12]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,7]]}},"alternative-id":["5115"],"URL":"https:\/\/doi.org\/10.1007\/s10994-009-5115-9","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6,12]]}}}