{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T18:49:57Z","timestamp":1675277397228},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,3,18]],"date-time":"2011-03-18T00:00:00Z","timestamp":1300406400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s10618-011-0218-x","type":"journal-article","created":{"date-parts":[[2011,3,17]],"date-time":"2011-03-17T12:42:19Z","timestamp":1300365739000},"page":"1-39","source":"Crossref","is-referenced-by-count":6,"title":["Using trees to mine multirelational databases"],"prefix":"10.1007","volume":"24","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":[[2011,3,18]]},"reference":[{"key":"218_CR1","unstructured":"Abe K, Kawasoe S, Asai T, Arimura H, Arikawa S (2002) Efficient substructure discovery from large semi-structured data. In: Proceedings of the 2nd SIAM international conference on data mining, pp 158\u2013174"},{"key":"218_CR2","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th international conference on very large data bases, 12\u201315 Sept, pp 487\u2013499"},{"key":"218_CR3","unstructured":"Bayardo RJ (2004) The hows, whys, and whens of constraints in itemset and rule discovery. In: Constraint-based mining and inductive databases, lecture notes in artificial intelligence, pp 1\u201313"},{"issue":"3","key":"218_CR4","doi-asserted-by":"crossref","first-page":"221","DOI":"10.3233\/IDA-2002-6303","volume":"6","author":"F Berzal","year":"2002","unstructured":"Berzal F, Blanco I, S\u00e1nchez D, Vila MA (2002) Measuring the accuracy and interest of association rules: a new framework. Intell Data Anal 6(3): 221\u2013235","journal-title":"Intell Data Anal"},{"issue":"1","key":"218_CR5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1023\/B:MACH.0000008085.22487.a6","volume":"54","author":"F Berzal","year":"2004","unstructured":"Berzal F, Cubero JC, S\u00e1nchez D, Serrano JM (2004) ART: a hybrid classification model. Mach Learn 54(1): 67\u201392","journal-title":"Mach Learn"},{"issue":"1\u20132","key":"218_CR6","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/S0004-3702(98)00034-4","volume":"101","author":"H Blockeel","year":"1998","unstructured":"Blockeel H, Raedt LD (1998) Top-down induction of first-order logical decision trees. Artif Intell 101 (1\u20132): 285\u2013297","journal-title":"Artif Intell"},{"key":"218_CR7","volume-title":"The unified modeling language user guide","author":"G Booch","year":"2005","unstructured":"Booch G, Rumbaugh J, Jacobson I (2005) The unified modeling language user guide, 2nd edn. Addison-Wesley Professional, New York","edition":"2"},{"key":"218_CR8","doi-asserted-by":"crossref","unstructured":"Chi Y, Yang Y, Muntz RR (2003) Indexing and mining free trees. In: Proceedings of the 3rd IEEE international conference on data mining, pp 509\u2013512","DOI":"10.1109\/ICDM.2003.1250964"},{"issue":"1\u20132","key":"218_CR9","first-page":"161","volume":"66","author":"Y Chi","year":"2005","unstructured":"Chi Y, Muntz RR, Nijssen S, Kok JN (2005) Frequent subtree mining\u2014an overview. Fundam Inform 66(1\u20132): 161\u2013198","journal-title":"Fundam Inform"},{"key":"218_CR10","volume-title":"The relational model for database management, version 2","author":"EF Codd","year":"1990","unstructured":"Codd EF (1990) The relational model for database management, version 2. Addison-Wesley, New York"},{"key":"218_CR11","doi-asserted-by":"crossref","unstructured":"De Knijf J (2006) FAT-miner: mining frequent attribute trees. Tech. Rep. UU-CS-2006-053, Department of Information and Computing Sciences, Utrecht University","DOI":"10.1145\/1244002.1244099"},{"key":"218_CR12","doi-asserted-by":"crossref","unstructured":"De Knijf J (2007) FAT-miner: mining frequent attribute trees. In: Proceedings of the 2007 ACM symposium on applied computing. ACM, New York, pp 417\u2013422","DOI":"10.1145\/1244002.1244099"},{"issue":"1","key":"218_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":"218_CR14","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1145\/319732.319735","volume":"7","author":"R Fagin","year":"1982","unstructured":"Fagin R, Mendelzon AO, Ullman JD (1982) A simplied universal relation assumption and its properties. ACM Trans Database Syst 7: 343\u2013360","journal-title":"ACM Trans Database Syst"},{"key":"218_CR15","volume-title":"Database systems: the complete book","author":"H Garcia-Molina","year":"2008","unstructured":"Garcia-Molina H, Ullman JD, Widom J (2008) Database systems: the complete book. Pearson Education, Boston"},{"issue":"1","key":"218_CR16","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 Min Knowl Discov 8(1): 53\u201387","journal-title":"Data Min Knowl Discov"},{"issue":"6","key":"218_CR17","doi-asserted-by":"crossref","first-page":"603","DOI":"10.3233\/IDA-2010-0443","volume":"14","author":"A Jimenez","year":"2010","unstructured":"Jimenez A, Berzal F, Cubero JC (2010a) Frequent tree pattern mining: a survey. Intell Data Anal 14(6): 603\u2013622","journal-title":"Intell Data Anal"},{"issue":"2","key":"218_CR18","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s10115-009-0213-3","volume":"23","author":"A Jimenez","year":"2010","unstructured":"Jimenez A, Berzal F, Cubero JC (2010b) POTMiner: mining ordered, unordered, and partially-ordered trees. Knowl Inform Syst 23(2): 199\u2013224","journal-title":"Knowl Inform Syst"},{"issue":"2","key":"218_CR19","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1023\/A:1008171016861","volume":"15","author":"RD King","year":"2001","unstructured":"King RD, Srinivasan A, Dehaspe L (2001) Warmr: a data mining tool for chemical data. J Comput-Aided Mol Des 15(2): 173\u2013181","journal-title":"J Comput-Aided Mol Des"},{"key":"218_CR20","doi-asserted-by":"crossref","unstructured":"Krogel MA, Wrobel S (2003) Facets of aggregation approaches to propositionalization. In: Horvath T, Yamamoto A (eds) Work-in-progress track at the thirteenth international conference on inductive logic programming","DOI":"10.1007\/978-3-540-39917-9_14"},{"issue":"17","key":"218_CR21","doi-asserted-by":"crossref","first-page":"3453","DOI":"10.1016\/j.ins.2007.03.007","volume":"177","author":"AJT Lee","year":"2007","unstructured":"Lee AJT, Wang CS (2007) An efficient algorithm for mining frequent inter-transaction patterns. Inform Sci 177(17): 3453\u20133476","journal-title":"Inform Sci"},{"key":"218_CR22","unstructured":"Leiva HA, Gadia S, Dobbs D (2002) MRDTL: a multi-relational decision tree learning algorithm. In: Proceedings of the 13th international conference on inductive logic programming. Springer-Verlag, pp 38\u201356"},{"key":"218_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/319830.319831","volume":"8","author":"D Maier","year":"1983","unstructured":"Maier D, Ullman JD (1983) Maximal objects and the semantics of universal relation databases. ACM Trans Database Syst 8: 1\u201314","journal-title":"ACM Trans Database Syst"},{"key":"218_CR24","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1145\/329.318580","volume":"9","author":"D Maier","year":"1984","unstructured":"Maier D, Ullman JD, Vardi MY (1984) On the foundations of the universal relation model. ACM Trans Database Syst 9: 283\u2013308","journal-title":"ACM Trans Database Syst"},{"key":"218_CR25","doi-asserted-by":"crossref","unstructured":"McGovern A, Hiers NC, Collier M, II DJG, Brown RA (2008) Spatiotemporal relational probability trees: an introduction. In: Proceedings of the 8th IEEE international conference on data mining. IEEE Computer Society, pp 935\u2013940","DOI":"10.1109\/ICDM.2008.134"},{"key":"218_CR26","doi-asserted-by":"crossref","unstructured":"Neville J, Jensen D, Friedland L, Hay M (2003) Learning relational probability trees. In: Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining, pp 625\u2013630","DOI":"10.1145\/956750.956830"},{"key":"218_CR27","volume-title":"The definitive guide to db4o","author":"J Paterson","year":"2006","unstructured":"Paterson J, Edlich S, H\u00f6rning H, H\u00f6rning R (2006) The definitive guide to db4o. Apress, New York"},{"issue":"1","key":"218_CR28","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/568574.568580","volume":"4","author":"J Pei","year":"2002","unstructured":"Pei J, Han J (2002) Constrained frequent pattern mining: a pattern-growth view. SIGKDD Explor Newsl 4(1): 31\u201339","journal-title":"SIGKDD Explor Newsl"},{"key":"218_CR29","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10994-006-6064-1","volume":"62","author":"C Perlich","year":"2006","unstructured":"Perlich C, Provost F (2006) Distribution-based aggregation for relational learning with identifier attributes. Mach Learn 62: 65\u2013105","journal-title":"Mach Learn"},{"key":"218_CR30","volume-title":"Database systems concepts","author":"A Silberschatz","year":"2001","unstructured":"Silberschatz A, Korth HF, Sudarshan S (2001) Database systems concepts. McGraw-Hill, New York"},{"key":"218_CR31","unstructured":"Srikant R, Vu Q, Agrawal R (1997) Mining association rules with item constraints. In: Proceedings of the 3rd international conference of knowledge discovery and data mining, pp 63\u201373"},{"key":"218_CR32","unstructured":"Srinivasan A, Muggleton SH, King R, Sternberg M (1994) Mutagenesis: ILP experiments in a non-determinate biological domain. In: Proceedings of the 4th international workshop on inductive logic programming, vol 237 of GMD-Studien, pp 217\u2013232"},{"issue":"1","key":"218_CR33","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/TKDE.2003.1161581","volume":"15","author":"AKH Tung","year":"2003","unstructured":"Tung AKH, Lu H, Han J, Feng L (2003) Efficient mining of intertransaction association rules. IEEE Trans Knowl Data Eng 15(1): 43\u201356","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"218_CR34","doi-asserted-by":"crossref","unstructured":"Turmeaux T, Salleb A, Vrain C, Cassard D (2003) Learning characteristic rules relying on quantified paths. In: Proceedings of the 7th European conference on principles and practice of knowledge discovery in databases, pp 471\u2013482","DOI":"10.1007\/978-3-540-39804-2_42"},{"key":"218_CR35","volume-title":"Principles of database and knowledge-base systems, vol I: classical database systems","author":"JD Ullman","year":"1988","unstructured":"Ullman JD (1988) Principles of database and knowledge-base systems, vol I: classical database systems. Computer Science Press Inc., New York"},{"key":"218_CR36","volume-title":"Principles of database and knowledge-base systems, vol II: the new technologies","author":"JD Ullman","year":"1990","unstructured":"Ullman JD (1990) Principles of database and knowledge-base systems, vol II: the new technologies. W. H. Freeman & Co., New York"},{"key":"218_CR37","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: Proceedings of the 8th Pacific-Asia conference on knowledge discovery and data mining. Lecture Notes in Computer Science, vol 3056, Springer, pp 441\u2013451","DOI":"10.1007\/978-3-540-24775-3_54"},{"key":"218_CR38","doi-asserted-by":"crossref","unstructured":"Xiao Y, Yao JF, Li Z, Dunham MH (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":"218_CR39","unstructured":"Yin X, Han J, Yang J, Yu PS (2004) CrossMine: efficient classification across multiple database relations. In: Proceedings of the 20th international conference on data engineering, pp 399\u2013410"},{"key":"218_CR40","doi-asserted-by":"crossref","unstructured":"Yin X, Han J, Yu PS (2005) Cross-relational clustering with user\u2019s guidance. In: Proceedings of the 12th international conference on knowledge discovery and data mining, pp 344\u2013353","DOI":"10.1145\/1081870.1081910"},{"issue":"1\u20132","key":"218_CR41","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":"218_CR42","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"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-011-0218-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-011-0218-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-011-0218-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,20]],"date-time":"2021-11-20T12:21:45Z","timestamp":1637410905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-011-0218-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,18]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["218"],"URL":"https:\/\/doi.org\/10.1007\/s10618-011-0218-x","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,18]]}}}