{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T08:11:12Z","timestamp":1772784672053,"version":"3.50.1"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,5,14]],"date-time":"2013-05-14T00:00:00Z","timestamp":1368489600000},"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":[[2014,5]]},"DOI":"10.1007\/s10618-013-0319-9","type":"journal-article","created":{"date-parts":[[2013,5,13]],"date-time":"2013-05-13T05:35:15Z","timestamp":1368423315000},"page":"808-849","source":"Crossref","is-referenced-by-count":31,"title":["Interesting pattern mining in multi-relational data"],"prefix":"10.1007","volume":"28","author":[{"given":"Eirini","family":"Spyropoulou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tijl","family":"De Bie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Boley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,5,14]]},"reference":[{"key":"319_CR1","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 (VLDB), pp 487\u2013499"},{"key":"319_CR2","doi-asserted-by":"crossref","unstructured":"Angles R, Gutierrez C (2008) Survey of graph database models. ACM Comput Surv 40(1):1:1\u20131:39","DOI":"10.1145\/1322432.1322433"},{"key":"319_CR3","volume-title":"Lattice theory","author":"G Birkhoff","year":"1967","unstructured":"Birkhoff G (1967) Lattice theory. American Mathematical Society, Providence"},{"key":"319_CR4","unstructured":"Boley M (2011) The efficient discovery of interesting closed pattern collections. PhD thesis, University of Bonn, Bonn"},{"issue":"3","key":"319_CR5","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1016\/j.tcs.2009.10.024","volume":"411","author":"M Boley","year":"2010","unstructured":"Boley M, Horvath T, Poign\u00e9 A, Wrobel S (2010) Listing closed sets of strongly accessible set systems with applications to data mining. Theor Comput Sci 411(3):691\u2013700","journal-title":"Theor Comput Sci"},{"issue":"9","key":"319_CR6","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron C, Kerbosch J (1973) Algorithm 457: finding all cliques of an undirected graph. Commun ACM 16(9):575\u2013577","journal-title":"Commun ACM"},{"issue":"11","key":"319_CR7","doi-asserted-by":"crossref","first-page":"1490","DOI":"10.1109\/TKDE.2005.183","volume":"17","author":"D Burdick","year":"2005","unstructured":"Burdick D, Calimlim M, Flannick J, Gehrke J, Yiu T (2005) Mafia: a maximal frequent itemset algorithm. IEEE Trans Knowl Data Eng 17(11):1490\u20131504","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"319_CR8","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s10618-006-0054-6","volume":"14","author":"T Calders","year":"2007","unstructured":"Calders T, Goethals B (2007) Non-derivable itemset mining. Data Min Knowl Discov 14(1):171\u2013206","journal-title":"Data Min Knowl Discov"},{"key":"319_CR9","doi-asserted-by":"crossref","unstructured":"Cerf L, Besson J, Robardet C, Boulicaut JF (2009) Closed patterns meet n-ary relations. ACM Trans Knowl Discov Data 3(1):3:1\u20133:36","DOI":"10.1145\/1497577.1497580"},{"key":"319_CR10","doi-asserted-by":"crossref","DOI":"10.1002\/047174882X","volume-title":"Elements of information theory","author":"TM Cover","year":"2005","unstructured":"Cover TM, Thomas JA (2005) Elements of information theory. Wiley, Hoboken"},{"key":"319_CR11","doi-asserted-by":"crossref","unstructured":"De Bie T (2011a) An information theoretic framework for data mining. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 564\u2013572","DOI":"10.1145\/2020408.2020497"},{"issue":"3","key":"319_CR12","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s10618-010-0209-3","volume":"23","author":"T Bie De","year":"2011","unstructured":"De Bie T (2011b) Maximum entropy models and subjective interestingness: an application to tiles in binary databases. Data Min Knowl Discov 23(3):407\u2013446","journal-title":"Data Min Knowl Discov"},{"key":"319_CR13","doi-asserted-by":"crossref","unstructured":"De Bie T, Kontonasios KN, Spyropoulou E (2010) A framework for mining interesting pattern sets. In: SIGKDD explorations, pp 92\u2013100","DOI":"10.1145\/1816112.1816117"},{"key":"319_CR14","doi-asserted-by":"crossref","unstructured":"De Raedt L, Zimmermann A (2007) Constraint-based pattern set mining. In: Proceedings of the SIAM international conference on data mining (SDM), pp 237\u2013248","DOI":"10.1137\/1.9781611972771.22"},{"key":"319_CR15","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1009863704807","volume":"3","author":"L Dehaspe","year":"1999","unstructured":"Dehaspe L, Toivonen H (1999) Discovery of frequent datalog patterns. Data Min Knowl Discov 3:7\u201336","journal-title":"Data Min Knowl Discov"},{"key":"319_CR16","volume-title":"Fundamentals of database systems","author":"R Elmasri","year":"2006","unstructured":"Elmasri R, Navathe SB (2006) Fundamentals of database systems. Addison Wesley, Boston"},{"key":"319_CR17","unstructured":"Garriga GC, Khardon R, De Raedt L (2007) On mining closed sets in multi-relational data. In: Proceedings of the 20th international joint conference on artifical intelligence (IJCAI), pp 804\u2013809"},{"key":"319_CR18","doi-asserted-by":"crossref","unstructured":"Geerts F, Goethals B, Mielikainen T (2004) Tiling databases. In: Proceedings of discovery science, pp 278\u2013289","DOI":"10.1007\/978-3-540-30214-8_22"},{"key":"319_CR19","doi-asserted-by":"crossref","unstructured":"Geng L, Hamilton HJ (2006) Interestingness measures for data mining: a survey. In: ACM computing surveys, vol 38. ACM, New York","DOI":"10.1145\/1132960.1132963"},{"issue":"3","key":"319_CR20","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1145\/1297332.1297338","volume":"1","author":"A Gionis","year":"2007","unstructured":"Gionis A, Mannila H, Mielikinen T, Tsaparas P (2007) Assessing data mining results via swap randomization. ACM Trans Knowl Discov Data 1(3):14","journal-title":"ACM Trans Knowl Discov Data"},{"key":"319_CR21","doi-asserted-by":"crossref","unstructured":"Goethals B, Le Page W (2008) Mining association rules of simple conjunctive queries. In: Proceedings of the SIAM international conference on data mining (SDM), Atlanta","DOI":"10.1137\/1.9781611972788.9"},{"key":"319_CR22","doi-asserted-by":"crossref","unstructured":"Goethals B, Page WL, Mampaey M (2010) Mining interesting sets and rules in relational databases. In: Proceedings of the ACM symposium on applied computing (SAC), pp 997\u20131001","DOI":"10.1145\/1774088.1774299"},{"key":"319_CR23","doi-asserted-by":"crossref","unstructured":"Gupta R, Fang G, Field B, Steinbach M, Kumar V (2008) Quantitative evaluation of approximate frequent pattern mining algorithms. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 301\u2013309","DOI":"10.1145\/1401890.1401930"},{"key":"319_CR24","doi-asserted-by":"crossref","unstructured":"Hanhijarvi S, Ojala M, Vuokko N, Puolamaki K, Tatti N, Mannila H (2009) Tell me something i don\u2019t know: randomization strategies for iterative data mining. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining (KDD). ACM, New York, pp 379\u2013388","DOI":"10.1145\/1557019.1557065"},{"issue":"1","key":"319_CR25","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.websem.2007.11.004","volume":"6","author":"R J\u00e4schke","year":"2008","unstructured":"J\u00e4schke R, Hotho A, Schmitz C, Ganter B, Stumme G (2008) Discovering shared conceptualizations in folksonomies. Web Semant 6(1):38\u201353","journal-title":"Web Semant"},{"issue":"3","key":"319_CR26","doi-asserted-by":"crossref","first-page":"263","DOI":"10.3233\/FI-2010-249","volume":"99","author":"TY Jen","year":"2010","unstructured":"Jen TY, Laurent D, Spyratos N (2010) Computing supports of conjunctive queries on relational tables with functional dependencies. Fundam Inf 99(3):263\u2013292","journal-title":"Fundam Inf"},{"key":"319_CR27","doi-asserted-by":"crossref","unstructured":"Ji M, Han J, Danilevsky M (2011) Ranking-based classification of heterogeneous information networks. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 1298\u20131306","DOI":"10.1145\/2020408.2020603"},{"key":"319_CR28","doi-asserted-by":"crossref","unstructured":"Ji M, Sun Y, Danilevsky M, Han J, Gao J (2010) Graph regularized transductive classification on heterogeneous information networks. In: ECML\/PKDD (1), pp 570\u2013586","DOI":"10.1007\/978-3-642-15880-3_42"},{"key":"319_CR29","unstructured":"Ji L, Tan KL, Tung AKH (2006) Mining frequent closed cubes in 3d datasets. In: Proceedings of the international conference on very large data bases, VLDB endowment, VLDB, pp 811\u2013822"},{"key":"319_CR30","doi-asserted-by":"crossref","unstructured":"Kontonasios K, Spyropoulou E, De Bie T (2012) Knowledge discovery interestingness measures based on unexpectedness. In: Wiley interdisciplinary reviews: data mining and knowledge discovery, pp 386\u2013399","DOI":"10.1002\/widm.1063"},{"key":"319_CR31","doi-asserted-by":"crossref","unstructured":"Koopman A, Siebes A (2008) Discovering relational item sets efficiently. In: Proceedings of the SIAM conference on data mining (SDM), pp 108\u2013119","DOI":"10.1137\/1.9781611972788.10"},{"key":"319_CR32","doi-asserted-by":"crossref","unstructured":"Koopman A, Siebes A (2009) Characteristic relational patterns. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 437\u2013446","DOI":"10.1145\/1557019.1557071"},{"key":"319_CR33","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01918757","volume":"29","author":"B Korte","year":"1985","unstructured":"Korte B, Lov\u00e1sz L (1985) Relations between subclasses of greedoids. Math Methods Oper Res 29:249\u2013267","journal-title":"Math Methods Oper Res"},{"key":"319_CR34","doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G (2001) Frequent subgraph discovery. In: Proceedings of the IEEE international conference on data mining (ICDM), pp 313\u2013320","DOI":"10.1109\/ICDM.2001.989534"},{"issue":"3","key":"319_CR35","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1137\/0209042","volume":"9","author":"EL Lawler","year":"1980","unstructured":"Lawler EL, Lenstra JK, Kan AHGR (1980) Generating all maximal independent sets: Np-hardness and polynomial-time algorithms. SIAM J Comput 9(3):558\u2013565","journal-title":"SIAM J Comput"},{"key":"319_CR36","doi-asserted-by":"crossref","unstructured":"Makino K, Uno T (2004) New algorithms for enumerating all maximal cliques. In: Scandinavia workshop on algorithm theory (SWAT), pp 260\u2013272","DOI":"10.1007\/978-3-540-27810-8_23"},{"key":"319_CR37","doi-asserted-by":"crossref","unstructured":"Maruhashi K, Guo F, Faloutsos C (2011) Multiaspectforensics: Pattern mining on large-scale heterogeneous networks with tensor analysis. In: Proceedings of the international conference on advances in social networks analysis and mining, ASONAM \u201911, pp 203\u2013210","DOI":"10.1109\/ASONAM.2011.80"},{"key":"319_CR38","unstructured":"Ng EKK, Ng K, Fu AWC, Wang K (2002) Mining association rules from stars. In: Proceedings of the IEEE international conference on data mining (ICDM), pp 322\u2013329"},{"key":"319_CR39","doi-asserted-by":"crossref","unstructured":"Nijssen S, Jim\u00e9nez A, Guns T (2011) Constraint-based pattern mining in multi-relational databases. In: ICDM workshops, pp 1120\u20131127","DOI":"10.1109\/ICDMW.2011.54"},{"key":"319_CR40","doi-asserted-by":"crossref","unstructured":"Nijssen S, Kok J (2003) Efficient frequent query discovery in FARMER. In: Proceedings of the European conference on principles and practice of knowledge discovery in databases (PKDD), pp 350\u2013362","DOI":"10.1007\/978-3-540-39804-2_32"},{"key":"319_CR41","doi-asserted-by":"crossref","unstructured":"Ojala M, Garriga GC, Gionis A, Mannila H (2010) Evaluating query result significance in databases via randomizations. In: Proceedings of the SIAM conference on data mining (SDM), pp 906\u2013917","DOI":"10.1137\/1.9781611972801.79"},{"key":"319_CR42","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"PM Pardalos","year":"1994","unstructured":"Pardalos PM, Xue J (1994) The maximum clique problem. J Glob Optim 4:301\u2013328","journal-title":"J Glob Optim"},{"key":"319_CR43","unstructured":"Poernomo AK, Gopalkrishnan V (2009) Towards efficient mining of proportional fault-tolerant frequent itemsets. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 697\u2013706"},{"key":"319_CR44","doi-asserted-by":"crossref","unstructured":"Siebes A, Vreeken J, van Leeuwen M (2006) Item sets that compress. In: Proceedings of the SIAM conference on data mining (SDM), pp 393\u2013404","DOI":"10.1137\/1.9781611972764.35"},{"key":"319_CR45","doi-asserted-by":"crossref","unstructured":"Spyropoulou E, De Bie T (2011) Interesting multi-relational patterns. In: Proceedings of the IEEE international conference on data mining (ICDM), pp 675\u2013684","DOI":"10.1109\/ICDM.2011.82"},{"key":"319_CR46","doi-asserted-by":"crossref","unstructured":"Srikant R, Agrawal R (1996) Mining quantitative association rules in large relational tables. In: Proceedings of the ACM SIGMOD international conference on management of data, pp 1\u201312","DOI":"10.1145\/235968.233311"},{"key":"319_CR47","doi-asserted-by":"crossref","unstructured":"Sun Y, Han J, Aggarwal CC, Chawla NV (2012a) When will it happen?: relationship prediction in heterogeneous information networks. In: Proceedings of the fifth ACM international conference on Web search and data mining, WSDM \u201912, pp 663\u2013672","DOI":"10.1145\/2124295.2124373"},{"key":"319_CR48","doi-asserted-by":"crossref","unstructured":"Sun Y, Norick B, Han J, Yan X, Yu PS, Yu X (2012b) Integrating meta-path selection with user-guided object clustering in heterogeneous information networks. In: KDD, pp 1348\u20131356","DOI":"10.1145\/2339530.2339738"},{"key":"319_CR49","doi-asserted-by":"crossref","unstructured":"Sun Y, Yu Y, Han J (2009) Ranking-based clustering of heterogeneous information networks with star network schema. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 797\u2013806","DOI":"10.1145\/1557019.1557107"},{"issue":"1","key":"319_CR50","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10618-011-0231-0","volume":"25","author":"L Tang","year":"2012","unstructured":"Tang L, Wang X, Liu H (2012) Community detection via heterogeneous interaction analysis. Data Min Knowl Discov 25(1):1\u201333","journal-title":"Data Min Knowl Discov"},{"key":"319_CR51","doi-asserted-by":"crossref","unstructured":"Trabelsi C, Jelassi N, Ben Yahia S (2012) Scalable mining of frequent tri-concepts from folksonomies. In: Advances in knowledge discovery and data mining, pp 231\u2013242","DOI":"10.1007\/978-3-642-30220-6_20"},{"key":"319_CR52","doi-asserted-by":"crossref","unstructured":"Uno T, Asai T, Uchida Y, Arimura H (2004a) An efficient algorithm for enumerating closed patterns in transaction databases. In: Discovery science, pp 16\u201331","DOI":"10.1007\/978-3-540-30214-8_2"},{"key":"319_CR53","doi-asserted-by":"crossref","unstructured":"Uno T, Kiyomi M, Arimura H (2004b) Lcm ver. 2: Efficient mining algorithms for frequent\/closed\/maximal itemsets. In: Proceedings of the IEEE ICDM workshop on frequent itemset mining implementations (FIMI), Brighton","DOI":"10.1145\/1133905.1133916"},{"issue":"3","key":"319_CR54","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1023\/A:1021252203599","volume":"19","author":"G Voutsadakis","year":"2002","unstructured":"Voutsadakis G (2002) Polyadic concept analysis. Order 19(3):295\u2013304","journal-title":"Order"},{"issue":"1","key":"319_CR55","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1145\/1147234.1147248","volume":"8","author":"B Yahia","year":"2006","unstructured":"Yahia B, Hamrouni T, Nguifo EM (2006) Frequent closed itemset based algorithms: a thorough structural and analytical survey. SIGKDD Explor Newsl 8(1):93\u2013104","journal-title":"SIGKDD Explor Newsl"},{"key":"319_CR56","unstructured":"Yan X, Han J (2002) gspan: Graph-based substructure pattern mining. In: Proceedings of the IEEE international conference on data mining (ICDM), pp 721\u2013730"},{"key":"319_CR57","doi-asserted-by":"crossref","unstructured":"Yan X, Han J (2003) Closegraph: mining closed frequent graph patterns. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 286\u2013295","DOI":"10.1145\/956750.956784"},{"issue":"3","key":"319_CR58","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki MJ (2000) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12(3):372\u2013390","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"319_CR59","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1109\/TKDE.2005.60","volume":"17","author":"M Zaki","year":"2005","unstructured":"Zaki M, Hsiao CJ (2005) Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans Knowl Data Eng 17(4):462\u2013478","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"319_CR60","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.datak.2006.01.005","volume":"60","author":"MJ Zaki","year":"2007","unstructured":"Zaki MJ, Peters M, Assent I, Seidl T (2007) Clicks: an effective algorithm for mining subspace clusters in categorical datasets. Data Knowl Eng 60(1):51\u201370","journal-title":"Data Knowl Eng"},{"key":"319_CR61","doi-asserted-by":"crossref","unstructured":"Zaki M, Hsiao CJ (2002) CHARM: an efficient algorithm for closed itemset mining. In: Proceedings of the SIAM international conference on data mining (SDM), pp 457\u2013473","DOI":"10.1137\/1.9781611972726.27"},{"key":"319_CR62","unstructured":"Zaki M, Ogihara M (1998) Theoretical foundations of association rules. In: Proceedings of the ACM SIGMOD workshop on research issues in data mining and knowledge discovery, San Diego"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-013-0319-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-013-0319-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-013-0319-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,26]],"date-time":"2020-07-26T17:17:43Z","timestamp":1595783863000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-013-0319-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,14]]},"references-count":62,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["319"],"URL":"https:\/\/doi.org\/10.1007\/s10618-013-0319-9","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,14]]}}}