{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:31:07Z","timestamp":1725525067790},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642003981"},{"type":"electronic","value":"9783642003998"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00399-8_7","type":"book-chapter","created":{"date-parts":[[2009,2,7]],"date-time":"2009-02-07T06:51:04Z","timestamp":1233989464000},"page":"75-86","source":"Crossref","is-referenced-by-count":3,"title":["Mining Mutually Dependent Ordered Subtrees in Tree Databases"],"prefix":"10.1007","author":[{"given":"Tomonobu","family":"Ozaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takenao","family":"Ohkawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proc. of 20th International Conference on Very Large Data Bases (VLDB 1994), pp. 487\u2013499 (1994)"},{"key":"7_CR2","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. of the 2nd SIAM International Conference on Data Mining (2002)","DOI":"10.1137\/1.9781611972726.10"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Asai, T., Arimura, H., Uno, T., Nakano, S.: Discovering frequent substructures in large unordered trees. In: Proc. of the 6th International Conference on Discovery Science, pp. 47\u201361 (2003)","DOI":"10.1007\/978-3-540-39644-4_6"},{"issue":"1-2","key":"7_CR4","first-page":"161","volume":"66","author":"Y. Chi","year":"2005","unstructured":"Chi, Y., Nijssen, S., Muntz, R.R., Kok, J.N.: Frequent subtree mining \u2013 an overview. Fundamenta Informaticae\u00a066(1-2), 161\u2013198 (2005)","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1109\/TKDE.2005.30","volume":"17","author":"Y. Chi","year":"2005","unstructured":"Chi, Y., Xia, Y., Yang, Y., Muntz, R.R.: Mining closed and maximal frequent subtrees from databases of labeled rooted trees. IEEE Transactions on Knowledge and Data Engineering\u00a017(2), 190\u2013202 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Hido, S., Kawano, H.: Amiot: Induced ordered tree mining in tree-structured databases. In: Proc. of the 5th IEEE International Conference on Data Mining (ICDM 2005), pp. 170\u2013177 (2005)","DOI":"10.1109\/ICDM.2005.20"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1093\/nar\/gkh063","volume":"32","author":"M. Kanehisa","year":"2004","unstructured":"Kanehisa, M., Goto, S., Kawashima, S., Okuno, Y., Hattori, M.: The KEGG resource for deciphering the genome. Nucleic Acids Research\u00a032, D277\u2013D280 (2004)","journal-title":"Nucleic Acids Research"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Ozaki, T., Ohkawa, T.: Efficient mining of closed induced ordered subtrees in tree-structured databases. In: Proc. of the 6th IEEE International Conference on Data Mining - Workshops, pp. 279\u2013283 (2006)","DOI":"10.1109\/ICDMW.2006.67"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/978-3-540-71701-0_81","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"T. Ozaki","year":"2007","unstructured":"Ozaki, T., Ohkawa, T.: Efficiently mining closed constrained frequent ordered subtrees by using border information. In: Zhou, Z.-H., Li, H., Yang, Q. (eds.) PAKDD 2007. LNCS, vol.\u00a04426, pp. 745\u2013752. Springer, Heidelberg (2007)"},{"key":"7_CR10","unstructured":"Ozaki, T., Ohkawa, T.: Mining frequent \u03b4-free induced ordered subtrees in tree-structured databases. In: Proc. of the 5th Workshop on Learning with Logics and Logics for Learning (LLLL 2007), pp. 3\u20139 (2007)"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Xiong, H., Tan, P.-N., Kumar, V.: Mining strong affinity association patterns in data sets with skewed support distribution. In: Proc. of the 3rd IEEE International Conference on Data Mining (ICDM 2003), pp. 387\u2013394 (2003)","DOI":"10.1109\/ICDM.2003.1250944"},{"issue":"2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10618-006-0043-9","volume":"13","author":"H. Xiong","year":"2006","unstructured":"Xiong, H., Tan, P.-N., Kumar, V.: Hyperclique pattern discovery. Data Mining and Knowledge Discovery\u00a013(2), 219\u2013242 (2006)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Efficiently mining frequent trees in a forest. In: Proc. of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 71\u201380 (2002)","DOI":"10.1145\/775047.775058"},{"key":"7_CR14","unstructured":"Zaki, M.J.: Efficiently mining frequent embedded unordered trees. Fundamenta Informaticae, special issue on Advances in Mining Graphs, Trees and Sequences (2005)"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Zou, L., Lu, Y., Zhang, H., Hu, R.: Mining frequent induced subtree patterns with subtree-constraint. In: Proc. of the 6th IEEE International Conference on Data Mining - Workshops, pp. 3\u20137 (2006)","DOI":"10.1109\/ICDMW.2006.112"}],"container-title":["Lecture Notes in Computer Science","New Frontiers in Applied Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00399-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T22:13:17Z","timestamp":1684879997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00399-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642003981","9783642003998"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00399-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}