{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:59:20Z","timestamp":1760597960327,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T00:00:00Z","timestamp":1591660800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T00:00:00Z","timestamp":1591660800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1247581"],"award-info":[{"award-number":["IIS-1247581"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003500","name":"University of Padova","doi-asserted-by":"crossref","award":["SID2017","STARS 2017"],"award-info":[{"award-number":["SID2017","STARS 2017"]}],"id":[{"id":"10.13039\/501100003500","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["20174LF3T8"],"award-info":[{"award-number":["20174LF3T8"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s10618-020-00687-8","type":"journal-article","created":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T06:23:03Z","timestamp":1591683783000},"page":"1201-1234","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Efficient mining of the most significant patterns with permutation testing"],"prefix":"10.1007","volume":"34","author":[{"given":"Leonardo","family":"Pellegrina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2244-2320","authenticated-orcid":false,"given":"Fabio","family":"Vandin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,9]]},"reference":[{"key":"687_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"R Agrawal","year":"1993","unstructured":"Agrawal R, Imieli\u0144ski T, Swami A (1993) Mining association rules between sets of items in large databases. SIGMOD Rec 22:207\u2013216","journal-title":"SIGMOD Rec"},{"key":"687_CR2","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th international\u00a0confereence on very large data bases (VLDB \u201994), San Francisco, CA, USA. Morgan Kaufmann Publishers Inc, pp 487\u2013499"},{"issue":"1","key":"687_CR3","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/widm.1144","volume":"5","author":"M Atzmueller","year":"2015","unstructured":"Atzmueller M (2015) Subgroup discovery. Wiley Interdiscip Rev Data Min Knowl Discov 5(1):35\u201349","journal-title":"Wiley Interdiscip Rev Data Min Knowl Discov"},{"issue":"2","key":"687_CR4","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/276305.276313","volume":"27","author":"RJ Bayardo Jr","year":"1998","unstructured":"Bayardo RJ Jr (1998) Efficiently mining long patterns from databases. ACM Sigmod Rec 27(2):85\u201393","journal-title":"ACM Sigmod Rec"},{"key":"687_CR5","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1111\/j.2517-6161.1995.tb02031.x","volume":"57","author":"Y Benjamini","year":"1995","unstructured":"Benjamini Y, Hochberg Y (1995) Controlling the false discovery rate: a practical and powerful approach to multiple testing. J Ro Stat Soc Ser B (Methodol) 57:289\u2013300","journal-title":"J Ro Stat Soc Ser B (Methodol)"},{"key":"687_CR6","first-page":"3","volume":"8","author":"C Bonferroni","year":"1936","unstructured":"Bonferroni C (1936) Teoria statistica delle classi e calcolo delle probabilita. Pubblicazioni del R Istituto Superiore di Scienze Economiche e Commericiali di Firenze 8:3\u201362","journal-title":"Pubblicazioni del R Istituto Superiore di Scienze Economiche e Commericiali di Firenze"},{"key":"687_CR7","volume-title":"Contrast data mining: concepts, algorithms, and applications","author":"G Dong","year":"2012","unstructured":"Dong G, Bailey J (2012) Contrast data mining: concepts, algorithms, and applications. CRC Press, Boca Raton"},{"key":"687_CR8","doi-asserted-by":"crossref","unstructured":"Duivesteijn W, Knobbe A (2011) Exploiting false discoveries\u2013statistical validation of patterns and quality measures in subgroup discovery. In: 2011 IEEE 11th international conference on data mining. IEEE, pp 151\u2013160","DOI":"10.1109\/ICDM.2011.65"},{"issue":"1","key":"687_CR9","doi-asserted-by":"publisher","first-page":"87","DOI":"10.2307\/2340521","volume":"85","author":"RA Fisher","year":"1922","unstructured":"Fisher RA (1922) On the interpretation of $$\\chi $$ 2 from contingency tables, and the calculation of p. J R Stat Soc 85(1):87\u201394","journal-title":"J R Stat Soc"},{"issue":"3","key":"687_CR10","doi-asserted-by":"publisher","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 (TKDD) 1(3):14","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"issue":"2","key":"687_CR11","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 (2012) Kingfisher: an efficient algorithm for searching for both positive and negative dependency rules with statistical significance measures. Knowl Inf Syst 32(2):383\u2013414","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"687_CR12","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10618-018-0590-x","volume":"33","author":"W H\u00e4m\u00e4l\u00e4inen","year":"2019","unstructured":"H\u00e4m\u00e4l\u00e4inen W, Webb GI (2019) A tutorial on statistically sound pattern discovery. Data Min Knowl Disc 33(2):325\u2013377","journal-title":"Data Min Knowl Disc"},{"key":"687_CR13","first-page":"1","volume-title":"SIGMOD conference","author":"J Han","year":"2000","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Chen W, Naughton JF, Bernstein PA (eds) SIGMOD conference. ACM, New YorkD, pp 1\u201312"},{"key":"687_CR14","unstructured":"Han J, Wang J, Lu Y, Tzvetkov P (2002) Mining top-k frequent closed patterns without minimum support. In: Proceedings 2002 IEEE international conference on data mining, 2002. ICDM 2003. IEEE, pp 211\u2013218"},{"key":"687_CR15","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J Han","year":"2007","unstructured":"Han J, Cheng H, Xin D, Yan X (2007) Frequent pattern mining: current status and future directions. Data Mining Knowl Discov 15:55\u201386","journal-title":"Data Mining Knowl Discov"},{"issue":"3","key":"687_CR16","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10115-010-0356-2","volume":"29","author":"F Herrera","year":"2011","unstructured":"Herrera F, Carmona CJ, Gonz\u00e1lez P, Del Jesus MJ (2011) An overview on subgroup discovery: foundations and applications. Knowl Inf Syst 29(3):495\u2013525","journal-title":"Knowl Inf Syst"},{"key":"687_CR17","doi-asserted-by":"crossref","unstructured":"Komiyama J, Ishihata M, Arimura H, Nishibayashi T, Minato S-I (2017) Statistical emerging pattern mining with multiple testing correction. In: Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 897\u2013906","DOI":"10.1145\/3097983.3098137"},{"key":"687_CR18","doi-asserted-by":"crossref","unstructured":"Lehmann EL, Romano JP (2012) Generalizations of the familywise error rate. In: Selected works of EL Lehmann. Springer, pp 719\u2013735","DOI":"10.1007\/978-1-4614-1412-4_57"},{"key":"687_CR19","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.knosys.2014.04.030","volume":"67","author":"J Li","year":"2014","unstructured":"Li J, Liu J, Toivonen H, Satou K, Sun Y, Sun B (2014) Discovering statistically non-redundant subgroups. Knowl-Based Syst 67:315\u2013327","journal-title":"Knowl-Based Syst"},{"key":"687_CR20","doi-asserted-by":"crossref","unstructured":"Llinares-L\u00f3pez F, Sugiyama M, Papaxanthos L, Borgwardt K (2015) Fast and memory-efficient significant pattern mining via permutation testing. In: Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 725\u2013734","DOI":"10.1145\/2783258.2783363"},{"key":"687_CR21","doi-asserted-by":"crossref","unstructured":"Minato S-i, Uno T, Tsuda K, Terada A, Sese J (2014) A fast method of statistical assessment for combinatorial hypotheses based on frequent itemset enumeration. In: Joint European conference on machine learning and knowledge discovery in databases. Springer, pp 422\u2013436","DOI":"10.1007\/978-3-662-44851-9_27"},{"key":"687_CR22","doi-asserted-by":"crossref","unstructured":"Nijssen S, Kok JN (2004) A quickstart in frequent structure mining can make a difference. In: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 647\u2013652","DOI":"10.1145\/1014052.1014134"},{"key":"687_CR23","unstructured":"Nijssen S, Kok JN (2006) Frequent subgraph miners: runtimes don\u2019t say everything. In: MLG 2006, p 173"},{"key":"687_CR24","unstructured":"Papaxanthos L, Llinares-L\u00f3pez F, Bodenham D, Borgwardt K (2016) Finding significant combinations of features in the presence of categorical covariates. In: Advances in neural information processing systems, pp 2279\u20132287"},{"key":"687_CR25","doi-asserted-by":"crossref","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: International conference on database theory. Springer, pp 398\u2013416","DOI":"10.1007\/3-540-49257-7_25"},{"key":"687_CR26","doi-asserted-by":"crossref","unstructured":"Pietracaprina A, Vandin F (2007) Efficient incremental mining of top-K frequent closed itemsets. In: Discovery science, volume 4755 of lecture notes in computer science. Springer, Berlin Heidelberg, pp 275\u2013280","DOI":"10.1007\/978-3-540-75488-6_29"},{"key":"687_CR27","doi-asserted-by":"crossref","unstructured":"Pellegrina L, Vandin F (2018) Efficient mining of the most significant patterns with permutation testing. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining. ACM, pp 2070\u20132079","DOI":"10.1145\/3219819.3219997"},{"key":"687_CR28","doi-asserted-by":"crossref","unstructured":"Pellegrina L, Riondato M, Vandin F (2019a) Hypothesis testing and statistically-sound pattern mining. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining. ACM, pp 3215\u20133216","DOI":"10.1145\/3292500.3332286"},{"key":"687_CR29","doi-asserted-by":"crossref","unstructured":"Pellegrina L, Riondato M, Vandin F (2019b) Spumante: Significant pattern mining with unconditional testing. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining-KDD, vol\u00a019","DOI":"10.1145\/3292500.3330978"},{"key":"687_CR30","doi-asserted-by":"crossref","unstructured":"Tarone R (1990) A modified bonferroni method for discrete data. Biometrics 515\u2013522","DOI":"10.2307\/2531456"},{"issue":"32","key":"687_CR31","doi-asserted-by":"publisher","first-page":"12996","DOI":"10.1073\/pnas.1302233110","volume":"110","author":"A Terada","year":"2013","unstructured":"Terada A, Okada-Hatakeyama M, Tsuda K, Sese J (2013a) Statistical significance of combinatorial regulations. Proc Nat Acad Sci 110(32):12996\u201313001","journal-title":"Proc Nat Acad Sci"},{"key":"687_CR32","doi-asserted-by":"crossref","unstructured":"Terada A, Tsuda K, Sese J (2013b) Fast westfall-young permutation procedure for combinatorial regulation discovery. In: 2013 IEEE international conference on bioinformatics and biomedicine (BIBM). IEEE, pp 153\u2013158","DOI":"10.1109\/BIBM.2013.6732479"},{"key":"687_CR33","doi-asserted-by":"crossref","unstructured":"Terada A, Kim H, Sese J (2015) High-speed westfall-young permutation procedure for genome-wide association studies. In: Proceedings of the 6th ACM conference on bioinformatics, computational biology and health informatics. ACM, pp 17\u201326","DOI":"10.1145\/2808719.2808721"},{"key":"687_CR34","doi-asserted-by":"crossref","unstructured":"Terada A, Tsuda K et al (2016) Significant pattern mining with confounding variables. In: Pacific-Asia conference on knowledge discovery and data mining. Springer, pp 277\u2013289","DOI":"10.1007\/978-3-319-31753-3_23"},{"key":"687_CR35","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, pp 77\u201386","DOI":"10.1145\/1133905.1133916"},{"issue":"1","key":"687_CR36","first-page":"1","volume":"3","author":"MJ van der Laan","year":"2004","unstructured":"van der Laan MJ, Dudoit S, Pollard KS (2004) Augmentation procedures for control of the generalized family-wise error rate and tail probabilities for the proportion of false positives. Stat Appl Genet Mol Biol 3(1):1\u201325","journal-title":"Stat Appl Genet Mol Biol"},{"key":"687_CR37","doi-asserted-by":"crossref","unstructured":"Webb GI (2006) Discovering significant rules. In: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 434\u2013443","DOI":"10.1145\/1150402.1150451"},{"issue":"1","key":"687_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10994-007-5006-x","volume":"68","author":"GI Webb","year":"2007","unstructured":"Webb GI (2007) Discovering significant patterns. Mach Learn 68(1):1\u201333","journal-title":"Mach Learn"},{"issue":"2\u20133","key":"687_CR39","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10994-008-5046-x","volume":"71","author":"GI Webb","year":"2008","unstructured":"Webb GI (2008) Layered critical values: a powerful direct-adjustment approach to discovering significant patterns. Mach Learn 71(2\u20133):307\u2013323","journal-title":"Mach Learn"},{"key":"687_CR40","volume-title":"Resampling-based multiple testing: examples and methods for p-value adjustment","author":"PH Westfall","year":"1993","unstructured":"Westfall PH, Young SS (1993) Resampling-based multiple testing: examples and methods for p-value adjustment. Wiley Series in Probability and Statistics, Hoboknen"},{"key":"687_CR41","doi-asserted-by":"crossref","unstructured":"W\u00f6rlein M, Meinl T, Fischer I, Philippsen M (2005) A quantitative comparison of the subgraph miners mofa, gspan, ffsm, and gaston. In: European conference on principles of data mining and knowledge discovery. Springer, pp 392\u2013403","DOI":"10.1007\/11564126_39"},{"key":"687_CR42","unstructured":"Zandolin D, Pietracaprina A (2003) Mining frequent itemsets using patricia tries. In: Proceedings of FIMI03, vol\u00a090"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-020-00687-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-020-00687-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-020-00687-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T06:27:26Z","timestamp":1723012046000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-020-00687-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,9]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["687"],"URL":"https:\/\/doi.org\/10.1007\/s10618-020-00687-8","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2020,6,9]]},"assertion":[{"value":"24 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}