{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:30:40Z","timestamp":1760596240086},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,3,28]],"date-time":"2015-03-28T00:00:00Z","timestamp":1427500800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s10115-015-0831-x","type":"journal-article","created":{"date-parts":[[2015,3,29]],"date-time":"2015-03-29T00:30:17Z","timestamp":1427589017000},"page":"491-514","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Frequent pattern mining in attributed trees: algorithms and applications"],"prefix":"10.1007","volume":"46","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","published-online":{"date-parts":[[2015,3,28]]},"reference":[{"issue":"2","key":"831_CR1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"R Agrawal","year":"1993","unstructured":"Agrawal R, Imieli\u0144ski T, Swami A (1993) Mining association rules between sets of items in large databases. SIGMOD Rec 22(2):207\u2013216","journal-title":"SIGMOD Rec"},{"key":"831_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (1995) Mining sequential patterns. In: ICDE, 95, pp 3\u201314","DOI":"10.1109\/ICDE.1995.380415"},{"key":"831_CR3","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: SDM","DOI":"10.1137\/1.9781611972726.10"},{"key":"831_CR4","doi-asserted-by":"crossref","unstructured":"Asai T, Arimura H, Uno T, Nakano S-I (2003) Discovering frequent substructures in large unordered trees. In: The 6th International Conference on Discovery Science, Springer, pp 47\u201361","DOI":"10.1007\/978-3-540-39644-4_6"},{"key":"831_CR5","doi-asserted-by":"crossref","unstructured":"Ayres J, Flannick J, Gehrke J, Yiu T (2002) Sequential pattern mining using a bitmap representation. In: KDD, pp 429\u2013435","DOI":"10.1145\/775047.775109"},{"issue":"1\u20132","key":"831_CR6","first-page":"1","volume":"78","author":"JL Balc\u00e1zar","year":"2010","unstructured":"Balc\u00e1zar JL, Bifet A, Lozano A (2010) Mining frequent closed rooted trees. Mach Learn 78(1\u20132):1\u201333","journal-title":"Mach Learn"},{"key":"831_CR7","doi-asserted-by":"crossref","unstructured":"Bayardo RJ (1998) Efficiently mining long patterns from databases. In: ACM SIGMOD International Conference on Management of Data SIGMOD 98, pp 85\u201393","DOI":"10.1145\/276304.276313"},{"key":"831_CR8","doi-asserted-by":"crossref","unstructured":"Chehreghani MH (2011) Efficiently mining unordered trees. In: ICDM, pp 111\u2013120","DOI":"10.1109\/ICDM.2011.62"},{"issue":"1\u20132","key":"831_CR9","first-page":"161","volume":"66","author":"Y Chi","year":"2004","unstructured":"Chi Y, Muntz RR, Nijssen S, Kok JN (2004) Frequent subtree mining\u2014an overview. Fundam Inf 66(1\u20132):161\u2013198","journal-title":"Fundam Inf"},{"key":"831_CR10","doi-asserted-by":"crossref","unstructured":"Chi Y, Yang Y, Muntz RR (2003) Indexing and mining free trees. In: Proceedings of the 2003 IEEE International Conference on Data Mining (ICDM\u201903)","DOI":"10.1109\/ICDM.2003.1250964"},{"key":"831_CR11","unstructured":"Chi Y, Yang Y, Muntz RR (2004) Hybridtreeminer: an efficient algorithm for mining frequent rooted trees and free trees using canonical form. In: Scientific and Statistical Database Management, 2004. Proceedings. 16th International Conference on, pp 11\u201320"},{"key":"831_CR12","doi-asserted-by":"crossref","unstructured":"Chi Y, Yang Y, Xia Y, Muntz RR (2004) Cmtreeminer: mining both closed and maximal frequent subtrees. In: PAKDD, pp 63\u201373","DOI":"10.1007\/978-3-540-24775-3_9"},{"key":"831_CR13","doi-asserted-by":"crossref","unstructured":"Deshpande M, Kuramochi M, Karypis G (2003) Frequent sub-structure-based approaches for classifying chemical compounds. In: Third IEEE International Conference on Data Mining, IEEE Comput. Soc, pp 35\u201342","DOI":"10.1109\/ICDM.2003.1250900"},{"key":"831_CR14","doi-asserted-by":"crossref","unstructured":"Fukuzaki M, Seki M, Kashima H, Sese J (2010) Finding itemset-sharing patterns in a large itemset-associated graph. In: PAKDD, pp 147\u2013159","DOI":"10.1007\/978-3-642-13672-6_15"},{"issue":"1","key":"831_CR15","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10115-010-0369-x","volume":"30","author":"D Gay","year":"2010","unstructured":"Gay D, Selmaoui-Folcher N, Boulicaut J-F (2010) Application-independent feature construction based on almost-closedness properties. Knowl Inf Syst 30(1):87\u2013111","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"831_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J Han","year":"2000","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. SIGMOD Rec 29(2):1\u201312","journal-title":"SIGMOD Rec"},{"key":"831_CR17","doi-asserted-by":"crossref","unstructured":"Hido S, Kawano H (2005) Amiot: induced ordered tree mining in tree-structured databases. In: ICDM, pp 170\u2013177","DOI":"10.1109\/ICDM.2005.20"},{"key":"831_CR18","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1017\/S0269888912000331","volume":"28","author":"C Jiang","year":"2013","unstructured":"Jiang C, Coenen F, Zito M (2013) A survey of frequent subgraph mining algorithms. Knowl Eng Rev 28:75\u2013105","journal-title":"Knowl Eng Rev"},{"key":"831_CR19","unstructured":"Luccio F, Enriquez AM, Rieumont PO, Pagli L (2001) Exact rooted subtree matching in sublinear time, Universita Di Pisa Technical Report TR-01 14"},{"issue":"1","key":"831_CR20","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1006\/inco.1995.1160","volume":"123","author":"F Luccio","year":"1995","unstructured":"Luccio F, Pagli L (1995) Approximate matching for 2 families of trees. Inf Comput 123(1):111\u2013120","journal-title":"Inf Comput"},{"key":"831_CR21","unstructured":"Mannila H, Toivonen H (1996) Multiple uses of frequent sets and condensed representations. In: KDD, pp 189\u2013194"},{"key":"831_CR22","doi-asserted-by":"crossref","unstructured":"Miyoshi Y, Ozaki T, Ohkawa T (2009) Frequent pattern discovery from a single graph with quantitative itemsets. In: ICDM Workshops, pp 527\u2013532","DOI":"10.1109\/ICDMW.2009.11"},{"key":"831_CR23","doi-asserted-by":"crossref","unstructured":"Moser F, Colak R, Rafiey A, Ester M (2009) Mining cohesive patterns from graphs with feature vectors. In: SDM, pp 593\u2013604","DOI":"10.1137\/1.9781611972795.51"},{"key":"831_CR24","doi-asserted-by":"crossref","unstructured":"Mougel P-N, Rigotti C, Gandrillon O (2012) Finding collections of k-clique percolated components in attributed graphs. In: PAKDD, pp 181\u2013192","DOI":"10.1007\/978-3-642-30220-6_16"},{"key":"831_CR25","unstructured":"Nijssen S, Kok JN (2003) Efficient discovery of frequent unordered trees. In: First International Workshop on Mining Graphs, Trees and Sequences (MGTS)"},{"key":"831_CR26","doi-asserted-by":"crossref","unstructured":"Pasquier C, Sanhes J, Flouvat F, Selmaoui-Folcher N (2013) Frequent Pattern Mining in Attributed trees. In: Proceedings of the 17th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD\u201913)., Gold Coast Australia, pp 26\u201337","DOI":"10.1007\/978-3-642-37453-1_3"},{"key":"831_CR27","doi-asserted-by":"crossref","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: ICDT, pp 398\u2013416","DOI":"10.1007\/3-540-49257-7_25"},{"key":"831_CR28","doi-asserted-by":"crossref","unstructured":"Pensa RG, Boulicaut J-F (2005) From local pattern mining to relevant bi-cluster characterization. In: 6th International Symposium on Intelligent Data Analysis (IDA 2005), pp 293\u2013304","DOI":"10.1007\/11552253_27"},{"key":"831_CR29","unstructured":"Rymon R (1992) Search through systematic set enumeration. In: Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR\u201992), pp 539\u2013550"},{"key":"831_CR30","doi-asserted-by":"crossref","unstructured":"Selmaoui-Folcher N, Flouvat F (2011) How to use \u201cclassical\u201d tree mining algorithms to find complex spatio-temporal patterns?. In: DEXA (2), pp 107\u2013117","DOI":"10.1007\/978-3-642-23091-2_10"},{"key":"831_CR31","doi-asserted-by":"crossref","unstructured":"Termier A, Rousset M-C, Sebag M (2004) Dryade: a new approach for discovering closed frequent trees in heterogeneous tree databases. In: ICDM, pp 543\u2013546","DOI":"10.1109\/ICDM.2004.10078"},{"issue":"3","key":"831_CR32","doi-asserted-by":"crossref","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 (2008) Dryadeparent, an efficient and robust closed attribute tree mining algorithm. IEEE Trans Knowl Data Eng 20(3):300\u2013320","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"831_CR33","doi-asserted-by":"crossref","unstructured":"Wang C, Hong M, Pei J, Zhou H, Wang W, Shi B (2004) Efficient pattern-growth methods for frequent tree pattern mining. In: PAKDD, pp 441\u2013451","DOI":"10.1007\/978-3-540-24775-3_54"},{"issue":"1","key":"831_CR34","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1145\/959242.959249","volume":"5","author":"T Washio","year":"2003","unstructured":"Washio T, Motoda H (2003) State of the art of graph-based data mining. SIGKDD Explor Newsl 5(1):59\u201368","journal-title":"SIGKDD Explor Newsl"},{"key":"831_CR35","doi-asserted-by":"crossref","unstructured":"Xiao Y, Yao J-F, Li Z, Dunham MH (2003) Efficient data mining for maximal frequent subtrees. In: ICDM, pp 379\u2013386","DOI":"10.1109\/ICDM.2003.1250943"},{"key":"831_CR36","doi-asserted-by":"crossref","unstructured":"Yan X, Yu PS, Han J (2004) Graph indexing: a frequent structure-based approach. In: SIGMOD Conference, pp 335\u2013346","DOI":"10.1145\/1007568.1007607"},{"key":"831_CR37","doi-asserted-by":"crossref","unstructured":"Zaki MJ (2002) Efficiently mining frequent trees in a forest. In: KDD, pp 71\u201380","DOI":"10.1145\/775047.775058"},{"issue":"1\u20132","key":"831_CR38","first-page":"33","volume":"66","author":"MJ Zaki","year":"2004","unstructured":"Zaki MJ (2004) Efficiently mining frequent embedded unordered trees. Fundam Inf 66(1\u20132):33\u201352","journal-title":"Fundam Inf"},{"issue":"8","key":"831_CR39","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1109\/TKDE.2005.125","volume":"17","author":"MJ Zaki","year":"2005","unstructured":"Zaki MJ (2005) Efficiently mining frequent trees in a forest: algorithms and applications. IEEE Trans Knowl Data Eng 17(8):1021\u20131035","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"831_CR40","unstructured":"Zou L, Lu Y, Zhang H, Hu R (2006) Prefixtreespan: a pattern growth algorithm for mining embedded subtrees. In: WISE, pp 499\u2013505"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0831-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-015-0831-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0831-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:11:17Z","timestamp":1559124677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-015-0831-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,28]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["831"],"URL":"https:\/\/doi.org\/10.1007\/s10115-015-0831-x","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,28]]}}}