{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:37:26Z","timestamp":1764995846166},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,12,11]],"date-time":"2010-12-11T00:00:00Z","timestamp":1292025600000},"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":[[2011,11]]},"DOI":"10.1007\/s10618-010-0209-3","type":"journal-article","created":{"date-parts":[[2010,12,10]],"date-time":"2010-12-10T10:32:04Z","timestamp":1291977124000},"page":"407-446","source":"Crossref","is-referenced-by-count":96,"title":["Maximum entropy models and subjective interestingness: an application to tiles in binary databases"],"prefix":"10.1007","volume":"23","author":[{"given":"Tijl","family":"De Bie","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,12,11]]},"reference":[{"key":"209_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 databases (VLDB94), pp 487\u2013499"},{"key":"209_CR2","unstructured":"Asuncion A, Newman D (2007) UCI machine learning repository. http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"issue":"5439","key":"209_CR3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barabasi","year":"1999","unstructured":"Barabasi AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439): 509\u2013512","journal-title":"Science"},{"key":"209_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd S, Vandeberghe L (2004) Convex optimization. Cambridge University Press, Cambridge"},{"key":"209_CR5","doi-asserted-by":"crossref","unstructured":"Brijs T, Swinnen G, Vanhoof K, Wets G (1999) Using association rules for product assortment decisions: a case study. In: Proceedings of the 5th ACM SIGKDD international conference on Knowledge discovery in databases (KDD99), pp 254\u2013260","DOI":"10.1145\/312129.312241"},{"issue":"1-2","key":"209_CR6","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.tcs.2007.11.003","volume":"394","author":"T Calders","year":"2008","unstructured":"Calders T (2008) Itemset frequency satisfiability: complexity and axiomatization. Theor Comput Sci 394 (1-2): 84\u2013111","journal-title":"Theor Comput Sci"},{"issue":"1","key":"209_CR7","first-page":"91","volume":"1","author":"F Chung","year":"2004","unstructured":"Chung F, Lu L (2004) The average distance in a random graph with given expected degrees. Int Math 1(1): 91\u2013113","journal-title":"Int Math"},{"key":"209_CR8","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","volume-title":"Elements of information theory","author":"TM Cover","year":"1991","unstructured":"Cover TM, Thomas JA (1991) Elements of information theory. Wiley-Interscience, Hoboken"},{"key":"209_CR9","unstructured":"De Bie T (2009a) Explicit probabilistic models for databases and networks. Tech. Rep. 123931, arXiv:0906.5148v1, University of Bristol"},{"key":"209_CR10","unstructured":"De Bie T (2009b) Finding interesting itemsets using a probabilistic model for binary databases. Tech. Rep. 123930, University of Bristol"},{"key":"209_CR11","doi-asserted-by":"crossref","unstructured":"De Raedt L, Zimmermann A (2007) Constraint-based pattern set mining. In: Proceedings of the 2007 SIAM international conference on Data mining (SDM08), pp 237\u2013248","DOI":"10.1137\/1.9781611972771.22"},{"key":"209_CR12","doi-asserted-by":"crossref","unstructured":"Gallo A, De Bie T, Cristianini N (2007) MINI: Mining informative non-redundant itemsets. In: Proceedings of the 11th European conference on Principles and practice of knowledge discovery in databases (PKDD07), pp 438\u2013445","DOI":"10.1007\/978-3-540-74976-9_44"},{"key":"209_CR13","unstructured":"Gallo A, Mammone A, De Bie T, Turchi M, Cristianini N (2009) From frequent itemsets to informative patterns. Tech. Rep. 123936, University of Bristal"},{"key":"209_CR14","doi-asserted-by":"crossref","unstructured":"Geerts F, Goethals B, Mielik\u00e4inen T (2004) Tiling databases. In: Proceedings of the 7th international conference on Discovery science (DS04), pp 278\u2013289","DOI":"10.1007\/978-3-540-30214-8_22"},{"issue":"3","key":"209_CR15","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/1132960.1132963","volume":"38","author":"L Geng","year":"2006","unstructured":"Geng L, Hamilton HJ (2006) Interestingness measures for data mining: a survey. ACM Comput Surv 38(3): 9","journal-title":"ACM Comput Surv"},{"key":"209_CR16","volume-title":"Elements of computational statistics","author":"JE Gentle","year":"2005","unstructured":"Gentle JE (2005) Elements of computational statistics. Springer, New York"},{"key":"209_CR17","doi-asserted-by":"crossref","unstructured":"Gionis A, Mannila H, Sepp\u00e4nen JK (2004) Geometric and combinatorial tiles in 0-1 data. In: Principles and practice of knowledge discovery in databases (PKDD04), pp 173\u2013184","DOI":"10.1007\/978-3-540-30116-5_18"},{"issue":"3","key":"209_CR18","doi-asserted-by":"crossref","first-page":"14","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): 14","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"6","key":"209_CR19","first-page":"646","volume":"131","author":"S Gull","year":"1984","unstructured":"Gull S, Skilling J (1984) Maximum entropy method in image processing. Communications, radar and signal processing. IEE Proc F 131(6): 646\u2013659","journal-title":"IEE Proc F"},{"key":"209_CR20","doi-asserted-by":"crossref","unstructured":"Hanhijarvi 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 SIGKDD international conference on Knowledge discovery and data mining (KDD09), pp 379\u2013388","DOI":"10.1145\/1557019.1557065"},{"key":"209_CR21","doi-asserted-by":"crossref","unstructured":"Jaroszewicz S, Simovici DA (2004) Interestingness of frequent itemsets using bayesian networks as background knowledge. In: Proceedings of the 10th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD04), pp 178\u2013186","DOI":"10.1145\/1014052.1014074"},{"issue":"4","key":"209_CR22","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1103\/PhysRev.106.620","volume":"106","author":"E Jaynes","year":"1957","unstructured":"Jaynes E (1957) Information theory and statistical mechanics I. Phys Rev 106(4): 620\u2013630","journal-title":"Phys Rev"},{"issue":"9","key":"209_CR23","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1109\/PROC.1982.12425","volume":"70","author":"E Jaynes","year":"1982","unstructured":"Jaynes E (1982) On the rationale of maximum-entropy methods. Proc IEEE 70(9): 939\u2013952","journal-title":"Proc IEEE"},{"issue":"1","key":"209_CR24","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"Khuller S","year":"1999","unstructured":"Khuller S, Moss A, Naor J (1999) The budgeted maximum coverage problem. Inf Process Lett 70(1):39\u201345","journal-title":"Inf Process Lett"},{"key":"209_CR25","unstructured":"Kontonasios KN, De Bie T (2010) An information-theoretic approach to finding informative noisy tiles in binary databases. In: Proceedings of the 2010 SIAM international conference on Data mining (SDM10), pp 153\u2013164"},{"key":"209_CR26","volume-title":"Testing statistical hypotheses","author":"E Lehmann","year":"1995","unstructured":"Lehmann E, Romano J (1995) Testing statistical hypotheses, 3rd edn. Springer, New York","edition":"3"},{"key":"209_CR27","doi-asserted-by":"crossref","unstructured":"Mannila H (2008) Randomization techniques for data mining methods. In: Proceedings of the 12th East European conference on Advances in databases and information systems (ADBIS08), p 1","DOI":"10.1007\/978-3-540-85713-6_1"},{"issue":"10","key":"209_CR28","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1109\/TKDE.2008.53","volume":"20","author":"P Miettinen","year":"2008","unstructured":"Miettinen P, Mielikainen T, Gionis A, Das G, Mannila H (2008) The discrete basis problem. IEEE Trans Knowl Data Eng 20(10): 1348\u20131362","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"5594","key":"209_CR29","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo R, Shen-Orr S, Itzkovirz S, Kashtan N, Chklovskii D, Alon U (2002) Network motifs: simple building blocks of complex networks. Science 298(5594): 824\u2013827","journal-title":"Science"},{"key":"209_CR30","doi-asserted-by":"crossref","unstructured":"Minoux M (1978) Accelerated greedy algorithms for maximizing submodular set functions. Optimization Techniques. Springer, Berlin, pp 234\u2013243","DOI":"10.1007\/BFb0006528"},{"issue":"2","key":"209_CR31","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"M Newman","year":"2003","unstructured":"Newman M (2003) The structure and function of complex networks. SIAM Rev 45(2): 167\u2013256","journal-title":"SIAM Rev"},{"key":"209_CR32","doi-asserted-by":"crossref","unstructured":"Ojala M, Vuokko N, Kallio A, Haiminen N, Mannila H (2008) Randomization of real-valued matrices for assessing the significance of data mining results. In: Proceedings of the 2008 SIAM international conference on Data mining (SDM08), pp 494\u2013505","DOI":"10.1137\/1.9781611972788.45"},{"key":"209_CR33","unstructured":"Padmanabhan B, Tuzhilin A (1998) A belief-driven method for discovering unexpected patterns. In: Proceedings of the 4th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD98), pp 94\u2013100"},{"key":"209_CR34","doi-asserted-by":"crossref","unstructured":"Padmanabhan B, Tuzhilin A (2000) Small is beautiful: discovering the minimal set of unexpected patterns. In: Proceedings of the 6th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD00), pp 54\u201363","DOI":"10.1145\/347090.347103"},{"key":"209_CR35","doi-asserted-by":"crossref","first-page":"1409","DOI":"10.1109\/TKDE.2003.1245281","volume":"15","author":"D Pavlov","year":"2003","unstructured":"Pavlov D, Mannila H, Smyth P (2003) Beyond independence: probabilistic models for query approximation on binary transaction data. IEEE Trans Knowl Data Eng 15: 1409\u20131421","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"209_CR36","unstructured":"Rasch G (1961) On general laws and the meaning of measurement in psychology. In: Proceedings of the fourth Berkeley symposium on Mathematical statistics and probability, vol IV, pp 321\u2013333"},{"issue":"2","key":"209_CR37","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.socnet.2006.08.002","volume":"29","author":"G Robins","year":"2007","unstructured":"Robins G, Pattison P, Kalish Y, Lusher D (2007) An introduction to exponential random graph (p*) models for social networks. Soc Netw 29(2): 173\u2013191","journal-title":"Soc Netw"},{"key":"209_CR38","doi-asserted-by":"crossref","unstructured":"Savinov A (2004) Mining dependence rules by finding largest itemset support quota. In: Proceedings of the 2004 ACM symposium on Applied computing, pp 525\u2013529","DOI":"10.1145\/967900.968011"},{"key":"209_CR39","unstructured":"Shewchuk J (1994) An introduction to the conjugate gradient method without the agonizing pain. Tech. rep, CMU"},{"key":"209_CR40","doi-asserted-by":"crossref","unstructured":"Siebes A, Vreeken J, van Leeuwen M (2006) Item sets that compress. In: Proceedings of the 2006 SIAM international conference on Data mining (SDM06), pp 393\u2013404","DOI":"10.1137\/1.9781611972764.35"},{"key":"209_CR41","unstructured":"Silberschatz A, Tuzhilin A (1995) On subjective measures of interestingness in knowledge discovery. In: Proceedings of the 1st ACM SIGKDD international conference on Knowledge discovery and data mining (KDD95), pp 275\u2013281"},{"issue":"1","key":"209_CR42","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10115-008-0128-4","volume":"17","author":"N Tatti","year":"2008","unstructured":"Tatti N (2008) Maximum entropy based significance of itemsets. Knowl Inf Syst 17(1): 57\u201377","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"209_CR43","first-page":"8","volume":"15","author":"F Tops\u00f8e","year":"1979","unstructured":"Tops\u00f8e F (1979) Information-theoretical optimization techniques. Kybernetika 15(1): 8\u201327","journal-title":"Kybernetika"},{"key":"209_CR44","unstructured":"Tribus M (1961) Thermostatics and thermodynamics: an introduction to energy, information and states of matter, with engineering applications. Van Nostrand, Princeton"},{"issue":"1-2","key":"209_CR45","first-page":"1","volume":"1","author":"M Wainwright","year":"2008","unstructured":"Wainwright M, Jordan MI (2008) Graphical models, exponential families, and variational inference. Found Trends Mach Learn 1(1-2): 1\u2013305","journal-title":"Found Trends Mach Learn"},{"key":"209_CR46","doi-asserted-by":"crossref","unstructured":"Zaki M, Hsiao C (2002) CHARM: an efficient algorithm for closed itemsets mining. In: Proceedings of the 2002 SIAM international conference on Data mining (SDM02), pp 457\u2013473","DOI":"10.1137\/1.9781611972726.27"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-010-0209-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-010-0209-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-010-0209-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T23:36:59Z","timestamp":1559864219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-010-0209-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,11]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["209"],"URL":"https:\/\/doi.org\/10.1007\/s10618-010-0209-3","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,11]]}}}