{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T16:43:42Z","timestamp":1769273022776,"version":"3.49.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,6,3]],"date-time":"2009-06-03T00:00:00Z","timestamp":1243987200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2010,5]]},"DOI":"10.1007\/s10115-009-0213-3","type":"journal-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T13:01:00Z","timestamp":1243947660000},"page":"199-224","source":"Crossref","is-referenced-by-count":12,"title":["POTMiner: mining ordered, unordered, and partially-ordered trees"],"prefix":"10.1007","volume":"23","author":[{"given":"A\u00edda","family":"Jim\u00e9nez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Berzal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan-Carlos","family":"Cubero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,6,3]]},"reference":[{"key":"213_CR1","unstructured":"Abe K et\u00a0al. (2002) Efficient substructure discovery from large semi-structured data. In: Proceedings of the 2nd SIAM international conference on data mining"},{"issue":"3","key":"213_CR2","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1006\/jpdc.2000.1693","volume":"61","author":"RC Agarwal","year":"2001","unstructured":"Agarwal RC et\u00a0al (2001) A tree projection algorithm for generation of frequent item sets. J Parallel Distrib Comput 61(3): 350\u2013371","journal-title":"J Parallel Distrib Comput"},{"key":"213_CR3","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1109\/69.553164","volume":"8","author":"R Agrawal","year":"1996","unstructured":"Agrawal R, Shafer JC (1996) Parallel mining of association rules. IEEE Trans Knowl Data Eng 8: 962\u2013969","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"213_CR4","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of 20th international conference on very large data bases, 12\u201315 September, pp 487\u2013499"},{"key":"213_CR5","doi-asserted-by":"crossref","unstructured":"Asai T et\u00a0al (2003) Discovering frequent substructures in large unordered trees. In: Discovery science. Lecture Notes in Artificial Intelligence, vol 2843. Springer, Berlin, pp 47\u201361","DOI":"10.1007\/978-3-540-39644-4_6"},{"key":"213_CR6","doi-asserted-by":"crossref","unstructured":"Berzal F et\u00a0al (2007) Hierarchical program representation for program element matching. In: IDEAL\u201907. Lecture Notes in Computer Science, vol 4881, pp 467\u2013476","DOI":"10.1007\/978-3-540-77226-2_48"},{"key":"213_CR7","doi-asserted-by":"crossref","unstructured":"Bringmann B (2006) To see the wood for the trees: mining frequent tree patterns. In: Constraint-based mining and inductive databases, European workshop on inductive databases and constraint based mining. 11\u201313 March 2004, Hinterzarten, Germany. Revised Selected Papers. Lecture Notes in Computer Science, vol 3848. Springer, Berlin, pp 38\u201363","DOI":"10.1007\/11615576_3"},{"issue":"6","key":"213_CR8","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1109\/69.553158","volume":"8","author":"DW-L Cheung","year":"1996","unstructured":"Cheung DW-L et\u00a0al (1996) Efficient mining of association rules in distributed databases. IEEE Trans Knowl Data Eng 8(6): 911\u2013922","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1\u20132","key":"213_CR9","first-page":"161","volume":"66","author":"Y Chi","year":"2005","unstructured":"Chi Y et\u00a0al (2005a) Frequent subtree mining\u2014an overview. Fundam Inform 66(1\u20132): 161\u2013198","journal-title":"Fundam Inform"},{"issue":"2","key":"213_CR10","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/TKDE.2005.30","volume":"17","author":"Y Chi","year":"2005","unstructured":"Chi Y et\u00a0al (2005b) Mining closed and maximal frequent subtrees from databases of labeled rooted trees. IEEE Trans Knowl Data Eng 17(2): 190\u2013202","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"213_CR11","unstructured":"Chi Y et\u00a0al (2004) HybridTreeMiner: an efficient algorithm for mining frequent rooted trees and free trees using canonical form. In: The 16th international conference on scientific and statistical database management, pp 11\u201320"},{"issue":"2","key":"213_CR12","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s10115-004-0180-7","volume":"8","author":"Y Chi","year":"2005","unstructured":"Chi Y et\u00a0al (2005c) Canonical forms for labelled trees and their applications in frequent subtree mining. Knowl Inform Syst 8(2): 203\u2013234","journal-title":"Knowl Inform Syst"},{"issue":"1","key":"213_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/959242.959245","volume":"5","author":"S D\u017eeroski","year":"2003","unstructured":"D\u017eeroski S (2003) Multi-relational data mining: an introduction. SIGKDD Explor Newsl 5(1): 1\u201316","journal-title":"SIGKDD Explor Newsl"},{"key":"213_CR14","unstructured":"Gall H et\u00a0al (2007) 4th international workshop on mining software repositories (MSR 2007). In: ICSE COMPANION \u201907, pp 107\u2013108"},{"key":"213_CR15","unstructured":"Hadzic F et\u00a0al (2007) UNI3\u2014efficient algorithm for mining unordered induced subtrees using TMG candidate generation. In: Computational intelligence and data mining, pp 568\u2013575"},{"key":"213_CR16","doi-asserted-by":"crossref","unstructured":"Han J et\u00a0al (2000) Mining frequent patterns without candidate generation. In: Proceedings of the 6th ACM SIGKDD international conference on knowledge discovery and data mining, pp 1\u201312","DOI":"10.1145\/342009.335372"},{"key":"213_CR17","doi-asserted-by":"crossref","unstructured":"Hido S, Kawano H (2005) AMIOT: induced ordered tree mining in tree-structured databases. In: Proceedings of the 5th IEEE international conference on data mining, pp 170\u2013177","DOI":"10.1109\/ICDM.2005.20"},{"key":"213_CR18","doi-asserted-by":"crossref","unstructured":"Nayak R et\u00a0al (2006) Knowledge discovery from XML documents. Lecture Notes in Computer Science, vol 3915. Springer, Berlin","DOI":"10.1007\/11730262"},{"key":"213_CR19","unstructured":"Nijssen S, Kok JN (2003) Efficient discovery of frequent unordered trees. In: First international workshop on mining graphs, trees and sequences (MGTS2003), in conjunction with ECML\/PKDD\u201903, pp 55\u201364"},{"key":"213_CR20","doi-asserted-by":"crossref","unstructured":"Nijssen S, Kok JN (2004) A quickstart in frequent structure mining can make a difference. In: Proceedings of the 10th ACM SIGKDD international conference on knowledge discovery and data mining, pp 647\u2013652","DOI":"10.1145\/1014052.1014134"},{"issue":"1","key":"213_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00011656","volume":"3","author":"S Parthasarathy","year":"2001","unstructured":"Parthasarathy S et\u00a0al (2001) Parallel data mining for association rules on shared-memory systems. Knowl Inform Syst 3(1): 1\u201329","journal-title":"Knowl Inform Syst"},{"key":"213_CR22","doi-asserted-by":"crossref","unstructured":"R\u00fcckert U, Kramer S (2004) Frequent free tree discovery in graph data. In: Proceedings of the 2004 ACM symposium on applied computing, pp 564\u2013570","DOI":"10.1145\/967900.968018"},{"issue":"4","key":"213_CR23","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/s10115-004-0176-3","volume":"7","author":"A Schuster","year":"2005","unstructured":"Schuster A et\u00a0al (2005) A high-performance distributed algorithm for mining association rules. Knowl Inform Syst 7(4): 458\u2013475","journal-title":"Knowl Inform Syst"},{"issue":"1\u20134","key":"213_CR24","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0020-0255(99)00035-3","volume":"118","author":"L Shen","year":"1999","unstructured":"Shen L et\u00a0al (1999) New algorithms for efficient mining of association rules. Inform Sci 118(1\u20134): 251\u2013268","journal-title":"Inform Sci"},{"key":"213_CR25","unstructured":"Tan H et\u00a0al (2005a) X3-Miner: mining patterns from an XML database. In: The 6th international conference on data mining, text mining and their business applications. May 2005, Skiathos, Greece, pp 287\u2013296"},{"key":"213_CR26","unstructured":"Tan H et\u00a0al (2005b) MB3-Miner: mining eMBedded subTREEs using tree model guided candidate generation. In: Proceedings of the first international workshop on mining complex data, pp 103\u2013110"},{"key":"213_CR27","doi-asserted-by":"crossref","unstructured":"Tan H et\u00a0al (2006) IMB3-Miner: mining induced\/embedded subtrees by constraining the level of embedding. In: Proceedings of the 10th Pacific-Asia conference on knowledge discovery and data mining, pp 450\u2013461","DOI":"10.1007\/11731139_52"},{"key":"213_CR28","doi-asserted-by":"crossref","unstructured":"Tatikonda S et\u00a0al (2006) TRIPS and TIDES: new algorithms for tree mining. In: Proceedings of the 15th ACM international conference on information and knowledge management, pp 455\u2013464","DOI":"10.1145\/1183614.1183680"},{"key":"213_CR29","doi-asserted-by":"crossref","unstructured":"Termier A et\u00a0al (2002) TreeFinder: a first step towards XML data mining. In: Proceedings of the 2nd IEEE international conference on data mining, pp 450\u2013457","DOI":"10.1109\/ICDM.2002.1183987"},{"key":"213_CR30","doi-asserted-by":"crossref","unstructured":"Termier A et\u00a0al (2004) DRYADE: a new approach for discovering closed frequent trees in heterogeneous tree databases. In: Proceedings of the 4th IEEE international conference on data mining, pp 543\u2013546","DOI":"10.1109\/ICDM.2004.10078"},{"key":"213_CR31","doi-asserted-by":"crossref","unstructured":"Wang C et\u00a0al (2004) Efficient pattern-growth methods for frequent tree pattern mining. In: Proceedings of the 8th Pacific-Asia conference on knowledge discovery and data mining. Lecture Notes in Computer Science, vol 3056. Springer, Berlin, pp 441\u2013451","DOI":"10.1007\/978-3-540-24775-3_54"},{"key":"213_CR32","doi-asserted-by":"crossref","unstructured":"Xiao Y et\u00a0al (2003) Efficient data mining for maximal frequent subtrees. In: Proceedings of the 3rd IEEE international conference on data mining, pp 379\u2013386","DOI":"10.1109\/ICDM.2003.1250943"},{"key":"213_CR33","unstructured":"Yin X et\u00a0al (2004) CrossMine: efficient classification across multiple database relations. In: International conference on data engineering, pp 399\u2013410"},{"key":"213_CR34","unstructured":"Yin X et\u00a0al (2005) Cross-relational clustering with user\u2019s guidance. In: Knowledge discovery and data mining, pp 344\u2013353"},{"issue":"1\u20132","key":"213_CR35","first-page":"33","volume":"66","author":"MJ Zaki","year":"2005","unstructured":"Zaki MJ (2005a) Efficiently mining frequent embedded unordered trees. Fundam Inform 66(1\u20132): 33\u201352","journal-title":"Fundam Inform"},{"issue":"8","key":"213_CR36","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1109\/TKDE.2005.125","volume":"17","author":"MJ Zaki","year":"2005","unstructured":"Zaki MJ (2005b) 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"},{"issue":"1","key":"213_CR37","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/TKDE.2007.190676","volume":"20","author":"S Zhang","year":"2008","unstructured":"Zhang S, Wang JTL (2008) Discovering frequent agreement subtrees from phylogenetic data. IEEE Trans Knowl Data Eng 20(1): 68\u201382","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-009-0213-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-009-0213-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-009-0213-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:10:19Z","timestamp":1559124619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-009-0213-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,3]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,5]]}},"alternative-id":["213"],"URL":"https:\/\/doi.org\/10.1007\/s10115-009-0213-3","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6,3]]}}}