{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T10:13:07Z","timestamp":1778407987994,"version":"3.51.4"},"publisher-location":"Cham","reference-count":28,"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_1","type":"book-chapter","created":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T01:02:40Z","timestamp":1588294960000},"page":"3-20","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["DEvIANT: Discovering Significant Exceptional (Dis-)Agreement Within Groups"],"prefix":"10.1007","author":[{"given":"Adnene","family":"Belfodil","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wouter","family":"Duivesteijn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Plantevit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvie","family":"Cazalens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Lamarre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,30]]},"reference":[{"key":"1_CR1","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: WWW (2017)","DOI":"10.1145\/3038912.3052623"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-319-71246-8_27","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"A Belfodil","year":"2017","unstructured":"Belfodil, A., Cazalens, S., Lamarre, P., Plantevit, M.: Flash points: discovering exceptional pairwise behaviors in vote or rating data. In: Ceci, M., Hollm\u00e9n, J., Todorovski, L., Vens, C., D\u017eeroski, S. (eds.) ECML PKDD 2017. LNCS (LNAI), vol. 10535, pp. 442\u2013458. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71246-8_27"},{"key":"1_CR3","volume-title":"Elements of Information Theory","author":"T Cover","year":"2012","unstructured":"Cover, T., Thomas, J.: Elements of Information Theory. Wiley, Hoboken (2012)"},{"issue":"11","key":"1_CR4","first-page":"1063","volume":"4","author":"M Das","year":"2011","unstructured":"Das, M., Amer-Yahia, S., Das, G., Mri, C.Y.: Meaningful interpretations of collaborative ratings. PVLDB 4(11), 1063\u20131074 (2011)","journal-title":"PVLDB"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"de Bie, T.: An information theoretic framework for data mining. In: KDD (2011)","DOI":"10.1145\/2020408.2020497"},{"issue":"1","key":"1_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10618-015-0403-4","volume":"30","author":"W Duivesteijn","year":"2016","unstructured":"Duivesteijn, W., Feelders, A.J., Knobbe, A.: Exceptional model mining. Data Min. Knowl. Disc. 30(1), 47\u201398 (2016)","journal-title":"Data Min. Knowl. Disc."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Duivesteijn, W., Knobbe, A.: Exploiting false discoveries-statistical validation of patterns and quality measures in subgroup discovery. In: ICDM (2011)","DOI":"10.1109\/ICDM.2011.65"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Duivesteijn, W., Knobbe, A.J., Feelders, A., van Leeuwen, M.: Subgroup discovery meets Bayesian networks - an exceptional model mining approach. In: ICDM (2010)","DOI":"10.1109\/ICDM.2010.53"},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40488-018-0083-x","volume":"5","author":"F Duris","year":"2018","unstructured":"Duris, F., et al.: Mean and variance of ratios of proportions from categories of a multinomial distribution. J. Stat. Distrib. Appl. 5(1), 1\u201320 (2018). https:\/\/doi.org\/10.1186\/s40488-018-0083-x","journal-title":"J. Stat. Distrib. Appl."},{"key":"1_CR10","doi-asserted-by":"publisher","DOI":"10.1201\/9780429246593","volume-title":"An Introduction to the Bootstrap","author":"B Efron","year":"1994","unstructured":"Efron, B., Tibshirani, R.J.: An Introduction to the Bootstrap. CRC Press, Boca Raton (1994)"},{"issue":"1","key":"1_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1006\/jagm.1996.0849","volume":"24","author":"D Eppstein","year":"1997","unstructured":"Eppstein, D., Hirschberg, D.S.: Choosing subsets with maximum weighted average. J. Algorithms 24(1), 177\u2013193 (1997)","journal-title":"J. Algorithms"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-44583-8_10","volume-title":"Conceptual Structures: Broadening the Base","author":"B Ganter","year":"2001","unstructured":"Ganter, B., Kuznetsov, S.O.: Pattern structures and their projections. In: Delugach, H.S., Stumme, G. (eds.) ICCS-ConceptStruct 2001. LNCS (LNAI), vol. 2120, pp. 129\u2013142. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44583-8_10"},{"key":"1_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis - Mathematical Foundations","author":"B Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis - Mathematical Foundations. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-59830-2"},{"key":"1_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-4467-2","volume-title":"Predictive Inference","author":"S Geisser","year":"1993","unstructured":"Geisser, S.: Predictive Inference, vol. 55. CRC Press, Boca Raton (1993)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-540-87479-9_47","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"H Grosskreutz","year":"2008","unstructured":"Grosskreutz, H., R\u00fcping, S., Wrobel, S.: Tight optimistic estimates for fast subgroup discovery. In: Daelemans, W., Goethals, B., Morik, K. (eds.) ECML PKDD 2008. LNCS (LNAI), vol. 5211, pp. 440\u2013456. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87479-9_47"},{"issue":"3","key":"1_CR16","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s10115-009-0229-8","volume":"23","author":"W H\u00e4m\u00e4l\u00e4inen","year":"2010","unstructured":"H\u00e4m\u00e4l\u00e4inen, W.: StatApriori: an efficient algorithm for searching statistically significant association rules. Knowl. Inf. Syst. 23(3), 373\u2013399 (2010)","journal-title":"Knowl. Inf. Syst."},{"issue":"2","key":"1_CR17","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":"1","key":"1_CR18","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1080\/19312450709336664","volume":"1","author":"AF Hayes","year":"2007","unstructured":"Hayes, A.F., Krippendorff, K.: Answering the call for a standard reliability measure for coding data. Commun. Methods Meas. 1(1), 77\u201389 (2007)","journal-title":"Commun. Methods Meas."},{"key":"1_CR19","unstructured":"Holm, S.: A simple sequentially rejective multiple test procedure. Scand. J. Stat. 65\u201370 (1979)"},{"key":"1_CR20","unstructured":"Kendall, M., Stuart, A., Ord, J.: Kendall\u2019s advanced theory of statistics. v. 1: distribution theory (1994)"},{"key":"1_CR21","unstructured":"Krippendorff, K.: Content Analysis, An Introduction to Its Methodology (2004)"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-540-48247-5_47","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"SO Kuznetsov","year":"1999","unstructured":"Kuznetsov, S.O.: Learning of simple conceptual graphs from positive and negative examples. In: \u017bytkow, J.M., Rauch, J. (eds.) PKDD 1999. LNCS (LNAI), vol. 1704, pp. 384\u2013391. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-540-48247-5_47"},{"issue":"2","key":"1_CR23","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/s10618-012-0273-y","volume":"25","author":"M van Leeuwen","year":"2012","unstructured":"van Leeuwen, M., Knobbe, A.J.: Diverse subgroup set discovery. Data Min. Knowl. Discov. 25(2), 208\u2013242 (2012)","journal-title":"Data Min. Knowl. Discov."},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-33486-3_18","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"F Lemmerich","year":"2012","unstructured":"Lemmerich, F., Becker, M., Atzmueller, M.: Generic pattern trees for exhaustive exceptional model mining. In: Flach, P.A., De Bie, T., Cristianini, N. (eds.) ECML PKDD 2012. LNCS (LNAI), vol. 7524, pp. 277\u2013292. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33486-3_18"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Lemmerich, F., Becker, M., Singer, P., Helic, D., Hotho, A., Strohmaier, M.: Mining subgroups with exceptional transition behavior. In: KDD (2016)","DOI":"10.1145\/2939672.2939752"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-662-44851-9_27","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"S Minato","year":"2014","unstructured":"Minato, S., Uno, T., Tsuda, K., Terada, A., Sese, J.: A fast method of statistical assessment for combinatorial hypotheses based on frequent itemset enumeration. In: Calders, T., Esposito, F., H\u00fcllermeier, E., Meo, R. (eds.) ECML PKDD 2014. LNCS (LNAI), vol. 8725, pp. 422\u2013436. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44851-9_27"},{"issue":"1","key":"1_CR27","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.: Discov significant patterns. Mach. Learn. 68(1), 1\u201333 (2007)","journal-title":"Mach. Learn."},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Wrobel, S.: An algorithm for multi-relational discovery of subgroups. In: PKDD (1997)","DOI":"10.1007\/3-540-63223-9_108"}],"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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T09:33:37Z","timestamp":1746524017000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-46150-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030461492","9783030461508"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-46150-8_1","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)"}}]}}