{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:02:58Z","timestamp":1743004978964,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031221361"},{"type":"electronic","value":"9783031221378"}],"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-031-22137-8_31","type":"book-chapter","created":{"date-parts":[[2022,11,23]],"date-time":"2022-11-23T04:36:29Z","timestamp":1669178189000},"page":"419-433","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Distributed SAT-Based Framework for\u00a0Closed Frequent Itemset Mining"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9961-0508","authenticated-orcid":false,"given":"Julien","family":"Martin-Prin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6928-4599","authenticated-orcid":false,"given":"Imen Ouled","family":"Dlala","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3502-151X","authenticated-orcid":false,"given":"Nicolas","family":"Travers","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8389-8332","authenticated-orcid":false,"given":"Said","family":"Jabbour","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,24]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: SIGMOD 1993, Washington, USA, pp. 207\u2013216 (1993)","key":"31_CR1","DOI":"10.1145\/170036.170072"},{"doi-asserted-by":"crossref","unstructured":"Audemard, G., Hoessen, B., Jabbour, S., Piette, C.: Dolius: a distributed parallel SAT solving framework. In: Workshop POS 2014. @ SAT, vol. 27, pp. 1\u201311 (2014)","key":"31_CR2","DOI":"10.29007\/hvqt"},{"doi-asserted-by":"crossref","unstructured":"Balyo, T., Sanders, P., Sinz, C.: Hordesat: a massively parallel portfolio SAT solver. CoRR abs\/1505.03340 (2015)","key":"31_CR3","DOI":"10.1007\/978-3-319-24318-4_12"},{"doi-asserted-by":"crossref","unstructured":"Borgelt, C.: Frequent item set mining. Wiley Interdisc. Rev. Data Min. Knowl. Disc. 2(6), 437\u2013456 (2012)","key":"31_CR4","DOI":"10.1002\/widm.1074"},{"unstructured":"Boudane, A., Jabbour, S., Sais, L., Salhi, Y.: A SAT-based approach for mining association rules. In: IJCAI 2016, New York, USA, pp. 2472\u20132478 (2016)","key":"31_CR5"},{"doi-asserted-by":"crossref","unstructured":"Cheung, D.W.L., Han, J., Ng, V.T.Y., Fu, A.W.C., Fu, Y.: A fast distributed algorithm for mining association rules. In: ICPADS 1996, pp. 31\u201342 (1996)","key":"31_CR6","DOI":"10.1109\/PDIS.1996.568665"},{"issue":"6","key":"31_CR7","first-page":"911","volume":"8","author":"DW Cheung","year":"1996","unstructured":"Cheung, D.W., Ng, V.T.Y., Fu, A.W., Fu, Y.: Efficient mining of association rules in distributed databases. IEEE TKDE 8(6), 911\u2013922 (1996)","journal-title":"IEEE TKDE"},{"doi-asserted-by":"crossref","unstructured":"Chrabakh, W., Wolski, R.: Gridsat: a chaff-based distributed SAT solver for the grid. In: ACM SC 2003, Phoenix, AZ, USA, p. 37. ACM (2003)","key":"31_CR8","DOI":"10.1145\/1048935.1050188"},{"issue":"1","key":"31_CR9","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1145\/1629175.1629198","volume":"53","author":"J Dean","year":"2010","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: a flexible data processing tool. Commun. ACM 53(1), 72\u201377 (2010)","journal-title":"Commun. ACM"},{"doi-asserted-by":"crossref","unstructured":"Dlala, I.O., Jabbour, S., Raddaoui, B., Sais, L.: A parallel SAT-based framework for closed frequent itemsets mining. In: CP 2018, vol. 11008, pp. 570\u2013587 (2018)","key":"31_CR10","DOI":"10.1007\/978-3-319-98334-9_37"},{"doi-asserted-by":"crossref","unstructured":"Frioux, L.L., Baarir, S., Sopena, J., Kordon, F.: PaInleSS: a framework for parallel SAT solving. In: SAT 2017, Melbourne, Australia, vol. 10491, pp. 233\u2013250 (2017)","key":"31_CR11","DOI":"10.1007\/978-3-319-66263-3_15"},{"doi-asserted-by":"crossref","unstructured":"Gahar, R.M., Arfaoui, O., Hidri, M.S., Hadj-Alouane, N.B.: ParallelCharMax: an effective maximal frequent itemset mining algorithm based on mapreduce framework. In: AICCSA 2017, Hammamet, Tunisia, pp. 571\u2013578 (2017)","key":"31_CR12","DOI":"10.1109\/AICCSA.2017.80"},{"doi-asserted-by":"crossref","unstructured":"Gan, W., Lin, J.C., Chao, H., Zhan, J.: Data mining in distributed environment: a survey. Wiley Interdisc. Rev. Data Min. Knowl. Disc. 7(6), e1216 (2017)","key":"31_CR13","DOI":"10.1002\/widm.1216"},{"unstructured":"Gebser, M., Guyet, T., Quiniou, R., Romero, J., Schaub, T.: Knowledge-based sequence mining with ASP. In: IJCAI 2016, New York, USA, pp. 1497\u20131504 (2016)","key":"31_CR14"},{"issue":"1","key":"31_CR15","first-page":"53","volume":"8","author":"J Han","year":"2004","unstructured":"Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. DMKD 8(1), 53\u201387 (2004)","journal-title":"DMKD"},{"doi-asserted-by":"crossref","unstructured":"Hyv\u00e4rinen, A.E.J., Junttila, T.A., Niemel\u00e4, I.: Partitioning SAT instances for distributed solving. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR 2017, Yogyakarta, Indonesia, vol. 6397, pp. 372\u2013386 (2010)","key":"31_CR16","DOI":"10.1007\/978-3-642-16242-8_27"},{"doi-asserted-by":"crossref","unstructured":"Hyv\u00e4rinen, A.E.J., Junttila, T.A., Niemel\u00e4, I.: Grid-based SAT solving with iterative partitioning and clause learning. In: CP 2011, vol. 6876, pp. 385\u2013399 (2011)","key":"31_CR17","DOI":"10.1007\/978-3-642-23786-7_30"},{"doi-asserted-by":"crossref","unstructured":"Jabbour, S., Sais, L., Salhi, Y.: The top-k frequent closed itemset mining using top-k SAT problem. In: ECML PKDD 2013, vol. 8190, pp. 403\u2013418 (2013)","key":"31_CR18","DOI":"10.1007\/978-3-642-40994-3_26"},{"doi-asserted-by":"crossref","unstructured":"Lazaar, N., et al.: A global constraint for closed frequent pattern mining. In: CP 2016, Toulouse, France, vol. 9892, pp. 333\u2013349 (2016)","key":"31_CR19","DOI":"10.1007\/978-3-319-44953-1_22"},{"doi-asserted-by":"crossref","unstructured":"Li, H., Wang, Y., Zhang, D., Zhang, M., Chang, E.Y.: PFP: parallel fp-growth for query recommendation. In: RecSys 2008, Lausanne, Switzerland, pp. 107\u2013114 (2008)","key":"31_CR20","DOI":"10.1145\/1454008.1454027"},{"doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: DAC 2001, pp. 530\u2013535 (2001)","key":"31_CR21","DOI":"10.1145\/378239.379017"},{"doi-asserted-by":"crossref","unstructured":"N\u00e9grevergne, B., Guns, T.: Constraint-based sequence mining using constraint programming. CoRR abs\/1501.01178 (2015)","key":"31_CR22","DOI":"10.1007\/978-3-319-18008-3_20"},{"doi-asserted-by":"crossref","unstructured":"Ngoko, Y., Trystram, D., C\u00e9rin, C.: A distributed cloud service for the resolution of SAT. In: SC$${^2}$$ 2017, Kanazawa, Japan, pp. 1\u20138 (2017)","key":"31_CR23","DOI":"10.1109\/SC2.2017.9"},{"doi-asserted-by":"crossref","unstructured":"Raedt, L.D., Guns, T., Nijssen, S.: Constraint programming for itemset mining. In: SIGKDD 2008, Las Vegas, Nevada, USA, pp. 204\u2013212 (2008)","key":"31_CR24","DOI":"10.1145\/1401890.1401919"},{"doi-asserted-by":"crossref","unstructured":"Schaus, P., Aoga, J.O.R., Guns, T.: CoverSize: a global constraint for frequency-based itemset mining. In: CP 2017, vol. 10416, pp. 529\u2013546 (2017)","key":"31_CR25","DOI":"10.1007\/978-3-319-66158-2_34"},{"unstructured":"Zaharia, M., et al.: Resilient distributed datasets: a fault-tolerant abstraction for in-memory cluster computing. In: NSDI 2012, pp. 15\u201328 (2012)","key":"31_CR26"},{"issue":"4","key":"31_CR27","first-page":"462","volume":"17","author":"MJ Zaki","year":"2005","unstructured":"Zaki, M.J., Hsiao, C.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE TKDE 17(4), 462\u2013478 (2005)","journal-title":"IEEE TKDE"},{"issue":"4","key":"31_CR28","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1006\/jsco.1996.0030","volume":"21","author":"H Zhang","year":"1996","unstructured":"Zhang, H., Bonacina, M.P., Hsiang, J.: PSATO: a distributed propositional prover and its application to quasigroup problems. J. Symb. Comp. 21(4), 543\u2013560 (1996)","journal-title":"J. Symb. Comp."}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22137-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T10:42:59Z","timestamp":1728470579000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22137-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221361","9783031221378"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22137-8_31","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":"24 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brisbane, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2022","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":"adma2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adma2022.uqcloud.net\/index.html","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":"CMT3","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"198","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":"72","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":"36% - 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":"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":"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)"}}]}}