{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T15:06:34Z","timestamp":1773068794470,"version":"3.50.1"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031333736","type":"print"},{"value":"9783031333743","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-33374-3_20","type":"book-chapter","created":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T10:02:30Z","timestamp":1685095350000},"page":"252-263","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Interactive Pattern Mining Using Discriminant Sub-patterns as\u00a0Dynamic Features"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0547-784X","authenticated-orcid":false,"given":"Arnold","family":"Hien","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6245-7661","authenticated-orcid":false,"given":"Samir","family":"Loudni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3204-6065","authenticated-orcid":false,"given":"Noureddine","family":"Aribi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0855-0181","authenticated-orcid":false,"given":"Abdelkader","family":"Ouali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8319-7456","authenticated-orcid":false,"given":"Albrecht","family":"Zimmermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,27]]},"reference":[{"key":"20_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th VLDB, pp. 487\u2013499. Santiago de Chile, Chile (1994)"},{"issue":"1","key":"20_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.4086\/toc.2012.v008a006","volume":"8","author":"S Arora","year":"2012","unstructured":"Arora, S., Hazan, E., Kale, S.: The multiplicative weights update method: a meta-algorithm and applications. Theory Comput. 8(1), 121\u2013164 (2012)","journal-title":"Theory Comput."},{"issue":"4","key":"20_CR3","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/sam.11322","volume":"9","author":"M Bhuiyan","year":"2016","unstructured":"Bhuiyan, M., Hasan, M.A.: Interactive knowledge discovery from hidden data through sampling of frequent patterns. Stat. Anal. Data Min. 9(4), 205\u2013229 (2016)","journal-title":"Stat. Anal. Data Min."},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Dzyuba, V., van Leeuwen, M.: Learning what matters - sampling interesting patterns. In: PAKDD 2017, Proceedings, Part I, pp. 534\u2013546 (2017)","DOI":"10.1007\/978-3-319-57454-7_42"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Dzyuba, V., van Leeuwen, M., Nijssen, S., Raedt, L.D.: Interactive learning of pattern rankings. Int. J. Artif. Intell. Tools 23(6), 1460026 (2014)","DOI":"10.1142\/S0218213014600264"},{"issue":"5","key":"20_CR6","doi-asserted-by":"publisher","first-page":"1266","DOI":"10.1007\/s10618-017-0501-6","volume":"31","author":"V Dzyuba","year":"2017","unstructured":"Dzyuba, V., van Leeuwen, M., De Raedt, L.: Flexible constrained sampling with guarantees for pattern mining. Data Min. Knowl. Disc. 31(5), 1266\u20131293 (2017). https:\/\/doi.org\/10.1007\/s10618-017-0501-6","journal-title":"Data Min. Knowl. Disc."},{"key":"20_CR7","unstructured":"Hien, A., Loudni, S., Aribi, N., Ouali, A., Zimmermann, A.: Code and supplementary material. https:\/\/gitlab.com\/phdhien\/dispale (2023)"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Joachims, T.: Optimizing search engines using clickthrough data. In: Proceedings of the ACM SIGKDD KDD 2002, pp. 133\u2013142. New York, NY, USA (2002)","DOI":"10.1145\/775047.775067"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Kamishima, T., Kazawa, H., Akaho, S.: A survey and empirical comparison of object ranking methods, pp. 181\u2013201 (2010)","DOI":"10.1007\/978-3-642-14125-6_9"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Morishita, S., Sese, J.: Traversing itemset lattices with statistical metric pruning. In: Proceedings of the Nineteenth ACM SIGACT-SIGMOD-SIGART Symposium, pp. 226\u2013236 (2000)","DOI":"10.1145\/335168.335226"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Raedt, L.D., Zimmermann, A.: Constraint-based pattern set mining. In: Proceedings of the 17th SIAM ICDM 2007, Minneapolis, Minnesota, USA, pp. 237\u2013248. SIAM (2007)","DOI":"10.1137\/1.9781611972771.22"},{"key":"20_CR12","unstructured":"R\u00fcping, S.: Ranking interesting subgroups. In: Danyluk, A.P., Bottou, L., Littman, M.L. (eds.) Proceedings of ICML 2009, vol. 382, pp. 913\u2013920 (2009)"},{"key":"20_CR13","first-page":"1865","volume":"12","author":"S Shalev-Shwartz","year":"2011","unstructured":"Shalev-Shwartz, S., Tewari, A.: Stochastic methods for l$${}_{\\text{1 }}$$-regularized loss minimization. J. Mach. Learn. Res. 12, 1865\u20131892 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Tan, P.N., Kumar, V., Srivastava, J.: Selecting the right interestingness measure for association patterns. In: KDD, pp. 32\u201341 (2002)","DOI":"10.1145\/775047.775053"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33374-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T20:02:06Z","timestamp":1710360126000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33374-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031333736","9783031333743"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33374-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Osaka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2023.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"813","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":"143","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.5","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":"10","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)"}}]}}