{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:42:56Z","timestamp":1743003776469,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031064579"},{"type":"electronic","value":"9783031064586"}],"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-06458-6_12","type":"book-chapter","created":{"date-parts":[[2022,5,12]],"date-time":"2022-05-12T15:07:58Z","timestamp":1652368078000},"page":"146-157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Mining Frequents Itemset and Association Rules in Diabetic Dataset"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1391-1052","authenticated-orcid":false,"given":"Youssef","family":"Fakir","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3404-9403","authenticated-orcid":false,"given":"Abdelfatah","family":"Maarouf","sequence":"additional","affiliation":[]},{"given":"Rachid","family":"El Ayachi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,13]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data - SIGMOD 2000, pp. 1\u201312. Dallas, Texas, United States (2000)","DOI":"10.1145\/342009.335372"},{"key":"12_CR2","unstructured":"Fakir, Y., et al.: A comparative study between Relim and SaM algorithms. Int. J. Comput. Sci. Inf. Secur. 18(5) (2020)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Ya-Han, H., Chen, Y.-L.: Mining association rules with multiple minimum supports: a new mining algorithm and a support tuning mechanism. Decis. Supp. Syst. 42(1), 1\u201324 (2006)","DOI":"10.1016\/j.dss.2004.09.007"},{"issue":"3","key":"12_CR4","first-page":"01","volume":"3","author":"JV Joshua","year":"2016","unstructured":"Joshua, J.V., et al.: Data mining: a book recommender system using frequent pattern algorithm. J. Softw. Eng. Simul. 3(3), 01\u201313 (2016)","journal-title":"J. Softw. Eng. Simul."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Pathania, S., Singh, H.: A new associative classifier based on CFP-Growth++ algorithm. In: Proceedings of the Sixth International Conference on Computer and Communication Technology 2015, pp. 20\u201325. New York, NY, USA (2015)","DOI":"10.1145\/2818567.2818571"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Uday Kiran, R., Krishna Reddy, P.: Novel techniques to reduce search space in multiple minimum supports-based frequent pattern mining algorithms. In: Proceedings of the 14th International Conference on Extending Database Technology - EDBT\/ICDT 2011, p. 11. Uppsala, Sweden (2011)","DOI":"10.1145\/1951365.1951370"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Fakir, Y., et al.: Closed frequent itemsets mining based on It-Tree. Global J. Comput. Sci. Theory Res. 11(1) (2021)","DOI":"10.18844\/gjcs.v11i1.4912"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Fakir, Y., El Ayachi, R., Fakir, M.: Mining frequent pattern by titanic and FP-Tree algorithms. Int. J. Sci. Res. Comput. Sci. Eng. Inf. Technol. 6(5) (2020)","DOI":"10.32628\/CSEIT206537"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Uday Kiran, R., Krishna Reddy, P.: An improved frequent pattern-growth approach to discover rare association rules. In: Proceedings of the International Conference on Knowledge Discovery and Information Retrieval, pp. 43\u201352. Funchal - Madeira, Portugal (2009)","DOI":"10.5220\/0002299600430052"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Liu, G., et al.: CFP-tree: a compact disk-based structure for storing and querying frequent itemsets. Inf. Syst. 32(2), 295\u2013319 (2007)","DOI":"10.1016\/j.is.2005.11.004"},{"key":"12_CR11","unstructured":"Darraba, S., Ergenc, B.: Vertical pattern mining algorithm for multiple support thresholds. In: International Conference on Knowledge Based and Intelligent Information and Engineering Systems, KES2017, 6\u20138 September 2017, Marseille, France (2017)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Ahmed, S.A., Nath, B.: ISSP-tree: an improved fast algorithm for constructing a complete prefix tree using single database scan. Expert Syst. Appl. 185, 115603 (2021)","DOI":"10.1016\/j.eswa.2021.115603"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Gan, W.: Mining of frequent patterns with multiple minimum supports. Eng. Appl. Artif. Intell. 60, 83\u201396 (2017)","DOI":"10.1016\/j.engappai.2017.01.009"},{"key":"12_CR14","unstructured":"Chen, X., Huang, H., Du, W.: Most frequent item sets mining algorithm based on MIS-Tree and multiple support array. Int. J. Res. Eng. Sci. 4(7) (2016)"},{"key":"12_CR15","unstructured":"Sinthuja, M., Rachel, S.S., Janani, G.: Mis-Tree algorithm for mining association rules with multiple minimum support. Bonfring Int. J. Datamin. 1, 1\u20135 (2021)"},{"key":"12_CR16","unstructured":"Fakir, Y., El Ayachi, R.: Frequent patterns mining. Int. J. Sci. Res. Comput. Sc. Eng. Inf. Technol. 6(4) (2020)"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Narvekara, M., Syed, S.F.: An optimized algorithm for association rule mining using FP tree. In: International Conference on Advanced Computing Technologies and Applications (ICACTA-2015), Procedia Computer Science, vol. 45, 101\u2013110 (2015)","DOI":"10.1016\/j.procs.2015.03.097"}],"container-title":["Lecture Notes in Business Information Processing","Business Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06458-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,24]],"date-time":"2024-09-24T15:28:40Z","timestamp":1727191720000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06458-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031064579","9783031064586"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06458-6_12","relation":{},"ISSN":["1865-1348","1865-1356"],"issn-type":[{"type":"print","value":"1865-1348"},{"type":"electronic","value":"1865-1356"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"13 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CBI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Business Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Khouribga","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","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":"26 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cbi2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cbi-bm.com\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"68","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":"23","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":"34% - 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":"2","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)"}}]}}