{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T13:46:30Z","timestamp":1789998390453,"version":"4.0.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030109240","type":"print"},{"value":"9783030109257","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-10925-7_23","type":"book-chapter","created":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T15:47:28Z","timestamp":1547740048000},"page":"373-389","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["How Your Supporters and Opponents Define Your Interestingness"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Cr\u00e9milleux","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arnaud","family":"Giacometti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arnaud","family":"Soulet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,1,18]]},"reference":[{"key":"23_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB, pp. 487\u2013499. Morgan Kaufmann, Burlington (1994)"},{"issue":"1","key":"23_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1021571501451","volume":"7","author":"JF Boulicaut","year":"2003","unstructured":"Boulicaut, J.F., Bykowski, A., Rigotti, C.: Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Min. Knowl. Discov. 7(1), 5\u201322 (2003)","journal-title":"Data Min. Knowl. Discov."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Bringmann, B., Zimmermann, A.: The chosen few: on identifying valuable patterns. In: ICDM, pp. 63\u201372. Omaha, NE (2007)","DOI":"10.1109\/ICDM.2007.85"},{"issue":"1","key":"23_CR4","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. Discov. 14(1), 171\u2013206 (2007)","journal-title":"Data Min. Knowl. Discov."},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/11615576_4","volume-title":"Constraint-Based Mining and Inductive Databases","author":"T Calders","year":"2006","unstructured":"Calders, T., Rigotti, C., Boulicaut, J.-F.: A survey on condensed representations for frequent sets. In: Boulicaut, J.-F., De Raedt, L., Mannila, H. (eds.) Constraint-Based Mining and Inductive Databases. LNCS (LNAI), vol. 3848, pp. 64\u201380. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11615576_4"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1242","DOI":"10.1007\/978-3-540-69848-7_99","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2008","author":"B Cr\u00e9milleux","year":"2008","unstructured":"Cr\u00e9milleux, B., Soulet, A.: Discovering knowledge from local patterns with global constraints. In: Gervasi, O., Murgante, B., Lagan\u00e0, A., Taniar, D., Mun, Y., Gavrilova, M.L. (eds.) ICCSA 2008, Part II. LNCS, vol. 5073, pp. 1242\u20131257. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-69848-7_99"},{"key":"23_CR7","unstructured":"Dheeru, D., Taniskidou, E.K.: UCI machine learning repository (2017). http:\/\/archive.ics.uci.edu\/ml"},{"issue":"2","key":"23_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1145\/980972.981004","volume":"5","author":"UM Fayyad","year":"2003","unstructured":"Fayyad, U.M., Piatetsky-Shapiro, G., Uthurusamy, R.: Summary from the kdd-03 panel: data mining: the next 10 years. ACM SIGKDD Explor. 5(2), 191\u2013196 (2003)","journal-title":"ACM SIGKDD Explor."},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/3-540-39963-1_7","volume-title":"Foundations of Intelligent Systems","author":"A Wai-chee Fu","year":"2000","unstructured":"Wai-chee Fu, A., Wang-wai Kwong, R., Tang, J.: Mining N-most interesting itemsets. In: Ra\u015b, Z.W., Ohsuga, S. (eds.) ISMIS 2000. LNCS (LNAI), vol. 1932, pp. 59\u201367. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-39963-1_7"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-540-74976-9_44","volume-title":"Knowledge Discovery in Databases: PKDD 2007","author":"A Gallo","year":"2007","unstructured":"Gallo, A., De Bie, T., Cristianini, N.: MINI: mining informative non-redundant itemsets. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladeni\u010d, D., Skowron, A. (eds.) PKDD 2007. LNCS (LNAI), vol. 4702, pp. 438\u2013445. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74976-9_44"},{"key":"23_CR11","first-page":"559","volume":"9","author":"GC Garriga","year":"2008","unstructured":"Garriga, G.C., Kralj, P., Lavra\u010d, N.: Closed sets for labeled data. J. Mach. Learn. Res. 9, 559\u2013580 (2008)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"23_CR12","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/1132960.1132963","volume":"38","author":"L Geng","year":"2006","unstructured":"Geng, L., Hamilton, H.J.: Interestingness measures for data mining: a survey. ACM Comput. Surv. 38(3), 9 (2006). https:\/\/doi.org\/10.1145\/1132960.1132963","journal-title":"ACM Comput. Surv."},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-642-20149-3_13","volume-title":"Database Systems for Advanced Applications","author":"A Giacometti","year":"2011","unstructured":"Giacometti, A., Marcel, P., Soulet, A.: A relational view of pattern discovery. In: Yu, J.X., Kim, M.H., Unland, R. (eds.) DASFAA 2011, Part I. LNCS, vol. 6587, pp. 153\u2013167. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20149-3_13"},{"issue":"3","key":"23_CR14","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.: Assessing data mining results via swap randomization. TKDD 1(3), 14 (2007)","journal-title":"TKDD"},{"key":"23_CR15","unstructured":"H\u00e4m\u00e4l\u00e4inen, W.: Efficient search for statistically significant dependency rules in binary data. Ph.D. thesis, University of Helsinki (2010)"},{"issue":"1","key":"23_CR16","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.: Frequent pattern mining: current status and future directions. Data Min. Knowl. Discov. 15(1), 55\u201386 (2007)","journal-title":"Data Min. Knowl. Discov."},{"issue":"1","key":"23_CR17","doi-asserted-by":"publisher","first-page":"103","DOI":"10.2298\/CSIS0501103H","volume":"2","author":"Z He","year":"2005","unstructured":"He, Z., Xu, X., Huang, Z.J., Deng, S.: FP-outlier: frequent pattern based outlier detection. Comput. Sci. Inf. Syst. 2(1), 103\u2013118 (2005)","journal-title":"Comput. Sci. Inf. Syst."},{"issue":"2","key":"23_CR18","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1016\/j.ejor.2006.10.059","volume":"184","author":"P Lenca","year":"2008","unstructured":"Lenca, P., Meyer, P., Vaillant, B., Lallich, S.: On selecting interestingness measures for association rules: user oriented description and multiple criteria decision aid. EJOR 184(2), 610\u2013626 (2008)","journal-title":"EJOR"},{"issue":"3","key":"23_CR19","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H Mannila","year":"1997","unstructured":"Mannila, H., Toivonen, H.: Levelwise search and borders of theories in knowledge discovery. Data Min. Knowl. Discov. 1(3), 241\u2013258 (1997)","journal-title":"Data Min. Knowl. Discov."},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","DOI":"10.1007\/b137601","volume-title":"Local Pattern Detection","year":"2005","unstructured":"Morik, K., Boulicaut, J.-F., Siebes, A. (eds.): Local Pattern Detection. LNCS (LNAI), vol. 3539. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/b137601"},{"issue":"1","key":"23_CR21","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1109\/TKDE.2003.1161582","volume":"15","author":"E Omiecinski","year":"2003","unstructured":"Omiecinski, E.: Alternative interest measures for mining associations in databases. IEEE Trans. Knowl. Data Eng. 15(1), 57\u201369 (2003)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"23_CR22","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. Inf. Syst. 24(1), 25\u201346 (1999)","journal-title":"Inf. Syst."},{"key":"23_CR23","unstructured":"Piatetsky-Shapiro, G.: Discovery, analysis, and presentation of strong rules. In: Knowledge Discovery in Databases, pp. 229\u2013248. AAAI\/MIT Press, Cambridge (1991)"},{"issue":"4","key":"23_CR24","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0306-4379(03)00072-3","volume":"29","author":"PN Tan","year":"2004","unstructured":"Tan, P.N., Kumar, V., Srivastava, J.: Selecting the right objective measure for association analysis. Inf. Syst. 29(4), 293\u2013313 (2004)","journal-title":"Inf. Syst."},{"issue":"4","key":"23_CR25","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1007\/s10618-013-0326-x","volume":"28","author":"CV Tew","year":"2014","unstructured":"Tew, C.V., Giraud-Carrier, C.G., Tanner, K.W., Burton, S.H.: Behavior-based clustering and analysis of interestingness measures for association rule mining. Data Min. Knowl. Discov. 28(4), 1004\u20131045 (2014)","journal-title":"Data Min. Knowl. Discov."},{"key":"23_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":"3","key":"23_CR27","doi-asserted-by":"publisher","first-page":"15:1","DOI":"10.1145\/2601433","volume":"8","author":"GI Webb","year":"2013","unstructured":"Webb, G.I., Vreeken, J.: Efficient discovery of the most interesting associations. ACM Trans. Knowl. Discov. Data 8(3), 15:1\u201315:31 (2013)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"23_CR28","doi-asserted-by":"crossref","unstructured":"Xin, D., Cheng, H., Yan, X., Han, J.: Extracting redundancy-aware top-k patterns. In: KDD, pp. 444\u2013453. ACM (2006)","DOI":"10.1145\/1150402.1150452"},{"issue":"3","key":"23_CR29","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10844-013-0297-9","volume":"45","author":"A Zimmermann","year":"2015","unstructured":"Zimmermann, A.: Objectively evaluating condensed representations and interestingness measures for frequent itemset mining. J. Intell. Inf. Syst. 45(3), 299\u2013317 (2015)","journal-title":"J. Intell. Inf. Syst."}],"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-10925-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T01:31:19Z","timestamp":1705455079000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10925-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030109240","9783030109257"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10925-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"18 January 2019","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":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ecmlpkdd2018.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":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"535","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":"131","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":"17","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":"24% - 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","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":"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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}