{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:28:56Z","timestamp":1742981336349,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662661109"},{"type":"electronic","value":"9783662661116"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-662-66111-6_3","type":"book-chapter","created":{"date-parts":[[2022,10,7]],"date-time":"2022-10-07T07:05:19Z","timestamp":1665126319000},"page":"64-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing Data Coverage and\u00a0Significance in\u00a0Multiple Hypothesis Testing on\u00a0User Groups"],"prefix":"10.1007","author":[{"given":"Nassim","family":"Bouarour","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Idir","family":"Benouaret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sihem","family":"Amer-Yahia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,8]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-48777-8_2","volume-title":"Integer Programming and Combinatorial Optimization","author":"AA Ageev","year":"1999","unstructured":"Ageev, A.A., Sviridenko, M.I.: Approximation algorithms for maximum coverage and max cut with given sizes of parts. In: Cornu\u00e9jols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol. 1610, pp. 17\u201330. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48777-8_2"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data for data mining applications, vol. 27. ACM (1998)","DOI":"10.1145\/276305.276314"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Amer-Yahia, S., Kleisarchaki, S., Kolloju, N.K., Lakshmanan, L.V., Zamar, R.H.: Exploring rated datasets with rating maps. In: Proceedings of the 26th International Conference on World Wide Web, pp. 1411\u20131419. International World Wide Web Conferences Steering Committee (2017)","DOI":"10.1145\/3038912.3052623"},{"issue":"17","key":"3_CR4","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1016\/j.fss.2010.04.004","volume":"161","author":"G Beliakov","year":"2010","unstructured":"Beliakov, G., James, S., Mordelov\u00e1, J., R\u00fcckschlossov\u00e1, T., Yager, R.R.: Generalized bonferroni mean operators in multi-criteria aggregation. Fuzzy Sets Syst. 161(17), 2227\u20132242 (2010)","journal-title":"Fuzzy Sets Syst."},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1214\/aos\/1013699998","volume":"29","author":"Y Benjamini","year":"2001","unstructured":"Benjamini, Y., Yekutieli, D.: The control of the false discovery rate in multiple testing under dependency. Ann. Stat. 29, 1165\u20131188 (2001)","journal-title":"Ann. Stat."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Boley, M., Mampaey, M., Kang, B., Tokmakov, P., Wrobel, S.: One click mining: interactive local pattern discovery through implicit preference and performance learning. In: Proceedings of the ACM SIGKDD Workshop on Interactive Data Exploration and Analytics, pp. 27\u201335. ACM (2013)","DOI":"10.1145\/2501511.2501517"},{"issue":"9","key":"3_CR7","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"key":"3_CR8","unstructured":"Chekuri, C., Quanrud, K., Zhang, Z.: On approximating partial set cover and generalizations. arXiv preprint arXiv:1907.04413 (2019)"},{"issue":"3","key":"3_CR9","doi-asserted-by":"publisher","first-page":"140216","DOI":"10.1098\/rsos.140216","volume":"1","author":"D Colquhoun","year":"2014","unstructured":"Colquhoun, D.: An investigation of the false discovery rate and the misinterpretation of p-values. R. Soc. Open Sci. 1(3), 140216 (2014)","journal-title":"R. Soc. Open Sci."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Di Leo, G., Sardanelli, F.: Statistical significance: p value, 0.05 threshold, and applications to radiomics-reasons for a conservative approach. Eur. Radiol. Exp. 4(1), 1\u20138 (2020)","DOI":"10.1186\/s41747-020-0145-y"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Foster, D., Stine, R.A.: Alpha-investing: a procedure for sequential control of expected false discoveries. J. Roy. Stat. Soc. Ser. B Stat. Methodol. 70(2), 429\u2013444 (2008)","DOI":"10.1111\/j.1467-9868.2007.00643.x"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Goyal, A., Bonchi, F., Lakshmanan, L.V.: Discovering leaders from community actions. In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, pp. 499\u2013508. ACM (2008)","DOI":"10.1145\/1458082.1458149"},{"issue":"4","key":"3_CR13","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10654-016-0149-3","volume":"31","author":"S Greenland","year":"2016","unstructured":"Greenland, S., et al.: Statistical tests, P values, confidence intervals, and power: a guide to misinterpretations. Eur. J. Epidemiol. 31(4), 337\u2013350 (2016). https:\/\/doi.org\/10.1007\/s10654-016-0149-3","journal-title":"Eur. J. Epidemiol."},{"issue":"2","key":"3_CR14","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10618-018-0590-x","volume":"33","author":"W H\u00e4m\u00e4l\u00e4inen","year":"2018","unstructured":"H\u00e4m\u00e4l\u00e4inen, W., Webb, G.I.: A tutorial on statistically sound pattern discovery. Data Min. Knowl. Disc. 33(2), 325\u2013377 (2018). https:\/\/doi.org\/10.1007\/s10618-018-0590-x","journal-title":"Data Min. Knowl. Disc."},{"issue":"6","key":"3_CR15","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1002\/(SICI)1520-6750(199809)45:6<615::AID-NAV5>3.0.CO;2-5","volume":"45","author":"DS Hochbaum","year":"1998","unstructured":"Hochbaum, D.S., Pathria, A.: Analysis of the greedy approach in problems of maximum k-coverage. Nav. Res. Logist. (NRL) 45(6), 615\u2013627 (1998)","journal-title":"Nav. Res. Logist. (NRL)"},{"issue":"4","key":"3_CR16","first-page":"604","volume":"20","author":"M Jafari","year":"2019","unstructured":"Jafari, M., Ansari-Pour, N.: Why, when and how to adjust your p values? Cell J. (Yakhteh) 20(4), 604 (2019)","journal-title":"Cell J. (Yakhteh)"},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.14778\/3015270.3015271","volume":"10","author":"D Jiang","year":"2016","unstructured":"Jiang, D., et al.: Cohort query processing. Proce. VLDB Endow. 10(1), 1\u201312 (2016)","journal-title":"Proce. VLDB Endow."},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Kamat, N., Jayachandran, P., Tunga, K., Nandi, A.: Distributed and interactive cube exploration. In: 2014 IEEE 30th International Conference on Data Engineering (ICDE), pp. 472\u2013483. IEEE (2014)","DOI":"10.1109\/ICDE.2014.6816674"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"issue":"5","key":"3_CR20","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1093\/bib\/bbv091","volume":"17","author":"RJ Meijer","year":"2016","unstructured":"Meijer, R.J., Goeman, J.J.: Multiple testing of gene sets from gene ontology: possibilities and pitfalls. Briefings Bioinform. 17(5), 808\u2013818 (2016)","journal-title":"Briefings Bioinform."},{"issue":"1","key":"3_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep36671","volume":"6","author":"B Mieth","year":"2016","unstructured":"Mieth, B., et al.: Combining multiple hypothesis testing with machine learning increases the statistical power of genome-wide association studies. Sci. Rep. 6(1), 1\u201314 (2016)","journal-title":"Sci. Rep."},{"issue":"2","key":"3_CR22","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1140\/epjb\/e2004-00124-y","volume":"38","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J.: Detecting community structure in networks. Eur. Phys. J. B 38(2), 321\u2013330 (2004). https:\/\/doi.org\/10.1140\/epjb\/e2004-00124-y","journal-title":"Eur. Phys. J. B"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Nikolaev, A.G., Gore, S., Govindaraju, V.: Engagement capacity and engaging team formation for reach maximization of online social media platforms. In: KDD, pp. 225\u2013234 (2016)","DOI":"10.1145\/2939672.2939681"},{"issue":"13","key":"3_CR24","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.14778\/3007263.3007269","volume":"9","author":"P Pedreira","year":"2016","unstructured":"Pedreira, P., Croswhite, C., Bona, L.: Cubrick: indexing millions of records per second for interactive analytics. Proc. VLDB Endow. 9(13), 1305\u20131316 (2016)","journal-title":"Proc. VLDB Endow."},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Pellegrina, L., Riondato, M., Vandin, F.: Hypothesis testing and statistically-sound pattern mining (tutorial). In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD 2019, Anchorage, AK, USA, 4\u20138 August 2019, pp. 3215\u20133216 (2019)","DOI":"10.1145\/3292500.3332286"},{"issue":"2","key":"3_CR26","first-page":"3","volume":"152","author":"E Roquain","year":"2011","unstructured":"Roquain, E.: Type i error rate control for testing many hypotheses: a survey with proofs. Journal de la Soci\u00e9t\u00e9 Fran\u00e7aise de Statistique 152(2), 3\u201338 (2011)","journal-title":"Journal de la Soci\u00e9t\u00e9 Fran\u00e7aise de Statistique"},{"issue":"2\u20133","key":"3_CR27","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0167-739X(97)00019-8","volume":"13","author":"R Srikant","year":"1997","unstructured":"Srikant, R., Agrawal, R.: Mining generalized association rules. Futur. Gener. Comput. Syst. 13(2\u20133), 161\u2013180 (1997)","journal-title":"Futur. Gener. Comput. Syst."},{"issue":"1","key":"3_CR28","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)","journal-title":"Mach. Learn."},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Webb, G.I., Petitjean, F.: A multiple test correction for streams and cascades of statistical hypothesis tests. In: Proceedings of the 22nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining, San Francisco, USA, August 2016, pp. 1255\u20131264 (2016)","DOI":"10.1145\/2939672.2939775"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Xin, D., Shen, X., Mei, Q., Han, J.: Discovering interesting patterns through user\u2019s interactive feedback. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 773\u2013778. ACM (2006)","DOI":"10.1145\/1150402.1150502"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Zgraggen, E., Zhao, Z., Zeleznik, R., Kraska, T.: Investigating the effect of the multiple comparisons problem in visual analysis. In: Proceedings of the 2018 CHI Conference on Human Factors in Computing Systems, pp. 1\u201312 (2018)","DOI":"10.1145\/3173574.3174053"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Zhao, Z., Stefani, L.D., Zgraggen, E., Binnig, C., Upfal, E., Kraska, T.: Controlling false discoveries during interactive data exploration. In: Proceedings of the 2017 ACM International Conference on Management of Data, SIGMOD Conference 2017, Chicago, IL, USA, 14\u201319 May 2017, pp. 527\u2013540. ACM (2017)","DOI":"10.1145\/3035918.3064019"}],"container-title":["Lecture Notes in Computer Science","Transactions on Large-Scale Data- and Knowledge-Centered Systems LI"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-66111-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,7]],"date-time":"2022-10-07T07:06:14Z","timestamp":1665126374000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-66111-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783662661109","9783662661116"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-66111-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"8 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}