{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T00:13:27Z","timestamp":1766362407012,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031414558"},{"type":"electronic","value":"9783031414565"}],"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-41456-5_19","type":"book-chapter","created":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T23:02:43Z","timestamp":1694559763000},"page":"245-255","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Association Rules Minimization Using a Double-Stage Quine-McCluskey-Based Approach"],"prefix":"10.1007","author":[{"given":"Lidia","family":"Bedhouche","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed Amir","family":"Koalal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0877-1929","authenticated-orcid":false,"given":"Alaidine","family":"Ben Ayed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7644-5810","authenticated-orcid":false,"given":"Isma\u00efl","family":"Biskri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,13]]},"reference":[{"key":"19_CR1","first-page":"29","volume":"2","author":"MZ Ashrafi","year":"2007","unstructured":"Ashrafi, M.Z., Taniar, D., Smith, K.: Redundant association rules reduction techniques. Int. J. Bus. Intell. Data Min. 2, 29\u201363 (2007)","journal-title":"Int. J. Bus. Intell. Data Min."},{"key":"19_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases, VLDB, pp. 487\u2013499. Citeseer (1994)"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Zaki, M.: Generating non-redundant association rules. In: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 34\u201343 (2000)","DOI":"10.1145\/347090.347101"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.11118\/actaun201563031031","volume":"63","author":"P Tur\u010d\u00ednek","year":"2015","unstructured":"Tur\u010d\u00ednek, P., Tur\u010d\u00ednkov\u00e1, J.: Exploring consumer behavior: use of association rules. Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis 63, 1031\u20131042 (2015)","journal-title":"Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis"},{"key":"19_CR5","doi-asserted-by":"publisher","unstructured":"Lin, W.-Y., Tseng, M.-C., Su, J.-H.: A confidence-lift support specification for interesting associations mining. In: Chen, MS., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS, vol. 2336, pp. 148\u2013158. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-47887-6_14","DOI":"10.1007\/3-540-47887-6_14"},{"key":"19_CR6","unstructured":"Han, J., Pei, J., Kamber, M.: Data mining: concepts and techniques. Elsevier (2011)"},{"key":"19_CR7","first-page":"6","volume":"2015","author":"Y Zeng","year":"2015","unstructured":"Zeng, Y., Yin, S., Liu, J., Zhang, M.: Research of improved FPGrowth algorithm in association rules mining. Sci. Program. 2015, 6 (2015)","journal-title":"Sci. Program."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Staneva, L.A.: Minimising using the method of Quine-McCluskey with generalised nets. In: 29th Annual Conference of the European Association for Education in Electrical and Information Engineering (EAEEIE), pp. 1\u20133. IEEE (2019)","DOI":"10.1109\/EAEEIE46886.2019.9000462"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Majumder, A., Chowdhury, B., Mondai, A.J., Jain, K.: Investigation on Quine McCluskey method: a decimal manipulation based novel approach for the minimization of Boolean function. In: International Conference on Electronic Design, Computer Networks Automated Verification (EDCAV), pp. 18\u201322. IEEE (2015)","DOI":"10.1109\/EDCAV.2015.7060531"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.neucom.2018.09.108","volume":"393","author":"X Dong","year":"2020","unstructured":"Dong, X., Hao, F., Zhao, L., Xu, T.: An efficient method for pruning redundant negative and positive association rules. Neurocomputing 393, 245\u2013258 (2020)","journal-title":"Neurocomputing"},{"key":"19_CR11","unstructured":"SANAD. https:\/\/data.mendeley.com\/datasets\/57zpx667y9\/2"},{"key":"19_CR12","unstructured":"El Bazzi, M.S., Zaki, T., Mammass, D., Ennaji, A.: Automatic indexing of Arabic texts: state of the art. Electron. J. Inf. Technol. 9, 1\u20132 (2016)"},{"issue":"8","key":"19_CR13","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1080\/00029890.1952.11988183","volume":"59","author":"WV Quine","year":"1952","unstructured":"Quine, W.V.: The problem of simplifying truth functions. Am. Math. Mon. 59(8), 521\u2013531 (1952)","journal-title":"Am. Math. Mon."},{"issue":"9","key":"19_CR14","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1080\/00029890.1955.11988710","volume":"62","author":"WV Quine","year":"1955","unstructured":"Quine, W.V.: A way to simplify truth functions. Am. Math. Mon. 62(9), 627\u2013631 (1955)","journal-title":"Am. Math. Mon."},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"McCluskey Jr., E.J.: Minimization of boolean functions. Bell Syst. Tech. J. 35(6), 1417\u20131444 (1956)","DOI":"10.1002\/j.1538-7305.1956.tb03835.x"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"117436","DOI":"10.1016\/j.eswa.2022.117436","volume":"202","author":"T Agouti","year":"2022","unstructured":"Agouti, T.: Graph-based modeling using association rule mining to detect influential users in social networks. Expert Syst. Appl. 202, 117436 (2022)","journal-title":"Expert Syst. Appl."},{"key":"19_CR17","first-page":"100095","volume":"5","author":"F Pohlmeyer","year":"2022","unstructured":"Pohlmeyer, F., Kins, R., Cloppenburg, F., Gries, T.: Interpretable failure risk assessment for continuous production processes based on association rule mining. Adv. Ind. Manuf. Eng. 5, 100095 (2022)","journal-title":"Adv. Ind. Manuf. Eng."}],"container-title":["Lecture Notes in Computer Science","Computational Collective Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-41456-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T23:06:20Z","timestamp":1694559980000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-41456-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031414558","9783031414565"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-41456-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"13 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Collective Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Budapest","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hungary","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":"27 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccci2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccci.pwr.edu.pl\/2023\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"218","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":"59","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":"27% - 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.01","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":"1.86","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)"}}]}}