{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T16:19:00Z","timestamp":1781713140333,"version":"3.54.5"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030913861","type":"print"},{"value":"9783030913878","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-91387-8_3","type":"book-chapter","created":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T15:05:39Z","timestamp":1637247939000},"page":"39-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Distributed Scalable Association Rule Mining over Covid-19 Data"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5784-6301","authenticated-orcid":false,"given":"Mahtab","family":"Shahin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5121-9043","authenticated-orcid":false,"given":"Wissem","family":"Inoubli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2949-7391","authenticated-orcid":false,"given":"Syed Attique","family":"Shah","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8939-8948","authenticated-orcid":false,"given":"Sadok Ben","family":"Yahia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3376-7489","authenticated-orcid":false,"given":"Dirk","family":"Draheim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,11,19]]},"reference":[{"key":"3_CR1","unstructured":"Abdelghani, B., Guven, E.: Predicting breast cancer survivability using data mining techniques. In: SIAM International Conference on Data Mining (2006)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"key":"3_CR3","unstructured":"Agrawal, R., Srikant, R., et al.: Fast algorithms for mining association rules. In: Proceedings of 20th International Conference on Very Large Data Bases, VLDB, vol. 1215, pp. 487\u2013499. Citeseer (1994)"},{"issue":"2","key":"3_CR4","first-page":"113","volume":"8","author":"H Anwar","year":"2020","unstructured":"Anwar, H., Khan, Q.U.: Pathology and therapeutics of COVID-19: a review. Int. J. Med. Stud. 8(2), 113\u2013120 (2020)","journal-title":"Int. J. Med. Stud."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Armbrust, M., et al.: Spark SQL: Relational data processing in spark. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 1383\u20131394 (2015)","DOI":"10.1145\/2723372.2742797"},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Banks, D., House, L., McMorris, F.R., Arabie, P., Gaul, W.A.: Classification, Clustering, and Data Mining Applications: Proceedings of the Meeting of the International Federation of Classification Societies (IFCS), Illinois Institute of Technology, Chicago, 15\u201318 July 2004. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-17103-1","DOI":"10.1007\/978-3-642-17103-1"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Brijs, T., Swinnen, G., Vanhoof, K., Wets, G.: Using association rules for product assortment decisions: a case study. In: Proceedings of the fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 254\u2013260 (1999)","DOI":"10.1145\/312129.312241"},{"issue":"2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/s10586-014-0419-3","volume":"18","author":"Y Chen","year":"2015","unstructured":"Chen, Y., Li, F., Fan, J.: Mining association rules in big data with NGEP. Clust. Comput. 18(2), 577\u2013585 (2015)","journal-title":"Clust. Comput."},{"issue":"1","key":"3_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T Cover","year":"1967","unstructured":"Cover, T., Hart, P.: Nearest neighbor pattern classification. IEEE Trans. Inf. Theory 13(1), 21\u201327 (1967)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Fix, E., Hodges, J.L.: Discriminatory analysis. nonparametric discrimination: consistency properties. Int. Stat. Rev.\/Revue Int. Stat. 57(3), 238\u2013247 (1989)","DOI":"10.2307\/1403797"},{"issue":"2","key":"3_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. ACM SIGMOD Rec. 29(2), 1\u201312 (2000)","journal-title":"ACM SIGMOD Rec."},{"key":"3_CR12","unstructured":"Inoubli, W., Aridhi, S., Mezni, H., Maddouri, M., Nguifo, E.: A comparative study on streaming frameworks for big data. In: VLDB 2018\u201344th International Conference on Very Large Data Bases: Workshop LADaS-Latin American Data Science, pp. 1\u20138 (2018)"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1016\/j.future.2018.04.032","volume":"86","author":"W Inoubli","year":"2018","unstructured":"Inoubli, W., Aridhi, S., Mezni, H., Maddouri, M., Nguifo, E.M.: An experimental survey on big data frameworks. Futur. Gener. Comput. Syst. 86, 546\u2013564 (2018)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"3_CR14","unstructured":"Inoubli, W., Aridhi, S., Mezni, H., Mondher, M., Nguifo, E.: A distributed algorithm for large-scale graph clustering (2019)"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/j.ijmedinf.2016.11.001","volume":"97","author":"RJ Kate","year":"2017","unstructured":"Kate, R.J., Nadig, R.: Stage-specific predictive models for breast cancer survivability. Int. J. Med. Inf. 97, 304\u2013311 (2017)","journal-title":"Int. J. Med. Inf."},{"issue":"8","key":"3_CR16","first-page":"856","volume":"3","author":"G Kaur","year":"2013","unstructured":"Kaur, G., Aggarwal, S.: Performance analysis of association rule mining algorithms. Int. J. Adv. Res. Comput. Sci. Softw. Eng. 3(8), 856\u201358 (2013)","journal-title":"Int. J. Adv. Res. Comput. Sci. Softw. Eng."},{"key":"3_CR17","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-981-33-4370-2_1","volume-title":"Future Data and Security Engineering. Big Data, Security and Privacy, Smart City and Industry 4.0 Applications","author":"M Kaushik","year":"2020","unstructured":"Kaushik, M., Sharma, R., Peious, S.A., Shahin, M., Ben Yahia, S., Draheim, D.: On the potential of numerical association rule mining. In: Dang, T.K., K\u00fcng, J., Takizawa, M., Chung, T.M. (eds.) FDSE 2020. CCIS, vol. 1306, pp. 3\u201320. Springer, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-33-4370-2_1"},{"issue":"5","key":"3_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s42979-021-00725-2","volume":"2","author":"M Kaushik","year":"2021","unstructured":"Kaushik, M., Sharma, R., Peious, S.A., Shahin, M., Yahia, S.B., Draheim, D.: A systematic assessment of numerical association rule mining methods. SN Comput. Sci. 2(5), 1\u201313 (2021)","journal-title":"SN Comput. Sci."},{"issue":"1","key":"3_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-021-00473-3","volume":"8","author":"H Li","year":"2021","unstructured":"Li, H., Sheu, P.C.-Y.: A scalable association rule learning heuristic for large datasets. J. Big Data 8(1), 1\u201332 (2021). https:\/\/doi.org\/10.1186\/s40537-021-00473-3","journal-title":"J. Big Data"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Qiu, H., Gu, R., Yuan, C., Huang, Y.: YAFIM: a parallel frequent itemset mining algorithm with spark. In: 2014 IEEE International Parallel & Distributed Processing Symposium Workshops, pp. 1664\u20131671. IEEE (2014)","DOI":"10.1109\/IPDPSW.2014.185"},{"key":"3_CR21","doi-asserted-by":"publisher","unstructured":"Rasheed, J., et al.: A survey on artificial intelligence approaches in supporting frontline workers and decision makers for the COVID-19 pandemic. Chaos Solit. Fractals 141, 110337 (2020). https:\/\/doi.org\/10.1016\/j.chaos.2020.110337. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0960077920307323","DOI":"10.1016\/j.chaos.2020.110337"},{"issue":"34","key":"3_CR22","doi-asserted-by":"publisher","first-page":"3561","DOI":"10.17485\/IJST\/v13i34.1078","volume":"13","author":"A Senthilkumar","year":"2020","unstructured":"Senthilkumar, A., Hari Prasad, D.: An efficient FP-growth based association rule mining algorithm using hadoop MapReduce. Indian J. Sci. Technol. 13(34), 3561\u20133571 (2020)","journal-title":"Indian J. Sci. Technol."},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Shahin, M., et al.: Big data analytic in association rule mining: A systematic literature review. In: Proceedings of the International Conference on Big Data Engineering and Technology (2021). (in press)","DOI":"10.1145\/3474944.3474951"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Shahin, M., et al.: Cluster-based association rule mining for an intersection accident dataset. In: Proceedings of the IEEE International Conference on Computing, Electronic and Electrical Engineering (ICECUBE) (2021)","DOI":"10.1109\/ICECube53880.2021.9628206"},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.cmpb.2017.12.011","volume":"155","author":"N Shukla","year":"2018","unstructured":"Shukla, N., Hagenbuchner, M., Win, K.T., Yang, J.: Breast cancer data analysis for survivability studies and prediction. Comput. Methods Program. Biomed. 155, 199\u2013208 (2018)","journal-title":"Comput. Methods Program. Biomed."},{"key":"3_CR26","unstructured":"Spark, A.: Unified analytics engine for big data (2018). Accessed 5 Feb 2019"},{"key":"3_CR27","doi-asserted-by":"publisher","first-page":"25189","DOI":"10.1109\/ACCESS.2017.2763984","volume":"5","author":"W Wu","year":"2017","unstructured":"Wu, W., Zhou, H.: Data-driven diagnosis of cervical cancer with support vector machine-based approaches. IEEE Access 5, 25189\u201325195 (2017)","journal-title":"IEEE Access"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Xin, R.S., Gonzalez, J.E., Franklin, M.J., Stoica, I.: GraphX: a resilient distributed graph system on spark. In: First International Workshop on Graph Data Management Experiences and Systems, pp. 1\u20136 (2013)","DOI":"10.1145\/2484425.2484427"},{"issue":"1","key":"3_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41597-019-0340-y","volume":"7","author":"B Xu","year":"2020","unstructured":"Xu, B., et al.: Epidemiological data from the COVID-19 outbreak, real-time case information. Sci. Data 7(1), 1\u20136 (2020)","journal-title":"Sci. Data"},{"issue":"10\u201310","key":"3_CR30","first-page":"95","volume":"10","author":"M Zaharia","year":"2010","unstructured":"Zaharia, M., Chowdhury, M., Franklin, M.J., Shenker, S., Stoica, I., et al.: Spark: cluster computing with working sets. HotCloud 10(10\u201310), 95 (2010)","journal-title":"HotCloud"},{"issue":"3","key":"3_CR31","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki, M.J.: Scalable algorithms for association mining. IEEE Trans. Knowl. Data Eng. 12(3), 372\u2013390 (2000)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/3-540-45656-2_52","volume-title":"AI 2001: Advances in Artificial Intelligence","author":"S Zhang","year":"2001","unstructured":"Zhang, S., Webb, G.I.: Further pruning for efficient association rule discovery. In: Stumptner, M., Corbett, D., Brooks, M. (eds.) AI 2001. LNCS (LNAI), vol. 2256, pp. 605\u2013618. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45656-2_52"}],"container-title":["Lecture Notes in Computer Science","Future Data and Security Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91387-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,15]],"date-time":"2023-01-15T19:46:04Z","timestamp":1673811964000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91387-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030913861","9783030913878"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91387-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"19 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FDSE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Future Data and Security Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fdse2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/thefdse.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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"168","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":"52","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":"8","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":"31% - 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":"6","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)"}}]}}