{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T12:56:28Z","timestamp":1726059388069},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030352301"},{"type":"electronic","value":"9783030352318"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-35231-8_43","type":"book-chapter","created":{"date-parts":[[2019,11,15]],"date-time":"2019-11-15T19:30:38Z","timestamp":1573846238000},"page":"591-604","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast Bat Algorithm for Predicting Diabetes Mellitus Using Association Rule Mining"],"prefix":"10.1007","author":[{"given":"Hend","family":"Amraoui","sequence":"first","affiliation":[]},{"given":"Faouzi","family":"Mhamdi","sequence":"additional","affiliation":[]},{"given":"Mourad","family":"Elloumi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,15]]},"reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A.: Mining association rules between sets of items in large databases. In: ACM SIGMOD Record, vol. 22, pp. 207\u2013216. ACM (1993)","DOI":"10.1145\/170036.170072"},{"key":"43_CR2","unstructured":"Amraoui, H., Mhamdi, F., Elloumi, M.: Fast exhaustive search algorithm for discovering relevant association rules"},{"key":"43_CR3","doi-asserted-by":"publisher","first-page":"291","DOI":"10.3934\/medsci.2017.3.291","volume":"4","author":"H Amraoui","year":"2017","unstructured":"Amraoui, H., Mhamdi, F., Elloumi, M.: Survey of metaheuristics and statistical methods for multifactorial diseases analyses. AIMS Med. Sci. 4, 291\u2013331 (2017)","journal-title":"AIMS Med. Sci."},{"issue":"2","key":"43_CR4","first-page":"123","volume":"24","author":"L Breiman","year":"1996","unstructured":"Breiman, L.: Bagging predictors. Mach. Learn. 24(2), 123\u2013140 (1996)","journal-title":"Mach. Learn."},{"key":"43_CR5","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.eswa.2017.10.042","volume":"94","author":"Y Djenouri","year":"2018","unstructured":"Djenouri, Y., Belhadi, A., Belkebir, R.: Bees swarm optimization guided by data mining techniques for document information retrieval. Expert Syst. Appl. 94, 126\u2013136 (2018)","journal-title":"Expert Syst. Appl."},{"key":"43_CR6","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/j.ins.2018.06.060","volume":"496","author":"Y Djenouri","year":"2018","unstructured":"Djenouri, Y., Djenouri, D., Belhadi, A., Fournier-Viger, P., Lin, J.C.W., Bendjoudi, A.: Exploiting GPU parallelism in improving bees swarm optimization for mining big transactional databases. Inf. Sci. 496, 326\u2013342 (2018)","journal-title":"Inf. Sci."},{"issue":"7","key":"43_CR7","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1166\/jctn.2015.3873","volume":"12","author":"KE Heraguemi","year":"2015","unstructured":"Heraguemi, K.E., Kamel, N., Drias, H.: Association rule mining based on bat algorithm. J. Comput. Theor. Nanosci. 12(7), 1195\u20131200 (2015)","journal-title":"J. Comput. Theor. Nanosci."},{"key":"43_CR8","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-319-67669-2_14","volume-title":"Nature-Inspired Algorithms and Applied Optimization","author":"T Jayabarathi","year":"2018","unstructured":"Jayabarathi, T., Raghunathan, T., Gandomi, A.H.: The bat algorithm, variants and some practical engineering applications: a review. In: Yang, X.-S. (ed.) Nature-Inspired Algorithms and Applied Optimization. SCI, vol. 744, pp. 313\u2013330. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-67669-2_14"},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"Li, Y., Li, Y.: E-commerce order batching algorithm based on association rule mining in the era of big data. In: 2018 Chinese Control And Decision Conference (CCDC), pp. 1934\u20131939. IEEE (2018)","DOI":"10.1109\/CCDC.2018.8407443"},{"key":"43_CR10","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-981-10-3223-3_9","volume-title":"Data Engineering and Intelligent Computing","author":"S Neelima","year":"2018","unstructured":"Neelima, S., Satyanarayana, N., Krishna Murthy, P.: Minimizing frequent itemsets using hybrid ABCBAT algorithm. In: Satapathy, S.C., Bhateja, V., Raju, K.S., Janakiramaiah, B. (eds.) Data Engineering and Intelligent Computing. AISC, vol. 542, pp. 91\u201397. Springer, Singapore (2018). \nhttps:\/\/doi.org\/10.1007\/978-981-10-3223-3_9"},{"key":"43_CR11","unstructured":"Smith, J.W., Everhart, J., Dickson, W., Knowler, W., Johannes, R.: Using the ADAP learning algorithm to forecast the onset of diabetes mellitus. In: Proceedings of the Annual Symposium on Computer Application in Medical Care, p. 261. American Medical Informatics Association (1988)"},{"key":"43_CR12","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.eswa.2018.07.031","volume":"114","author":"B Talebi","year":"2018","unstructured":"Talebi, B., Dehkordi, M.N.: Sensitive association rules hiding using electromagnetic field optimization algorithm. Expert Syst. Appl. 114, 155\u2013172 (2018)","journal-title":"Expert Syst. Appl."},{"key":"43_CR13","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-12538-6_6","volume-title":"Nature Inspired Cooperative Strategies for Optimization (NICSO 2010)","author":"XS Yang","year":"2010","unstructured":"Yang, X.S.: A new metaheuristic bat-inspired algorithm. In: Gonz\u00e1lez, J.R., Pelta, D.A., Cruz, C., Terrazas, G., Krasnogor, N. (eds.) Nature Inspired Cooperative Strategies for Optimization (NICSO 2010), pp. 65\u201374. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-12538-6_6"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35231-8_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,15]],"date-time":"2019-11-15T19:44:03Z","timestamp":1573847043000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-35231-8_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030352301","9783030352318"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35231-8_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"15 November 2019","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":"Dalian","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2019","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":"adma2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/adma2019.neusoft.edu.cn\/","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":"170","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":"39","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":"26","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":"23% - 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":"7","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)"}}]}}