{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T22:58:19Z","timestamp":1791154699161,"version":"4.1.0"},"publisher-location":"Cham","reference-count":78,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319078205","type":"print"},{"value":"9783319078212","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07821-2_5","type":"book-chapter","created":{"date-parts":[[2014,8,29]],"date-time":"2014-08-29T06:36:06Z","timestamp":1409294166000},"page":"105-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Interesting Patterns"],"prefix":"10.1007","author":[{"given":"Jilles","family":"Vreeken","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikolaj","family":"Tatti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,8,30]]},"reference":[{"key":"5_CR1","unstructured":"R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDB, pages\u00a0487\u2013499, 1994."},{"key":"5_CR2","first-page":"18","volume-title":"A new framework for itemset generation. In PODS","author":"C. C. Aggarwal","year":"1998","unstructured":"C. C. Aggarwal and P. S. Yu. A new framework for itemset generation. In PODS, pages\u00a018\u201324. ACM, 1998."},{"key":"5_CR3","first-page":"207","volume-title":"Mining association rules between sets of items in large databases. In SIGMOD","author":"R. Agrawal","year":"1993","unstructured":"R. Agrawal, T. Imielinksi, and A. Swami. Mining association rules between sets of items in large databases. In SIGMOD, pages\u00a0207\u2013216. ACM, 1993."},{"issue":"1","key":"5_CR4","first-page":"730","volume":"2","author":"M. Al Hasan","year":"2009","unstructured":"M. Al Hasan and M. J. Zaki. Output space sampling for graph patterns. PVLDB, 2(1):730\u2013741, 2009.","journal-title":"PVLDB"},{"key":"5_CR5","first-page":"153","volume-title":"Mining representative orthogonal graph patterns. In ICDM","author":"M. Al Hasan","year":"2007","unstructured":"M. Al Hasan, V. Chaoji, S. Salem, J. Besson, and M. J. Zaki. Origami: Mining representative orthogonal graph patterns. In ICDM, pages\u00a0153\u2013162. IEEE, 2007."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"R. Bayardo. Efficiently mining long patterns from databases. In SIGMOD, pages\u00a085\u201393, 1998.","DOI":"10.1145\/276305.276313"},{"key":"5_CR7","first-page":"582","volume-title":"Direct local pattern sampling by efficient two-step random procedures. In KDD","author":"M. Boley","year":"2011","unstructured":"M. Boley, C. Lucchese, D. Paurat, and T. G\u00e4rtner. Direct local pattern sampling by efficient two-step random procedures. In KDD, pages\u00a0582\u2013590. ACM, 2011."},{"key":"5_CR8","first-page":"69","volume-title":"Linear space direct pattern sampling using coupling from the past. In KDD","author":"M. Boley","year":"2012","unstructured":"M. Boley, S. Moens, and T. G\u00e4rtner. Linear space direct pattern sampling using coupling from the past. In KDD, pages\u00a069\u201377. ACM, 2012."},{"issue":"1","key":"5_CR9","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1021571501451","volume":"7","author":"J.-F. Boulicaut","year":"2003","unstructured":"J.-F. Boulicaut, A. Bykowski, and C. Rigotti. Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Min. Knowl. Disc., 7(1):5\u201322, 2003.","journal-title":"Data Min. Knowl. Disc"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: Generalizing association rules to correlations. In SIGMOD, pages\u00a0265\u2013276. ACM, 1997.","DOI":"10.1145\/253262.253327"},{"issue":"11","key":"5_CR11","first-page":"1490","volume":"17","author":"D. Burdick","year":"2005","unstructured":"D. Burdick, M. Calimlim, J. Flannick, J. Gehrke, and T. Yiu. MAFIA: A maximal frequent itemset algorithm. IEEE TKDE, 17(11):1490\u20131504, 2005.","journal-title":"IEEE TKDE"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"T. Calders and B. Goethals. Mining all non-derivable frequent itemsets. In PKDD, pages\u00a074\u201385, 2002.","DOI":"10.1007\/3-540-45681-3_7"},{"issue":"3","key":"5_CR13","first-page":"462","volume":"14","author":"C. Chow","year":"1968","unstructured":"C. Chow and C. Liu. Approximating discrete probability distributions with dependence trees. IEEE TIT, 14(3):462\u2013467, 1968.","journal-title":"IEEE TIT"},{"issue":"1","key":"5_CR14","first-page":"64","volume":"13","author":"E. Cohen","year":"2001","unstructured":"E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. D. Ullman, and C. Yang. Finding interesting associations without support pruning. IEEE TKDE, 13(1):64\u201378, 2001.","journal-title":"IEEE TKDE"},{"key":"5_CR15","unstructured":"R. G. Cowell, A. P. Dawid, S. L. Lauritzen, and D. J. Spiegelhalter. Probabilistic networks and expert systems. In Statistics for Engineering and Information Science. Springer-Verlag, 1999."},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"I. Csisz\u00e1r. I-divergence geometry of probability distributions and minimization problems. Annals Prob., 3(1):146\u2013158, 1975.","DOI":"10.1214\/aop\/1176996454"},{"key":"5_CR17","first-page":"564","volume-title":"An information theoretic framework for data mining. In KDD","author":"T. De Bie","year":"2011","unstructured":"T. De Bie. An information theoretic framework for data mining. In KDD, pages\u00a0564\u2013572. ACM, 2011."},{"issue":"3","key":"5_CR18","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10618-010-0209-3","volume":"23","author":"T. De Bie","year":"2011","unstructured":"T. De Bie. Maximum entropy models and subjective interestingness: an application to tiles in binary databases. Data Min. Knowl. Disc., 23(3):407\u2013446, 2011.","journal-title":"Data Min. Knowl. Disc"},{"issue":"1","key":"5_CR19","doi-asserted-by":"publisher","first-page":"87","DOI":"10.2307\/2340521","volume":"85","author":"R. A. Fisher","year":"1922","unstructured":"R. A. Fisher. On the interpretation of \u03c72from contingency tables, and the calculation of P. J. R. Statist. Soc., 85(1):87\u201394, 1922.","journal-title":"J. R. Statist. Soc"},{"key":"5_CR20","first-page":"438","volume-title":"MINI: Mining informative non-redundant itemsets. In ECML PKDD","author":"A. Gallo","year":"2007","unstructured":"A. Gallo, N. Cristianini, and T. De Bie. MINI: Mining informative non-redundant itemsets. In ECML PKDD, pages\u00a0438\u2013445. Springer, 2007."},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"F. Geerts, B. Goethals, and T. Mielik\u00e4inen. Tiling databases. In DS, pages\u00a0278\u2013289, 2004.","DOI":"10.1007\/978-3-540-30214-8_22"},{"key":"5_CR22","first-page":"173","volume-title":"Geometric and combinatorial tiles in 0-1 data. In PKDD","author":"A. Gionis","year":"2004","unstructured":"A. Gionis, H. Mannila, and J. K. Sepp\u00e4nen. Geometric and combinatorial tiles in 0-1 data. In PKDD, pages\u00a0173\u2013184. Springer, 2004."},{"issue":"3","key":"5_CR23","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1145\/1297332.1297338","volume":"1","author":"A. Gionis","year":"2007","unstructured":"A. Gionis, H. Mannila, T. Mielik\u00e4inen, and P. Tsaparas. Assessing data mining results via swap randomization. TKDD, 1(3):167\u2013176, 2007.","journal-title":"TKDD"},{"key":"5_CR24","unstructured":"B. Goethals and M. Zaki. Frequent itemset mining dataset repository (FIMI). http:\/\/fimi.ua.ac.be\/, 2004."},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"W. H\u00e4m\u00e4l\u00e4inen. Kingfisher: an efficient algorithm for searching for both positive and negative dependency rules with statistical significance measures. Knowl. Inf. Sys., 32(2):383\u2013414, 2012.","DOI":"10.1007\/s10115-011-0432-2"},{"key":"5_CR26","first-page":"1","volume-title":"Mining frequent patterns without candidate generation","author":"J. Han","year":"2000","unstructured":"J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In SIGMOD, pages\u00a01\u201312. ACM, 2000."},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"D. Hand, N. Adams, and R. Bolton, editors. Pattern Detection and Discovery. Springer-Verlag, 2002.","DOI":"10.1007\/3-540-45728-3"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"S. Hanhij\u00e4rvi, G. C. Garriga, and K. Puolam\u00e4ki. Randomization techniques for graphs. In SDM, pages\u00a0780\u2013791. SIAM, 2009.","DOI":"10.1137\/1.9781611972795.67"},{"key":"5_CR29","first-page":"379","volume-title":"Tell me something I don\u2019t know: randomization strategies for iterative data mining","author":"S. Hanhij\u00e4rvi","year":"2009","unstructured":"S. Hanhij\u00e4rvi, M. Ojala, N. Vuokko, K. Puolam\u00e4ki, N. Tatti, and H. Mannila. Tell me something I don\u2019t know: randomization strategies for iterative data mining. In KDD, pages\u00a0379\u2013388. ACM, 2009."},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"H. Heikinheimo, J. K. Sepp\u00e4nen, E. Hinkkanen, H. Mannila, and T. Mielik\u00e4inen. Finding low-entropy sets and trees from binary data. In KDD, pages\u00a0350\u2013359, 2007.","DOI":"10.1145\/1281192.1281232"},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"H. Heikinheimo, J. Vreeken, A. Siebes, and H. Mannila. Low-entropy set selection. Lowentropy set selection. In SDM, pages\u00a0569\u2013580, 2009.","DOI":"10.1137\/1.9781611972795.49"},{"key":"5_CR32","first-page":"337","volume-title":"Explaining interval sequences by randomization","author":"A. Henelius","year":"2013","unstructured":"A. Henelius, J. Korpela, and K. Puolam\u00e4ki. Explaining interval sequences by randomization. In ECML PKDD, pages\u00a0337\u2013352. Springer, 2013."},{"key":"5_CR33","unstructured":"IBM. IBM Intelligent Miner User\u2019s Guide, Version 1, Release 1, 1996."},{"key":"5_CR34","first-page":"178","volume-title":"Interestingness of frequent itemsets using bayesian networks as background knowledge. In KDD","author":"S. Jaroszewicz","year":"2004","unstructured":"S. Jaroszewicz and D. A. Simovici. Interestingness of frequent itemsets using bayesian networks as background knowledge. In KDD, pages\u00a0178\u2013186. ACM, 2004."},{"issue":"9","key":"5_CR35","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1109\/PROC.1982.12425","volume":"70","author":"E. Jaynes","year":"1982","unstructured":"E. Jaynes. On the rationale of maximum-entropy methods. Proc. IEEE, 70(9):939\u2013952, 1982.","journal-title":"Proc. IEEE"},{"key":"5_CR36","first-page":"85","volume-title":"Reducibility among combinatorial problems. In Proc. Compl. Comp. Comput.","author":"R. M. Karp","year":"1972","unstructured":"R. M. Karp. Reducibility among combinatorial problems. In Proc. Compl. Comp. Comput., pages\u00a085\u2013103, New York, USA, 1972."},{"key":"5_CR37","doi-asserted-by":"crossref","unstructured":"K.-N. Kontonasios and T. De Bie. An information-theoretic approach to finding noisy tiles in binary databases. In SDM, pages\u00a0153\u2013164. SIAM, 2010.","DOI":"10.1137\/1.9781611972801.14"},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"K.-N. Kontonasios and T. De Bie. Formalizing complex prior information to quantify subjective interestingness of frequent pattern sets. In IDA, pages\u00a0161\u2013171, 2012.","DOI":"10.1007\/978-3-642-34156-4_16"},{"key":"5_CR39","doi-asserted-by":"crossref","unstructured":"J. Lijffijt, P. Papapetrou, and K. Puolam\u00e4ki. A statistical significance testing approach to mining the most informative set of patterns. Data Min. Knowl. Disc., pages\u00a01\u201326, 2012.","DOI":"10.1007\/s10618-012-0298-2"},{"key":"5_CR40","doi-asserted-by":"crossref","unstructured":"C. Lucchese, S. Orlando, and R. Perego. Mining top-k patterns from binary datasets in presence of noise. In SDM, pages\u00a0165\u2013176, 2010.","DOI":"10.1137\/1.9781611972801.15"},{"key":"5_CR41","doi-asserted-by":"crossref","unstructured":"M. Mampaey. Mining non-redundant information-theoretic dependencies between itemsets. In DaWaK, pages\u00a0130\u2013141, 2010.","DOI":"10.1007\/978-3-642-15105-7_11"},{"key":"5_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2382577.2382580","volume":"6","author":"M. Mampaey","year":"2012","unstructured":"M. Mampaey, J. Vreeken, and N. Tatti. Summarizing data succinctly with the most informative itemsets. TKDD, 6:1\u201344, 2012.","journal-title":"TKDD"},{"key":"5_CR43","unstructured":"H. Mannila and H. Toivonen. Multiple uses of frequent sets and condensed representations. In KDD, pages\u00a0189\u2013194, 1996."},{"key":"5_CR44","unstructured":"H. Mannila, H. Toivonen, and A. I. Verkamo. Efficient algorithms for discovering association rules. In KDD, pages\u00a0181\u2013192, 1994."},{"issue":"3","key":"5_CR45","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H. Mannila","year":"1997","unstructured":"H. Mannila, H. Toivonen, and A. I. Verkamo. Levelwise search and borders of theories in knowledge discovery. Data Min. Knowl. Disc., 1(3):241\u2013258, 1997.","journal-title":"Data Min. Knowl. Disc"},{"issue":"3","key":"5_CR46","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1145\/363951.363956","volume":"25","author":"R. Meo","year":"2000","unstructured":"R. Meo. Theory of dependence values. ACM Trans. Database Syst., 25(3):380\u2013406, 2000.","journal-title":"ACM Trans. Database Syst"},{"key":"5_CR47","first-page":"51","volume-title":"Model order selection for Boolean matrix factorization. In KDD","author":"P. Miettinen","year":"2011","unstructured":"P. Miettinen and J. Vreeken. Model order selection for Boolean matrix factorization. In KDD, pages\u00a051\u201359. ACM, 2011."},{"key":"5_CR48","unstructured":"P. Miettinen and J. Vreeken. mdl4bmf: Minimum description length for Boolean matrix factorization. Technical Report MPI-I-2012-5-001, Max Planck Institute for Informatics, 2012."},{"issue":"10","key":"5_CR49","first-page":"1348","volume":"20","author":"P. Miettinen","year":"2008","unstructured":"P. Miettinen, T. Mielik\u00e4inen, A. Gionis, G. Das, and H. Mannila. The discrete basis problem. IEEE TKDE, 20(10):1348\u20131362, 2008.","journal-title":"IEEE TKDE"},{"issue":"1","key":"5_CR50","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10115-010-0329-5","volume":"29","author":"F. Moerchen","year":"2011","unstructured":"F. Moerchen, M. Thies, and A. Ultsch. Efficient mining of all margin-closed itemsets with applications in temporal knowledge discovery and classification by compression. Knowl. Inf. Sys., 29(1):55\u201380, 2011.","journal-title":"Knowl. Inf. Sys"},{"key":"5_CR51","doi-asserted-by":"crossref","unstructured":"M. Ojala. Assessing data mining results on matrices with randomization. In ICDM, pages\u00a0959\u2013964, 2010.","DOI":"10.1109\/ICDM.2010.20"},{"key":"5_CR52","first-page":"398","volume-title":"Discovering frequent closed itemsets for association rules. In ICDT","author":"N. Pasquier","year":"1999","unstructured":"N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In ICDT, pages\u00a0398\u2013416. ACM, 1999."},{"issue":"6","key":"5_CR53","first-page":"1409","volume":"15","author":"D. Pavlov","year":"2003","unstructured":"D. Pavlov, H. Mannila, and P. Smyth. Beyond independence: Probabilistic models for query approximation on binary transaction data. IEEE TKDE, 15(6):1409\u20131421, 2003.","journal-title":"IEEE TKDE"},{"key":"5_CR54","first-page":"4","volume":"1","author":"J. Pei","year":"2001","unstructured":"J. Pei, A. K. Tung, and J. Han. Fault-tolerant frequent pattern mining: Problems and challenges. Data Min. Knowl. Disc., 1:4\u20132, 2001.","journal-title":"Data Min. Knowl. Disc"},{"key":"5_CR55","first-page":"643","volume-title":"A bi-clustering framework for categorical data. In PKDD","author":"R. G. Pensa","year":"2005","unstructured":"R. G. Pensa, C. Robardet, and J.-F. Boulicaut. A bi-clustering framework for categorical data. In PKDD, pages\u00a0643\u2013650. Springer, 2005."},{"key":"5_CR56","doi-asserted-by":"crossref","unstructured":"A. K. Poernomo and V. Gopalkrishnan. Towards efficient mining of proportional fault-tolerant frequent itemsets. In KDD, pages\u00a0697\u2013706, New York, NY, USA, 2009. ACM.","DOI":"10.1145\/1557019.1557097"},{"key":"5_CR57","unstructured":"G. Rasch. Probabilistic Models for Some Intelligence and Attainnment Tests. Danmarks paedagogiske Institut, 1960."},{"issue":"1","key":"5_CR58","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J. Rissanen","year":"1978","unstructured":"J. Rissanen. Modeling by shortest data description. Automatica, 14(1):465\u2013471, 1978.","journal-title":"Automatica"},{"issue":"2","key":"5_CR59","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1214\/aos\/1176344136","volume":"6","author":"G. Schwarz","year":"1978","unstructured":"G. Schwarz. Estimating the dimension of a model. Annals Stat., 6(2):461\u2013464, 1978.","journal-title":"Annals Stat"},{"key":"5_CR60","doi-asserted-by":"crossref","unstructured":"J. K. Seppanen and H. Mannila. Dense itemsets. In KDD, pages\u00a0683\u2013688, 2004.","DOI":"10.1145\/1014052.1014140"},{"key":"5_CR61","doi-asserted-by":"crossref","unstructured":"A. Siebes and R. Kersten. A structure function for transaction data. In SDM, pages\u00a0558\u2013569. SIAM, 2011.","DOI":"10.1137\/1.9781611972818.48"},{"key":"5_CR62","doi-asserted-by":"crossref","unstructured":"A. Siebes, J. Vreeken, and M. van Leeuwen. Item sets that compress. In SDM, pages\u00a0393\u2013404. SIAM, 2006.","DOI":"10.1137\/1.9781611972764.35"},{"issue":"5","key":"5_CR63","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.ipl.2006.02.003","volume":"98","author":"N. Tatti","year":"2006","unstructured":"N. Tatti. Computational complexity of queries based on itemsets. Inf. Process. Lett., 98(5):183\u2013187, 2006.","journal-title":"Inf. Process. Lett"},{"issue":"1","key":"5_CR64","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10115-008-0128-4","volume":"17","author":"N. Tatti","year":"2008","unstructured":"N. Tatti. Maximum entropy based significance of itemsets. Knowl. Inf. Sys., 17(1):57\u201377, 2008.","journal-title":"Knowl. Inf. Sys"},{"issue":"2","key":"5_CR65","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10618-010-0188-4","volume":"21","author":"N. Tatti","year":"2010","unstructured":"N. Tatti and M. Mampaey. Using background knowledge to rank itemsets. Data Min. Knowl. Disc., 21(2):293\u2013309, 2010.","journal-title":"Data Min. Knowl. Disc"},{"key":"5_CR66","first-page":"705","volume-title":"Finding robust itemsets under subsampling. In ICDM","author":"N. Tatti","year":"2011","unstructured":"N. Tatti and F. Moerchen. Finding robust itemsets under subsampling. In ICDM, pages\u00a0705\u2013714. IEEE, 2011."},{"issue":"2","key":"5_CR67","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10618-012-0275-9","volume":"25","author":"N. Tatti","year":"2012","unstructured":"N. Tatti and J. Vreeken. Comparing apples and oranges - measuring differences between exploratory data mining results. Data Min. Knowl. Disc., 25(2):173\u2013207, 2012.","journal-title":"Data Min. Knowl. Disc"},{"key":"5_CR68","doi-asserted-by":"crossref","unstructured":"N. Tatti and J. Vreeken. Discovering descriptive tile trees by fast mining of optimal geometric subtiles. In ECML PKDD. Springer, 2012.","DOI":"10.1007\/978-3-642-33460-3_6"},{"key":"5_CR69","doi-asserted-by":"crossref","unstructured":"C. Tew, C. Giraud-Carrier, K. Tanner, and S. Burton. Behavior-based clustering and analysis of interestingness measures for association rule mining. Data Min. Knowl. Disc., pages\u00a01\u201342, 2013.","DOI":"10.1007\/s10618-013-0326-x"},{"issue":"1","key":"5_CR70","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10618-010-0202-x","volume":"23","author":"J. Vreeken","year":"2011","unstructured":"J. Vreeken, M. van Leeuwen, and A. Siebes. Krimp: Mining itemsets that compress. Data Min. Knowl. Disc., 23(1):169\u2013214, 2011.","journal-title":"Data Min. Knowl. Disc"},{"key":"5_CR71","doi-asserted-by":"crossref","unstructured":"C. Wang and S. Parthasarathy. Summarizing itemset patterns using probabilistic models. In KDD, pages\u00a0730\u2013735, 2006.","DOI":"10.1145\/1150402.1150495"},{"key":"5_CR72","doi-asserted-by":"crossref","unstructured":"G. I. Webb. Self-sufficient itemsets: An approach to screening potentially interesting associations between items. TKDD, 4(1):1\u201320, 2010.","DOI":"10.1145\/1644873.1644876"},{"issue":"3","key":"5_CR73","first-page":"183","volume":"1","author":"G. I. Webb","year":"2011","unstructured":"G. I. Webb. Filtered-top-k association discovery. WIREs DMKD, 1(3):183\u2013192, 2011.","journal-title":"WIREs DMKD"},{"key":"5_CR74","doi-asserted-by":"crossref","unstructured":"Y. Xiang, R. Jin, D. Fuhry, and F. F. Dragan. Succinct summarization of transactional databases: an overlapped hyperrectangle scheme. In KDD, pages\u00a0758\u2013766, 2008.","DOI":"10.1145\/1401890.1401981"},{"key":"5_CR75","doi-asserted-by":"crossref","unstructured":"Y. Xiang, R. Jin, D. Fuhry, and F. Dragan. Summarizing transactional databases with overlapped hyperrectangles. Data Min. Knowl. Disc., 2010.","DOI":"10.1007\/s10618-010-0203-9"},{"issue":"3","key":"5_CR76","first-page":"372","volume":"12","author":"M. J. Zaki","year":"2000","unstructured":"M. J. Zaki. Scalable algorithms for association mining. IEEE TKDE, 12(3):372\u2013390, 2000.","journal-title":"IEEE TKDE"},{"key":"5_CR77","doi-asserted-by":"crossref","unstructured":"M. J. Zaki and C.-J. Hsiao. Charm: An efficient algorithm for closed itemset mining. In SDM, pages\u00a0457\u2013473. SIAM, 2002.","DOI":"10.1137\/1.9781611972726.27"},{"key":"5_CR78","doi-asserted-by":"crossref","unstructured":"M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In KDD, Aug 1997.","DOI":"10.1007\/978-1-4615-5669-5_1"}],"container-title":["Frequent Pattern Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07821-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T08:41:01Z","timestamp":1675240861000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-07821-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319078205","9783319078212"],"references-count":78,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07821-2_5","relation":{},"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"30 August 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}