{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T22:23:44Z","timestamp":1773872624415,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2014,7,22]],"date-time":"2014-07-22T00:00:00Z","timestamp":1405987200000},"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":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s10618-014-0370-1","type":"journal-article","created":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T00:47:07Z","timestamp":1405903627000},"page":"1398-1428","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Uncovering the plot: detecting surprising coalitions of entities in multi-relational schemas"],"prefix":"10.1007","volume":"28","author":[{"given":"Hao","family":"Wu","sequence":"first","affiliation":[]},{"given":"Jilles","family":"Vreeken","sequence":"additional","affiliation":[]},{"given":"Nikolaj","family":"Tatti","sequence":"additional","affiliation":[]},{"given":"Naren","family":"Ramakrishnan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,22]]},"reference":[{"key":"370_CR1","unstructured":"Califano A, Stolovitzky G, Tu Y (2000) Analysis of gene expression microarrays for phenotype classification. In: Proceedings of the 8th international conference on intelligent systems for molecular biology, pp 75\u201385"},{"issue":"1","key":"370_CR2","doi-asserted-by":"crossref","first-page":"3:1","DOI":"10.1145\/1497577.1497580","volume":"3","author":"L Cerf","year":"2009","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","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"3","key":"370_CR3","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1007\/s10618-012-0284-8","volume":"26","author":"L Cerf","year":"2013","unstructured":"Cerf L, Besson J, Nguyen KNT, Boulicaut JF (2013) Closed and noise-tolerant patterns in n-ary relations. Data Min Knowl Discov 26(3):574\u2013619","journal-title":"Data Min Knowl Discov"},{"key":"370_CR4","unstructured":"Cheng Y, Church GM (2000) Biclustering of expression data. In: Proceedings of the eighth international conference on intelligent systems for molecular biology, AAAI Press, pp 93\u2013103"},{"key":"370_CR5","volume-title":"Elements of information theory","author":"T Cover","year":"2006","unstructured":"Cover T, Thomas J (2006) Elements of information theory. Wiley, New York"},{"issue":"1","key":"370_CR6","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1214\/aop\/1176996454","volume":"3","author":"I Csiszar","year":"1975","unstructured":"Csiszar I (1975) $$I$$ I -Divergence geometry of probability distributions and minimization problems. Ann Probab 3(1):146\u2013158","journal-title":"Ann Probab"},{"issue":"5","key":"370_CR7","doi-asserted-by":"crossref","first-page":"1470","DOI":"10.1214\/aoms\/1177692379","volume":"43","author":"JN Darroch","year":"1972","unstructured":"Darroch JN, Ratcliff D (1972) Generalized iterative scaling for log-linear models. Ann Math Stat 43(5):1470\u20131480","journal-title":"Ann Math Stat"},{"key":"370_CR8","doi-asserted-by":"crossref","unstructured":"Davis WLI, Schwarz P, Terzi E (2009) Finding representative association rules from large rule collections. In: Proceedings of the 9th SIAM international conference on data mining (SDM). Sparks, NV, SIAM, pp 521\u2013532","DOI":"10.1137\/1.9781611972795.45"},{"issue":"3","key":"370_CR9","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 (2011) 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":"370_CR10","unstructured":"Dehaspe L, Toironen H (2000) Discovery of relational association rules. In: D\u0115zeroski S (ed) Relational data mining. Springer, New York Inc, pp 189\u2013208"},{"key":"370_CR11","volume-title":"Relational data mining","year":"2001","unstructured":"Dzeroski S, Lavrac N (eds) (2001) Relational data mining. Springer, Berlin"},{"key":"370_CR12","doi-asserted-by":"crossref","unstructured":"Geerts F, Goethals B, Mielikainen T (2004) Tiling databases. In: Proceedings of discovery science. Springer, Berlin, pp 278\u2013289","DOI":"10.1007\/978-3-540-30214-8_22"},{"issue":"3","key":"370_CR13","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1145\/1297332.1297338","volume":"1","author":"A Gionis","year":"2007","unstructured":"Gionis A, Mannila H, Mielik\u00e4inen T, Tsaparas P (2007) Assessing data mining results via swap randomization. ACM Trans Knowl Discov Data 1(3):167\u2013176","journal-title":"ACM Trans Knowl Discov Data"},{"key":"370_CR14","doi-asserted-by":"crossref","unstructured":"Hanhij\u00e4rvi S, Ojala M, Vuokko N, Puolam\u00e4ki K, Tatti N, Mannila H (2009) Tell me something I don\u2019t know: randomization strategies for iterative data mining. In: Proceedings of the 15th ACM international conference on knowledge discovery and data mining (SIGKDD). ACM, Paris, France, pp 379\u2013388","DOI":"10.1145\/1557019.1557065"},{"key":"370_CR15","doi-asserted-by":"crossref","unstructured":"Hossain M, Gresock J, Edmonds Y, Helm R, Potts M, Ramakrishnan N (2012a) Connecting the dots between PubMed abstracts. PLoS ONE 7(1)","DOI":"10.1371\/journal.pone.0029509"},{"key":"370_CR16","doi-asserted-by":"crossref","unstructured":"Hossain MS, Butler P, Boedihardjo AP, Ramakrishnan N (2012b) Storytelling in entity networks to support intelligence analysts. In: Proceedings of the 18th ACM international conference on knowledge discovery and data mining (SIGKDD). ACM, Beijing, China, pp 1375\u20131383","DOI":"10.1145\/2339530.2339742"},{"key":"370_CR17","unstructured":"Hughes FJ (2005) Discovery, proof, choice: the art and science of the process of intelligence analysis, case study 6, \u201cAll Fall Down\u201d, unpublished report"},{"issue":"4","key":"370_CR18","first-page":"620","volume":"106","author":"ET Jaynes","year":"1957","unstructured":"Jaynes ET (1957) Information theory and statistical mechanics. Phys Rev Ser II 106(4):620\u2013630","journal-title":"Phys Rev Ser II"},{"issue":"1","key":"370_CR19","first-page":"2:1","volume":"2","author":"Y Jin","year":"2008","unstructured":"Jin Y, Murali TM, Ramakrishnan N (2008) Compositional mining of multirelational biological datasets. ACM Trans Knowl Discov Data 2(1):2:1\u20132:35","journal-title":"ACM Trans Knowl Discov Data"},{"key":"370_CR20","doi-asserted-by":"crossref","unstructured":"Kiernan J, Terzi E (2008) Constructing comprehensive summaries of large event sequences. In: Proceedings of the 14th ACM international conference on knowledge discovery and data mining (SIGKDD). Las Vegas, NV, pp 417\u2013425","DOI":"10.1145\/1401890.1401943"},{"key":"370_CR21","doi-asserted-by":"crossref","unstructured":"Kontonasios KN, Vreeken J, De Bie T (2011) Maximum entropy modelling for assessing results on real-valued data. In: Proceedings of the 11th IEEE international conference on data mining (ICDM). Vancouver, Canada, IEEE, pp 350\u2013359","DOI":"10.1109\/ICDM.2011.98"},{"key":"370_CR22","doi-asserted-by":"crossref","unstructured":"Kontonasios KN, Vreeken J, De Bie T (2013) Maximum entropy models for iteratively identifying subjectively interesting structure in real-valued data. In: Proceedings of the European conference on machine learning and principles and practice of knowledge discovery in databases (ECML PKDD). Springer, Prague, Czech Republic, pp 256\u2013271","DOI":"10.1007\/978-3-642-40991-2_17"},{"key":"370_CR23","doi-asserted-by":"crossref","unstructured":"Kumar D, Ramakrishnan N, Helm RF, Potts M (2006) Algorithms for storytelling. In: Proceedings of the 12th ACM international conference on knowledge discovery and data Mining (SIGKDD), Philadelphia, PA, pp 604\u2013610","DOI":"10.1145\/1150402.1150475"},{"issue":"4","key":"370_CR24","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1145\/383779.383781","volume":"2","author":"N Lavrac","year":"2001","unstructured":"Lavrac N, Flach P (2001) An extended transformation approach to inductive logic programming. ACM Trans Comput Logic 2(4):458\u2013494","journal-title":"ACM Trans Comput Logic"},{"issue":"1","key":"370_CR25","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/TCBB.2004.2","volume":"1","author":"SC Madeira","year":"2004","unstructured":"Madeira SC, Oliveira AL (2004) Biclustering algorithms for biological data analysis: a survey. IEEE\/ACM Trans Comput Biol Bioinf 1(1):24\u201345","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"key":"370_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2382577.2382580","volume":"6","author":"M Mampaey","year":"2012","unstructured":"Mampaey M, Vreeken J, Tatti N (2012) Summarizing data succinctly with the most informative itemsets. ACM Trans Knowl Discov Data 6:1\u201344","journal-title":"ACM Trans Knowl Discov Data"},{"key":"370_CR27","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 10th SIAM international conference on data mining (SDM). Columbus, OH, pp 906\u2013917","DOI":"10.1137\/1.9781611972801.79"},{"key":"370_CR28","unstructured":"Rasch G (1960) Probabilistic models for some intelligence and attainnment tests. Danmarks paedagogiske Institut"},{"issue":"1","key":"370_CR29","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J Rissanen","year":"1978","unstructured":"Rissanen J (1978) Modeling by shortest data description. Automatica 14(1):465\u2013471","journal-title":"Automatica"},{"issue":"2","key":"370_CR30","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1214\/aos\/1176344136","volume":"6","author":"G Schwarz","year":"1978","unstructured":"Schwarz G (1978) Estimating the dimension of a model. Ann Stat 6(2):461\u2013464","journal-title":"Ann Stat"},{"issue":"suppl 1","key":"370_CR31","doi-asserted-by":"crossref","first-page":"S243","DOI":"10.1093\/bioinformatics\/17.suppl_1.S243","volume":"17","author":"E Segal","year":"2001","unstructured":"Segal E, Taskar B, Gasch A, Friedman N, Koller D (2001) Rich probabilistic models for gene expression. Bioinformatics 17(suppl 1):S243\u2013S252","journal-title":"Bioinformatics"},{"key":"370_CR32","doi-asserted-by":"crossref","unstructured":"Shahaf D, Guestrin C (2010) Connecting the dots between news articles. In: Proceedings of the 16th ACM international conference on knowledge discovery and data mining (SIGKDD). ACM, Washington, DC, pp 623\u2013632","DOI":"10.1145\/1835804.1835884"},{"issue":"4","key":"370_CR33","doi-asserted-by":"crossref","first-page":"24:1","DOI":"10.1145\/2086737.2086744","volume":"5","author":"D Shahaf","year":"2012","unstructured":"Shahaf D, Guestrin C (2012) Connecting two (or less) dots: discovering structure in news articles. ACM Trans Knowl Discov Data 5(4):24:1\u201324:31","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"suppl 2","key":"370_CR34","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1093\/bioinformatics\/btg1078","volume":"19","author":"Q Sheng","year":"2003","unstructured":"Sheng Q, Moreau Y, De Moor B (2003) Biclustering microarray data by gibbs sampling. Bioinformatics 19(suppl 2):196\u2013205","journal-title":"Bioinformatics"},{"key":"370_CR35","doi-asserted-by":"crossref","unstructured":"Spyropoulou E, De Bie T (2011) Interesting multi-relational patterns. Proceedings of the 11th IEEE international conference on data mining (ICDM). Vancouver, Canada, pp 675\u2013684","DOI":"10.1109\/ICDM.2011.82"},{"key":"370_CR36","doi-asserted-by":"crossref","unstructured":"Spyropoulou E, De Bie T, Boley M (2013) Mining interesting patterns in multi-relational data with n-ary relationships. Discovery Science, vol 8140, Lecture Notes in Computer Science. Springer, Berlin, pp 217\u2013232","DOI":"10.1007\/978-3-642-40897-7_15"},{"issue":"3","key":"370_CR37","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1007\/s10618-013-0319-9","volume":"28","author":"E Spyropoulou","year":"2014","unstructured":"Spyropoulou E, De Bie T, Boley M (2014) Interesting pattern mining in multi-relational data. Data Min Knowl Discov 28(3):808\u2013849","journal-title":"Data Min Knowl Discov"},{"issue":"5","key":"370_CR38","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.ipl.2006.02.003","volume":"98","author":"N Tatti","year":"2006","unstructured":"Tatti N (2006) Computational complexity of queries based on itemsets. Inf Process Lett 98(5):183\u2013187. doi: 10.1016\/j.ipl.2006.02.003","journal-title":"Inf Process Lett"},{"issue":"2","key":"370_CR39","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s10618-012-0275-9","volume":"25","author":"N Tatti","year":"2012","unstructured":"Tatti N, Vreeken J (2012) Comparing apples and oranges - measuring differences between exploratory data mining results. Data Min Knowl Disc 25(2):173\u2013207","journal-title":"Data Min Knowl Disc"},{"key":"370_CR40","unstructured":"Tibshirani R, Hastie T, Eisen M, Ross D, Botstein D, Brown P (1999) Clustering methods for the analysis of dna microarray data. Stanford University, Tech. rep"},{"key":"370_CR41","doi-asserted-by":"crossref","unstructured":"Uno T, Kiyomi M, Arimura H (2005) Lcm ver.3: collaboration of array, bitmap and prefix tree for frequent itemset mining. In: Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations, ACM, New York, NY, USA, OSDM \u201905, pp 77\u201386","DOI":"10.1145\/1133905.1133916"},{"key":"370_CR42","doi-asserted-by":"crossref","unstructured":"Wang C, Parthasarathy S (2006) Summarizing itemset patterns using probabilistic models. In: Proceedings of the 12th ACM international conference on knowledge discovery and data mining (SIGKDD), Philadelphia, PA, pp 730\u2013735","DOI":"10.1145\/1150402.1150495"},{"issue":"4","key":"370_CR43","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"},{"key":"370_CR44","unstructured":"Zaki MJ, Ramakrishnan N (2005) Reasoning about sets using redescription mining. In: Proceedings of the 11th ACM international conference on knowledge discovery and data mining (SIGKDD). ACM, Chicago, IL, pp 364\u2013373"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-014-0370-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-014-0370-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-014-0370-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T21:15:47Z","timestamp":1565644547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-014-0370-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,22]]},"references-count":44,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["370"],"URL":"https:\/\/doi.org\/10.1007\/s10618-014-0370-1","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,22]]}}}