{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T04:05:37Z","timestamp":1746072337288,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642374524"},{"type":"electronic","value":"9783642374531"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37453-1_3","type":"book-chapter","created":{"date-parts":[[2013,4,6]],"date-time":"2013-04-06T12:58:56Z","timestamp":1365253136000},"page":"26-37","source":"Crossref","is-referenced-by-count":2,"title":["Frequent Pattern Mining in Attributed Trees"],"prefix":"10.1007","author":[{"given":"Claude","family":"Pasquier","sequence":"first","affiliation":[]},{"given":"J\u00e9r\u00e9my","family":"Sanhes","sequence":"additional","affiliation":[]},{"given":"Fr\u00e9d\u00e9ric","family":"Flouvat","sequence":"additional","affiliation":[]},{"given":"Nazha","family":"Selmaoui-Folcher","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"R. Agrawal","year":"1993","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A.: Mining association rules between sets of items in large databases. SIGMOD Rec.\u00a022(2), 207\u2013216 (1993)","journal-title":"SIGMOD Rec."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Mining sequential patterns. In: ICDE, pp. 3\u201314 (1995)","DOI":"10.1109\/ICDE.1995.380415"},{"key":"3_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: SDM (2002)","DOI":"10.1137\/1.9781611972726.10"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Ayres, J., Flannick, J., Gehrke, J., Yiu, T.: Sequential pattern mining using a bitmap representation. In: KDD, pp. 429\u2013435 (2002)","DOI":"10.1145\/775047.775109"},{"issue":"1-2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10994-009-5123-9","volume":"78","author":"J.L. Balc\u00e1zar","year":"2010","unstructured":"Balc\u00e1zar, J.L., Bifet, A., Lozano, A.: Mining frequent closed rooted trees. Mach. Learn.\u00a078(1-2), 1\u201333 (2010)","journal-title":"Mach. Learn."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Chehreghani, M.H.: Efficiently mining unordered trees. In: ICDM, pp. 111\u2013120 (2011)","DOI":"10.1109\/ICDM.2011.62"},{"issue":"1-2","key":"3_CR7","first-page":"161","volume":"66","author":"Y. Chi","year":"2004","unstructured":"Chi, Y., Muntz, R.R., Nijssen, S., Kok, J.N.: Frequent subtree mining - an overview. Fundam. Inf.\u00a066(1-2), 161\u2013198 (2004)","journal-title":"Fundam. Inf."},{"key":"3_CR8","unstructured":"Chi, Y., Yang, Y., Muntz, R.R.: Hybridtreeminer: An efficient algorithm for mining frequent rooted trees and free trees using canonical form. In: SSDBM, pp. 11\u201320 (2004)"},{"key":"3_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-24775-3_9","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Y. Chi","year":"2004","unstructured":"Chi, Y., Yang, Y., Xia, Y., Muntz, R.R.: Cmtreeminer: Mining both closed and maximal frequent subtrees. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol.\u00a03056, pp. 63\u201373. Springer, Heidelberg (2004)"},{"key":"3_CR10","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-642-13672-6_15","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"M. Fukuzaki","year":"2010","unstructured":"Fukuzaki, M., Seki, M., Kashima, H., Sese, J.: Finding itemset-sharing patterns in a large itemset-associated graph. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds.) PAKDD 2010, Part II. LNCS (LNAI), vol.\u00a06119, pp. 147\u2013159. Springer, Heidelberg (2010)"},{"issue":"2","key":"3_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J. Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. SIGMOD Rec.\u00a029(2), 1\u201312 (2000)","journal-title":"SIGMOD Rec."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Hido, S., Kawano, H.: Amiot: Induced ordered tree mining in tree-structured databases. In: ICDM, pp. 170\u2013177 (2005)","DOI":"10.1109\/ICDM.2005.20"},{"key":"3_CR13","unstructured":"Mannila, H., Toivonen, H.: Multiple uses of frequent sets and condensed representations. In: KDD, pp. 189\u2013194 (2005)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Miyoshi, Y., Ozaki, T., Ohkawa, T.: Frequent pattern discovery from a single graph with quantitative itemsets. In: ICDM Workshops, pp. 527\u2013532 (2009)","DOI":"10.1109\/ICDMW.2009.11"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Moser, F., Colak, R., Rafiey, A., Ester, M.: Mining cohesive patterns from graphs with feature vectors. In: SDM, pp. 593\u2013604 (2009)","DOI":"10.1137\/1.9781611972795.51"},{"key":"3_CR16","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-30220-6_16","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"P.-N. Mougel","year":"2012","unstructured":"Mougel, P.-N., Rigotti, C., Gandrillon, O.: Finding collections of k-clique percolated components in attributed graphs. In: Tan, P.-N., Chawla, S., Ho, C.K., Bailey, J. (eds.) PAKDD 2012, Part II. LNCS (LNAI), vol.\u00a07302, pp. 181\u2013192. Springer, Heidelberg (2012)"},{"key":"3_CR17","unstructured":"Nijssen, S., Kok, J.N.: Efficient discovery of frequent unordered trees. In: First International Workshop on Mining Graphs, Trees and Sequences (MGTS) (2003)"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory - ICDT\u201999","author":"N. Pasquier","year":"1998","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 398\u2013416. Springer, Heidelberg (1998)"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Termier, A., Rousset, M.C., Sebag, M.: Dryade: A new approach for discovering closed frequent trees in heterogeneous tree databases. In: ICDM, pp. 543\u2013546 (2004)","DOI":"10.1109\/ICDM.2004.10078"},{"issue":"3","key":"3_CR20","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1109\/TKDE.2007.190695","volume":"20","author":"A. Termier","year":"2008","unstructured":"Termier, A., Rousset, M.C., Sebag, M., Ohara, K., Washio, T., Motoda, H.: Dryadeparent, an efficient and robust closed attribute tree mining algorithm. IEEE Trans. on Knowl. and Data Eng.\u00a020(3), 300\u2013320 (2008)","journal-title":"IEEE Trans. on Knowl. and Data Eng."},{"key":"3_CR21","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-540-24775-3_54","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"C. Wang","year":"2004","unstructured":"Wang, C., Hong, M., Pei, J., Zhou, H., Wang, W., Shi, B.: Efficient pattern-growth methods for frequent tree pattern mining. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol.\u00a03056, pp. 441\u2013451. Springer, Heidelberg (2004)"},{"issue":"1","key":"3_CR22","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1145\/959242.959249","volume":"5","author":"T. Washio","year":"2003","unstructured":"Washio, T., Motoda, H.: State of the art of graph-based data mining. SIGKDD Explor. Newsl. 5(1), 59\u201368 (2003)","journal-title":"SIGKDD Explor. Newsl."},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Xiao, Y., Yao, J.F., Li, Z., Dunham, M.H.: Efficient data mining for maximal frequent subtrees. In: ICDM, pp. 379\u2013386 (2003)","DOI":"10.1109\/ICDM.2003.1250943"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Efficiently mining frequent trees in a forest. In: KDD, pp. 71\u201380 (2002)","DOI":"10.1145\/775047.775058"},{"issue":"1-2","key":"3_CR25","first-page":"33","volume":"66","author":"M.J. Zaki","year":"2004","unstructured":"Zaki, M.J.: Efficiently mining frequent embedded unordered trees. Fundam. Inf.\u00a066(1-2), 33\u201352 (2004)","journal-title":"Fundam. Inf."},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/11912873_51","volume-title":"Web Information Systems \u2013 WISE 2006","author":"L. Zou","year":"2006","unstructured":"Zou, L., Lu, Y., Zhang, H., Hu, R.: Prefixtreeespan: a pattern growth algorithm for mining embedded subtrees. In: Aberer, K., Peng, Z., Rundensteiner, E.A., Zhang, Y., Li, X. (eds.) WISE 2006. LNCS, vol.\u00a04255, pp. 499\u2013505. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37453-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T03:28:32Z","timestamp":1745983712000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-37453-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642374524","9783642374531"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37453-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}