{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:00:27Z","timestamp":1786978827921,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030461492","type":"print"},{"value":"9783030461508","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-46150-8_3","type":"book-chapter","created":{"date-parts":[[2020,4,30]],"date-time":"2020-04-30T21:02:40Z","timestamp":1588280560000},"page":"38-54","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Sets of Robust Rules, and How to Find Them"],"prefix":"10.1007","author":[{"given":"Jonas","family":"Fischer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jilles","family":"Vreeken","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,4,30]]},"reference":[{"key":"3_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB, pp. 487\u2013499 (1994)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Bayardo, R.: Efficiently mining long patterns from databases. In: SIGMOD, pp. 85\u201393 (1998)","DOI":"10.1145\/276304.276313"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10618-006-0054-6","volume":"14","author":"T Calders","year":"2007","unstructured":"Calders, T., Goethals, B.: Non-derivable itemset mining. Data Min. Knowl. Disc. 14(1), 171\u2013206 (2007). https:\/\/doi.org\/10.1007\/s10618-006-0054-6","journal-title":"Data Min. Knowl. Disc."},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10618-010-0209-3","volume":"23","author":"T De Bie","year":"2011","unstructured":"De Bie, T.: Maximum entropy models and subjective interestingness: an application to tiles in binary databases. Data Min. Knowl. Disc. 23(3), 407\u2013446 (2011). https:\/\/doi.org\/10.1007\/s10618-010-0209-3","journal-title":"Data Min. Knowl. Disc."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Fowkes, J., Sutton, C.: A subsequence interleaving model for sequential pattern mining. In: KDD (2016)","DOI":"10.1145\/2939672.2939787"},{"key":"3_CR6","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4643.001.0001","volume-title":"The Minimum Description Length Principle","author":"P Gr\u00fcnwald","year":"2007","unstructured":"Gr\u00fcnwald, P.: The Minimum Description Length Principle. MIT Press, Cambridge (2007)"},{"issue":"2","key":"3_CR7","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10115-011-0432-2","volume":"32","author":"W H\u00e4m\u00e4l\u00e4inen","year":"2012","unstructured":"H\u00e4m\u00e4l\u00e4inen, W.: Kingfisher: an efficient algorithm for searching for both positive and negative dependency rules with statistical significance measures. Knowl. Inf. Syst. 32(2), 383\u2013414 (2012). https:\/\/doi.org\/10.1007\/s10115-011-0432-2","journal-title":"Knowl. Inf. Syst."},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMOD, pp. 1\u201312. ACM (2000)","DOI":"10.1145\/342009.335372"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Jaroszewicz, S., Simovici, D.A.: Interestingness of frequent itemsets using Bayesian networks as background knowledge. In: KDD, pp. 178\u2013186. ACM (2004)","DOI":"10.1145\/1014052.1014074"},{"key":"3_CR10","unstructured":"Kontkanen, P., Myllym\u00e4ki, P.: MDL histogram density estimation. In: AISTATS (2007)"},{"key":"3_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3860-5","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M Li","year":"1993","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and Its Applications. Springer, New York (1993). https:\/\/doi.org\/10.1007\/978-1-4757-3860-5"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Lucchese, C., Orlando, S., Perego, R.: Mining top-k patterns from binary datasets in presence of noise. In: SDM, pp. 165\u2013176 (2010)","DOI":"10.1137\/1.9781611972801.15"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2382577.2382580","volume":"6","author":"M Mampaey","year":"2012","unstructured":"Mampaey, M., Vreeken, J., Tatti, N.: Summarizing data succinctly with the most informative itemsets. ACM TKDD 6, 1\u201344 (2012)","journal-title":"ACM TKDD"},{"key":"3_CR14","unstructured":"Mannila, H., Toivonen, H., Verkamo, A.I.: Efficient algorithms for discovering association rules. In: KDD, pp. 181\u2013192 (1994)"},{"issue":"4","key":"3_CR15","first-page":"A18:1","volume":"8","author":"P Miettinen","year":"2014","unstructured":"Miettinen, P., Vreeken, J.: MDL4BMF: minimum description length for Boolean matrix factorization. ACM TKDD 8(4), A18:1\u201331 (2014)","journal-title":"ACM TKDD"},{"key":"3_CR16","unstructured":"Mitchell-Jones, T.: Societas Europaea Mammalogica (1999). http:\/\/www.european-mammals.org"},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10115-010-0329-5","volume":"29","author":"F Moerchen","year":"2011","unstructured":"Moerchen, F., Thies, M., Ultsch, A.: Efficient mining of all margin-closed itemsets with applications in temporal knowledge discovery and classification by compression. Knowl. Inf. Syst. 29(1), 55\u201380 (2011). https:\/\/doi.org\/10.1007\/s10115-010-0329-5","journal-title":"Knowl. Inf. Syst."},{"issue":"55","key":"3_CR18","doi-asserted-by":"publisher","first-page":"7324","DOI":"10.1038\/sj.onc.1209717","volume":"25","author":"S Myllykangas","year":"2006","unstructured":"Myllykangas, S., Himberg, J., B\u00f6hling, T., Nagy, B., Hollm\u00e9n, J., Knuutila, S.: DNA copy number amplification profiling of human neoplasms. Oncogene 25(55), 7324\u20137332 (2006)","journal-title":"Oncogene"},{"key":"3_CR19","unstructured":"Papaxanthos, L., Llinares-L\u00f3pez, F., Bodenham, D.A., Borgwardt, K.M.: Finding significant combinations of features in the presence of categorical covariates. In: NIPS, pp. 2271\u20132279 (2016)"},{"key":"3_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803161","volume-title":"Causality: Models, Reasoning and Inference","author":"J Pearl","year":"2009","unstructured":"Pearl, J.: Causality: Models, Reasoning and Inference, 2nd edn. Cambridge University Press, Cambridge (2009)","edition":"2"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Pellegrina, L., Vandin, F.: Efficient mining of the most significant patterns with permutation testing. In: KDD, pp. 2070\u20132079 (2018)","DOI":"10.1145\/3219819.3219997"},{"issue":"1","key":"3_CR22","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J Rissanen","year":"1978","unstructured":"Rissanen, J.: Modeling by shortest data description. Automatica 14(1), 465\u2013471 (1978)","journal-title":"Automatica"},{"issue":"2","key":"3_CR23","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1214\/aos\/1176346150","volume":"11","author":"J Rissanen","year":"1983","unstructured":"Rissanen, J.: A universal prior for integers and estimation by minimum description length. Ann. Stat. 11(2), 416\u2013431 (1983)","journal-title":"Ann. Stat."},{"issue":"1","key":"3_CR24","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10115-008-0128-4","volume":"17","author":"N Tatti","year":"2008","unstructured":"Tatti, N.: Maximum entropy based significance of itemsets. Knowl. Inf. Syst. 17(1), 57\u201377 (2008)","journal-title":"Knowl. Inf. Syst."},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Tatti, N., Vreeken, J.: Finding good itemsets by packing data. In: ICDM, pp. 588\u2013597 (2008)","DOI":"10.1109\/ICDM.2008.39"},{"key":"3_CR26","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-319-07821-2_5","volume-title":"Frequent Pattern Mining","author":"J Vreeken","year":"2014","unstructured":"Vreeken, J., Tatti, N.: Interesting patterns. In: Aggarwal, C.C., Han, J. (eds.) Frequent Pattern Mining, pp. 105\u2013134. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07821-2_5"},{"issue":"1","key":"3_CR27","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10618-010-0202-x","volume":"23","author":"J Vreeken","year":"2011","unstructured":"Vreeken, J., van Leeuwen, M., Siebes, A.: KRIMP: mining itemsets that compress. Data Min. Knowl. Disc. 23(1), 169\u2013214 (2011). https:\/\/doi.org\/10.1007\/s10618-010-0202-x","journal-title":"Data Min. Knowl. Disc."},{"key":"3_CR28","unstructured":"Wang, F., Rudin, C.: Falling rule lists. In: AISTATS (2015)"},{"issue":"1","key":"3_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10994-007-5006-x","volume":"68","author":"GI Webb","year":"2007","unstructured":"Webb, G.I.: Discovering significant patterns. Mach. Learn. 68(1), 1\u201333 (2007). https:\/\/doi.org\/10.1007\/s10994-007-5006-x","journal-title":"Mach. Learn."},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Xiang, Y., Jin, R., Fuhry, D., Dragan, F.F.: Succinct summarization of transactional databases: an overlapped hyperrectangle scheme. In: KDD, pp. 758\u2013766 (2008)","DOI":"10.1145\/1401890.1401981"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In: KDD, August 1997","DOI":"10.1007\/978-1-4615-5669-5_1"},{"key":"3_CR32","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-319-07821-2_17","volume-title":"Frequent Pattern Mining","author":"A Zimmermann","year":"2014","unstructured":"Zimmermann, A., Nijssen, S.: Supervised pattern mining and applications to classification. In: Aggarwal, C.C., Han, J. (eds.) Frequent Pattern Mining, pp. 425\u2013442. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07821-2_17"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-46150-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T05:29:57Z","timestamp":1746509397000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-46150-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030461492","9783030461508"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-46150-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"30 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"W\u00fcrzburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ecmlpkdd2019.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"733","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"130","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.04","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"ECML PKDD Workshops Information: single-blind review, submissions: 200, full papers accepted: 70, short papers accepted: 46","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}