{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T04:16:59Z","timestamp":1746505019917,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811675010"},{"type":"electronic","value":"9789811675027"}],"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-981-16-7502-7_30","type":"book-chapter","created":{"date-parts":[[2021,10,29]],"date-time":"2021-10-29T09:06:55Z","timestamp":1635498415000},"page":"289-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Improved Bacterial Foraging Optimization for Global Optimization"],"prefix":"10.1007","author":[{"given":"Tongtong","family":"Xing","sequence":"first","affiliation":[]},{"given":"Mengjie","family":"Wan","sequence":"additional","affiliation":[]},{"given":"Sili","family":"Wen","sequence":"additional","affiliation":[]},{"given":"Li","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,30]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Chen, Y., et al.: A novel bacterial foraging optimization algorithm for feature selection. Expert Syst. with Appl. 83(1) (2017)","DOI":"10.1016\/j.eswa.2017.04.019"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Devi, S., Geethanjali, M.: Application of modified bacterial foraging optimization algorithm for optimal placement and sizing of distributed generation. Expert Syst. Appl. 41, 2772 (2014)","DOI":"10.1016\/j.eswa.2013.10.010"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Elattar, E.E.: A hybrid genetic algorithm and bacterial foraging approach for dynamic economic dispatch problem. Int. J. Electr. Power Energy Syst. 69(18) (2015)","DOI":"10.1016\/j.ijepes.2014.12.091"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Guo, C., Tang, H., Niu, B., Boon Patrick Lee, C.: A survey of bacterial foraging optimization. Neurocomputing (2021)","DOI":"10.1016\/j.neucom.2020.06.142"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN 1995 - International Conference on Neural Networks, vol. 4, p. 1942 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Passino, K.M.: Biomimicry of bacterial foraging for distributed optimization and control. IEEE Control Syst. Mag. 22, 52 (2002)","DOI":"10.1109\/MCS.2002.1004010"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Liu Y., Passino K.M.: Biomimicry of social foraging bacteria for distributed optimization: models, principles, and emergent behaviors. J. Optim. Theory Appl. 115, 603 (2002)","DOI":"10.1023\/A:1021207331209"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-319-09330-7_49","volume-title":"Intelligent Computing in Bioinformatics","author":"B Niu","year":"2014","unstructured":"Niu, B., Bi, Y., Xie, T.: Structure-redesign-based bacterial foraging optimization for portfolio selection. In: Huang, D.-S., Han, K., Gromiha, M. (eds.) ICIC 2014. LNCS, vol. 8590, pp. 424\u2013430. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09330-7_49"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Niu, B., Yan, F., Pei, Z., Bing, X., Chai, Y.: A novel bacterial foraging optimizer with linear decreasing chemotaxis step. IEEE (2010)","DOI":"10.1109\/IWISA.2010.5473527"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Niu, B., Hong, W., Tan, L., Li, L.: Improved BFO with adaptive chemotaxis step for global optimization. In: Seventh International Conference on Computational Intelligence and Security, CIS 2011, Sanya, Hainan, China, 3\u20134 December 2011 (2012)","DOI":"10.1109\/CIS.2011.25"},{"issue":"4","key":"30_CR11","doi-asserted-by":"publisher","first-page":"1283","DOI":"10.1007\/s10489-018-1317-9","volume":"49","author":"B Pang","year":"2018","unstructured":"Pang, B., Song, Y., Zhang, C., Wang, H., Yang, R.: Bacterial foraging optimization based on improved chemotaxis process and novel swarming strategy. Appl. Intell. 49(4), 1283\u20131305 (2018). https:\/\/doi.org\/10.1007\/s10489-018-1317-9","journal-title":"Appl. Intell."},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Sahib, M.A., Abdulnabi, A.R., Mohammed, M.A.: Improving bacterial foraging algorithm using non-uniform elimination-dispersal probability distribution. AEJ Alex. Eng. J. 57,. 3341 (2018)","DOI":"10.1016\/j.aej.2017.12.010"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Sathya, P.D., Kayalvizhi, R.: Modified bacterial foraging algorithm based multilevel thresholding for image segmentation. Eng. Appl. Artif. Intell. 24,. 595 (2011)","DOI":"10.1016\/j.engappai.2010.12.001"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Tripathy, M., Mishra, S.: Bacteria foraging-based solution to optimize both real power loss and voltage stability limit. IEEE Trans. Power Syst. 22,. 240 (2007)","DOI":"10.1109\/TPWRS.2006.887968"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Wang, L., Zhao, W., Tian, Y., Pan, G.: A bare bones bacterial foraging optimization algorithm. Cogn. Syst. Res. 52(301) (2018)","DOI":"10.1016\/j.cogsys.2018.07.022"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Wedyan, A., Whalley, J., Narayanan, A.: Hydrological cycle algorithm for continuous optimization problems. J. Optim. 2017, 1 (2017)","DOI":"10.1155\/2017\/3828420"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Yang, X.S., Deb, S.: Cuckoo search via L\u00e9vy flights. In: 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC), vol. 210 (2009)","DOI":"10.1109\/NABIC.2009.5393690"}],"container-title":["Communications in Computer and Information Science","Data Mining and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-16-7502-7_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T01:19:51Z","timestamp":1726017591000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-16-7502-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9789811675010","9789811675027"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-7502-7_30","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DMBD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Data Mining and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dmbd2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/dmbd2021\/index.html","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":"258","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":"57","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":"28","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":"22% - 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":"2.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":"8","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)"}}]}}