Pub Date : 2024-08-07DOI: 10.1007/s10586-024-04644-8
Jinge Shi, Yi Chen, Zhennao Cai, Ali Asghar Heidari, Huiling Chen, Qiuxiang He
Medical imaging is essential in modern healthcare because it assists physicians in the diagnosis of cancer. Various tissues and features in medical imaging can be recognized using image segmentation algorithms. This feature makes it possible to pinpoint and define particular areas, which makes it easier to precisely locate and characterize anomalities or lesions for cancer diagnosis. Among cancers affecting women, breast cancer is particularly prevalent, underscoring the urgent need to improve the accuracy of image segmentation for breast cancer in order to assist medical practitioners. Multi-threshold image segmentation is widely acknowledged for its direct and effective characteristics. In this context, this paper suggests a refined whale optimization algorithm to improve the segmentation accuracy of breast cancer data. This algorithm optimizes performance by combining a quantum phase interference mechanism and an enhanced solution quality strategy. This work compares the method with classical, homogeneous, state-of-the-art algorithms and runs experiments on the IEEE CEC2017 benchmark to validate its practical optimization performance. Furthermore, a multi-threshold image segmentation algorithm-based image segmentation technique is presented in this study. The Berkeley segmentation dataset and the breast invasive ductal carcinomas segmentation dataset are segmented using the approach using a non-local means two-dimensional histogram and Renyi’s entropy. Experimental results demonstrate the excellent performance of this segmentation method in image segmentation applications across both low and high threshold levels. As a result, it emerges as a valuable image segmentation technique with practical applications.
{"title":"Multi-threshold image segmentation using a boosted whale optimization: case study of breast invasive ductal carcinomas","authors":"Jinge Shi, Yi Chen, Zhennao Cai, Ali Asghar Heidari, Huiling Chen, Qiuxiang He","doi":"10.1007/s10586-024-04644-8","DOIUrl":"https://doi.org/10.1007/s10586-024-04644-8","url":null,"abstract":"<p>Medical imaging is essential in modern healthcare because it assists physicians in the diagnosis of cancer. Various tissues and features in medical imaging can be recognized using image segmentation algorithms. This feature makes it possible to pinpoint and define particular areas, which makes it easier to precisely locate and characterize anomalities or lesions for cancer diagnosis. Among cancers affecting women, breast cancer is particularly prevalent, underscoring the urgent need to improve the accuracy of image segmentation for breast cancer in order to assist medical practitioners. Multi-threshold image segmentation is widely acknowledged for its direct and effective characteristics. In this context, this paper suggests a refined whale optimization algorithm to improve the segmentation accuracy of breast cancer data. This algorithm optimizes performance by combining a quantum phase interference mechanism and an enhanced solution quality strategy. This work compares the method with classical, homogeneous, state-of-the-art algorithms and runs experiments on the IEEE CEC2017 benchmark to validate its practical optimization performance. Furthermore, a multi-threshold image segmentation algorithm-based image segmentation technique is presented in this study. The Berkeley segmentation dataset and the breast invasive ductal carcinomas segmentation dataset are segmented using the approach using a non-local means two-dimensional histogram and Renyi’s entropy. Experimental results demonstrate the excellent performance of this segmentation method in image segmentation applications across both low and high threshold levels. As a result, it emerges as a valuable image segmentation technique with practical applications.</p>","PeriodicalId":501576,"journal":{"name":"Cluster Computing","volume":"86 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141934384","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-08-07DOI: 10.1007/s10586-024-04682-2
Sumit Sharma, Sarika Jain
Machine learning revolutionizes accuracy in diverse fields such as disease diagnosis, speech understanding, and sentiment analysis. However, its intricate architecture often obscures the decision-making process, creating a “black box” that hinders trust and limits its potential. This lack of transparency poses significant challenges, particularly in critical fields like the healthcare system. We present OntoXAI, a Semantic Web Rule Language (SWRL) based Explainable Artificial Intelligence (XAI) approach to address these challenges. OntoXAI leverages semantic technology and machine learning (ML) to enhance prediction accuracy and generate user-comprehensible natural language explanations in the context of dengue disease classification. OntoXAI can be summarized into three key aspects. (1) Creates a knowledge base that incorporates domain-specific knowledge related to the disease. This allows for the integration of expert knowledge into the classification process. (2) OntoXAI presents a diagnostic classification system that utilizes patient symptoms as input to classify the disease accurately. By leveraging ML algorithms, it achieves high accuracy in disease classification. (3) OntoXAI introduces SWRL and ontology to integrate explainable AI techniques with Open AI API, enabling a better understanding of the classification process. By combining the power of machine learning algorithms with the ability to provide transparent, human-understandable explanations through Open AI API, this approach offers several advantages in enhancing prediction accuracy, achieving levels of up to 96%. Overall, OntoXAI represents a significant advancement in the field of explainable AI, addressing the challenges of transparency and trust in machine learning systems, particularly in critical domains like healthcare.
机器学习彻底改变了疾病诊断、语音理解和情感分析等不同领域的准确性。然而,其复杂的架构往往掩盖了决策过程,形成了一个 "黑盒子",妨碍了信任并限制了其潜力。这种缺乏透明度的情况带来了巨大的挑战,尤其是在医疗保健系统等关键领域。我们提出了一种基于语义网规则语言(SWRL)的可解释人工智能(XAI)方法--OntoXAI,以应对这些挑战。OntoXAI利用语义技术和机器学习(ML)来提高预测的准确性,并在登革热疾病分类的背景下生成用户可理解的自然语言解释。OntoXAI 可归纳为三个关键方面。(1) 创建一个包含与疾病相关的特定领域知识的知识库。这样就能将专家知识整合到分类过程中。(2) OntoXAI 提出了一个诊断分类系统,利用患者症状作为输入,对疾病进行准确分类。通过利用 ML 算法,该系统实现了较高的疾病分类准确率。(3) OntoXAI 引入了 SWRL 和本体,将可解释的人工智能技术与开放式人工智能应用程序接口(Open AI API)相结合,使人们能够更好地理解分类过程。这种方法将机器学习算法的强大功能与通过开放式人工智能应用程序接口提供透明的、人类可理解的解释的能力相结合,在提高预测准确性方面具有多项优势,预测准确率高达 96%。总体而言,OntoXAI 代表了可解释人工智能领域的重大进步,解决了机器学习系统在透明度和信任度方面的挑战,尤其是在医疗保健等关键领域。
{"title":"OntoXAI: a semantic web rule language approach for explainable artificial intelligence","authors":"Sumit Sharma, Sarika Jain","doi":"10.1007/s10586-024-04682-2","DOIUrl":"https://doi.org/10.1007/s10586-024-04682-2","url":null,"abstract":"<p>Machine learning revolutionizes accuracy in diverse fields such as disease diagnosis, speech understanding, and sentiment analysis. However, its intricate architecture often obscures the decision-making process, creating a “black box” that hinders trust and limits its potential. This lack of transparency poses significant challenges, particularly in critical fields like the healthcare system. We present OntoXAI, a Semantic Web Rule Language (SWRL) based Explainable Artificial Intelligence (XAI) approach to address these challenges. OntoXAI leverages semantic technology and machine learning (ML) to enhance prediction accuracy and generate user-comprehensible natural language explanations in the context of dengue disease classification. OntoXAI can be summarized into three key aspects. (1) Creates a knowledge base that incorporates domain-specific knowledge related to the disease. This allows for the integration of expert knowledge into the classification process. (2) OntoXAI presents a diagnostic classification system that utilizes patient symptoms as input to classify the disease accurately. By leveraging ML algorithms, it achieves high accuracy in disease classification. (3) OntoXAI introduces SWRL and ontology to integrate explainable AI techniques with Open AI API, enabling a better understanding of the classification process. By combining the power of machine learning algorithms with the ability to provide transparent, human-understandable explanations through Open AI API, this approach offers several advantages in enhancing prediction accuracy, achieving levels of up to 96%. Overall, OntoXAI represents a significant advancement in the field of explainable AI, addressing the challenges of transparency and trust in machine learning systems, particularly in critical domains like healthcare.</p>","PeriodicalId":501576,"journal":{"name":"Cluster Computing","volume":"193 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141934383","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-08-06DOI: 10.1007/s10586-024-04673-3
Arpita Srivastava, Ditipriya Sinha
Features within the dataset carry a significant role; however, resource utilization, prediction-time, and model weight are increased by utilizing high-dimensional data in intrusion-detection paradigm. This paper aims to design a novel lightweight intrusion detection system in two phases utilizing a swarm intelligence-based technique. In 1st-phase, essential features are selected using particle swarm optimization algorithm by considering imbalanced dataset. Ant colony optimization algorithm is utilized in 2nd-phase for extracting information-rich and uncorrelated features. Additionally, genetic algorithm is employed for fine-tuning each detection model. Proposed model’s performance is evaluated on different base and ensemble classifiers, and it is observed that xgboost achieves best accuracy with 90.38%, 92.63%, and 97.87% on NSL-KDD, UNSW-NB15, and CSE-CIC-IDS2018 datasets, respectively. The proposed model also outperforms other traditional dimensionality reduction and state-of-the-art approaches with statistical validation. This paper also analyses objective function of each metaheuristic algorithm used in this paper, applying convergence graphs, box, and swarm plots.
{"title":"PSO-ACO-based bi-phase lightweight intrusion detection system combined with GA optimized ensemble classifiers","authors":"Arpita Srivastava, Ditipriya Sinha","doi":"10.1007/s10586-024-04673-3","DOIUrl":"https://doi.org/10.1007/s10586-024-04673-3","url":null,"abstract":"<p>Features within the dataset carry a significant role; however, resource utilization, prediction-time, and model weight are increased by utilizing high-dimensional data in intrusion-detection paradigm. This paper aims to design a novel lightweight intrusion detection system in two phases utilizing a swarm intelligence-based technique. In 1st-phase, essential features are selected using particle swarm optimization algorithm by considering imbalanced dataset. Ant colony optimization algorithm is utilized in 2nd-phase for extracting information-rich and uncorrelated features. Additionally, genetic algorithm is employed for fine-tuning each detection model. Proposed model’s performance is evaluated on different base and ensemble classifiers, and it is observed that xgboost achieves best accuracy with 90.38%, 92.63%, and 97.87% on NSL-KDD, UNSW-NB15, and CSE-CIC-IDS2018 datasets, respectively. The proposed model also outperforms other traditional dimensionality reduction and state-of-the-art approaches with statistical validation. This paper also analyses objective function of each metaheuristic algorithm used in this paper, applying convergence graphs, box, and swarm plots.</p>","PeriodicalId":501576,"journal":{"name":"Cluster Computing","volume":"38 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141934382","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-08-03DOI: 10.1007/s10586-024-04681-3
Narender Reddy Kampelli, B. N. Bhandari
Machine Type Communication Devices for Machine-to-Machine (M2M) communication in 5G cellular networks have issues with scalability, quality of service (QoS), collisions, and delays in data transmission. M2M connectivity has become prevalent in the Internet of Things. The suggested MAC protocol for M2M communication using adaptive TDMA was designed to be scalable and power-efficient. To address the problems of collision, quality of service and scalability in M2M communication by presenting a Power-efficient MAC switching protocol with Adaptive Time Division Multiple Access (PMAC-ATDMA). There are three phases to this: grouping, dynamic MAC switching, and time slot allocation. Optimization Technique: The usage of the adaptive k-means algorithm with the HHO method for selecting MTC heads based on their power status and proximity to enhance network efficiency and reduce collision. Hybrid MAC Protocol Design: A dynamic switching mechanism between CSMA/CA and Carrier Sense Multiple Access/Collision Avoidance Reservation Protocol (CSMA/CARP) based on network density and device activity, aiming to optimize collision handling and energy consumption. ATDMA assigns time slots that are used for data transmission based on the size of the data and QoS requirements. Traditional TDMA’s synchronization issue is solved by using the Markov chain model; this PMAC-ATDMA is simulated using a network simulator tool. Access delay, energy, collision likelihood, and successful packet transmissions are all taken into account throughout the evaluation process.
5G 蜂窝网络中用于机器对机器(M2M)通信的机器型通信设备存在可扩展性、服务质量(QoS)、碰撞和数据传输延迟等问题。M2M 连接在物联网中已变得十分普遍。建议使用自适应 TDMA 的 M2M 通信 MAC 协议旨在实现可扩展性和高能效。为了解决 M2M 通信中的碰撞、服务质量和可扩展性问题,提出了一种具有自适应时分多址(PMAC-ATDMA)的高能效 MAC 交换协议。该协议分为三个阶段:分组、动态 MAC 切换和时隙分配。优化技术:使用自适应 k-means 算法和 HHO 方法,根据功率状态和邻近程度选择 MTC 头,以提高网络效率并减少碰撞。混合 MAC 协议设计:根据网络密度和设备活动,在 CSMA/CA 和载波侦测多路访问/避免碰撞保留协议(CSMA/CARP)之间建立动态切换机制,旨在优化碰撞处理和能耗。ATDMA 根据数据大小和 QoS 要求分配用于数据传输的时隙。传统 TDMA 的同步问题通过使用马尔科夫链模型来解决;而 PMAC-ATDMA 则使用网络模拟工具进行模拟。在整个评估过程中,访问延迟、能量、碰撞可能性和数据包传输成功率都被考虑在内。
{"title":"A scalable and power efficient MAC protocol with adaptive TDMA for M2M communication","authors":"Narender Reddy Kampelli, B. N. Bhandari","doi":"10.1007/s10586-024-04681-3","DOIUrl":"https://doi.org/10.1007/s10586-024-04681-3","url":null,"abstract":"<p>Machine Type Communication Devices for Machine-to-Machine (M2M) communication in 5G cellular networks have issues with scalability, quality of service (QoS), collisions, and delays in data transmission. M2M connectivity has become prevalent in the Internet of Things. The suggested MAC protocol for M2M communication using adaptive TDMA was designed to be scalable and power-efficient. To address the problems of collision, quality of service and scalability in M2M communication by presenting a Power-efficient MAC switching protocol with Adaptive Time Division Multiple Access (PMAC-ATDMA). There are three phases to this: grouping, dynamic MAC switching, and time slot allocation. Optimization Technique: The usage of the adaptive k-means algorithm with the HHO method for selecting MTC heads based on their power status and proximity to enhance network efficiency and reduce collision. Hybrid MAC Protocol Design: A dynamic switching mechanism between CSMA/CA and Carrier Sense Multiple Access/Collision Avoidance Reservation Protocol (CSMA/CARP) based on network density and device activity, aiming to optimize collision handling and energy consumption. ATDMA assigns time slots that are used for data transmission based on the size of the data and QoS requirements. Traditional TDMA’s synchronization issue is solved by using the Markov chain model; this PMAC-ATDMA is simulated using a network simulator tool. Access delay, energy, collision likelihood, and successful packet transmissions are all taken into account throughout the evaluation process.</p>","PeriodicalId":501576,"journal":{"name":"Cluster Computing","volume":"41 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141934385","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-08-01DOI: 10.1007/s10586-024-04668-0
Mohamed A. Elseify, Salah Kamel, Loai Nasrat
Deploying distributed generators (DGs) powered by renewable energy poses a significant challenge for effective power system operation. Optimally scheduling DGs, especially photovoltaic (PV) systems and wind turbines (WTs), is critical because of the unpredictable nature of wind speed and solar radiation. These intermittencies have posed considerable challenges to power grids, including power oscillation, increased losses, and voltage instability. To overcome these challenges, the battery energy storage (BES) system supports the PV unit, while the biomass aids the WT unit, mitigating power fluctuations and boosting supply continuity. Therefore, the main innovation of this study is presenting an improved moth flame optimization algorithm (IMFO) to capture the optimal scheduling of multiple dispatchable and non-dispatchable DGs for mitigating energy loss in power grids, considering different dynamic load characteristics. The IMFO algorithm comprises a new update position expression based on a roulette wheel selection strategy as well as Gaussian barebones (GB) and quasi-opposite-based learning (QOBL) mechanisms to enhance exploitation capability, global convergence rate, and solution precision. The IMFO algorithm's success rate and effectiveness are evaluated using 23rd benchmark functions and compared with the basic MFO algorithm and other seven competitors using rigorous statistical analysis. The developed optimizer is then adopted to study the performance of the 69-bus and 118-bus distribution grids, considering deterministic and stochastic DG's optimal planning. The findings reflect the superiority of the developed algorithm against its rivals, emphasizing the influence of load types and varying generations in DG planning. Numerically, the optimal deployment of BES + PV and biomass + WT significantly maximizes the energy loss reduction percent to 68.3471 and 98.0449 for the 69-bus's commercial load type and to 54.833 and 52.0623 for the 118-bus's commercial load type, respectively, confirming the efficacy of the developed algorithm for maximizing the performance of distribution systems in diverse situations.
{"title":"An improved moth flame optimization for optimal DG and battery energy storage allocation in distribution systems","authors":"Mohamed A. Elseify, Salah Kamel, Loai Nasrat","doi":"10.1007/s10586-024-04668-0","DOIUrl":"https://doi.org/10.1007/s10586-024-04668-0","url":null,"abstract":"<p>Deploying distributed generators (DGs) powered by renewable energy poses a significant challenge for effective power system operation. Optimally scheduling DGs, especially photovoltaic (PV) systems and wind turbines (WTs), is critical because of the unpredictable nature of wind speed and solar radiation. These intermittencies have posed considerable challenges to power grids, including power oscillation, increased losses, and voltage instability. To overcome these challenges, the battery energy storage (BES) system supports the PV unit, while the biomass aids the WT unit, mitigating power fluctuations and boosting supply continuity. Therefore, the main innovation of this study is presenting an improved moth flame optimization algorithm (IMFO) to capture the optimal scheduling of multiple dispatchable and non-dispatchable DGs for mitigating energy loss in power grids, considering different dynamic load characteristics. The IMFO algorithm comprises a new update position expression based on a roulette wheel selection strategy as well as Gaussian barebones (GB) and quasi-opposite-based learning (QOBL) mechanisms to enhance exploitation capability, global convergence rate, and solution precision. The IMFO algorithm's success rate and effectiveness are evaluated using 23rd benchmark functions and compared with the basic MFO algorithm and other seven competitors using rigorous statistical analysis. The developed optimizer is then adopted to study the performance of the 69-bus and 118-bus distribution grids, considering deterministic and stochastic DG's optimal planning. The findings reflect the superiority of the developed algorithm against its rivals, emphasizing the influence of load types and varying generations in DG planning. Numerically, the optimal deployment of BES + PV and biomass + WT significantly maximizes the energy loss reduction percent to 68.3471 and 98.0449 for the 69-bus's commercial load type and to 54.833 and 52.0623 for the 118-bus's commercial load type, respectively, confirming the efficacy of the developed algorithm for maximizing the performance of distribution systems in diverse situations.</p>","PeriodicalId":501576,"journal":{"name":"Cluster Computing","volume":"51 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141868480","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-08-01DOI: 10.1007/s10586-024-04601-5
Essam H. Houssein, Gaber M. Mohamed, Youcef Djenouri, Yaser M. Wazery, Ibrahim A. Ibrahim
Image segmentation is the process of splitting a digital image into distinct segments or categories based on shared characteristics like texture, color, and intensity. Its primary aim is to simplify the image for easier analysis while preserving its important features. Each pixel in the image is assigned a label, grouped together by pixels with similar traits together. Segmentation helps to delineate boundaries and identify objects such as curves or lines within the image. The process generates a series of segmented images that cover the entire original image. This article reviews emerging applications of image segmentation in medical diagnostics, specifically employing nature-inspired optimization algorithms (NIOAs). It begins by outlining different segmentation methods and NIOAs types, then by examining relevant databases and medical imaging technologies. The study draws on a diverse range of research sources. Finally, this paper briefly discusses the challenges and future trends of medical image segmentation using NIOAs to detect different diseases.
{"title":"Nature inspired optimization algorithms for medical image segmentation: a comprehensive review","authors":"Essam H. Houssein, Gaber M. Mohamed, Youcef Djenouri, Yaser M. Wazery, Ibrahim A. Ibrahim","doi":"10.1007/s10586-024-04601-5","DOIUrl":"https://doi.org/10.1007/s10586-024-04601-5","url":null,"abstract":"<p>Image segmentation is the process of splitting a digital image into distinct segments or categories based on shared characteristics like texture, color, and intensity. Its primary aim is to simplify the image for easier analysis while preserving its important features. Each pixel in the image is assigned a label, grouped together by pixels with similar traits together. Segmentation helps to delineate boundaries and identify objects such as curves or lines within the image. The process generates a series of segmented images that cover the entire original image. This article reviews emerging applications of image segmentation in medical diagnostics, specifically employing nature-inspired optimization algorithms (NIOAs). It begins by outlining different segmentation methods and NIOAs types, then by examining relevant databases and medical imaging technologies. The study draws on a diverse range of research sources. Finally, this paper briefly discusses the challenges and future trends of medical image segmentation using NIOAs to detect different diseases.</p>","PeriodicalId":501576,"journal":{"name":"Cluster Computing","volume":"87 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141868624","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-30DOI: 10.1007/s10586-024-04666-2
Mengjian Zhang, Guihua Wen, Pei Yang
To address the real-world constrained engineering optimization problem (CEOP) and the breast cancer classification task using a high-performance heuristic approach, a novel Chaos balanced butterfly optimizer, named Chaos-BBO, was proposed with chaos regulation strategies for the smell dynamic parameter (C_1) and balance dynamic parameter (C_2). The basic BBO algorithm was inspired by the smell and light perception of the special butterfly. Notably, this article collected twelve continuum chaotic mappings with one-dimensional, which has some differences from the common ten chaos mappings. we collected twelve continuum chaotic mapping functions to expand their application scope in the swarm intelligent (SI) algorithm, and their chaotic properties were also depicted in detail. Twenty-three CEC and nine CEC2022 benchmark functions were applied to evaluate the performance of the designed Chaos-BBO, which was compared to FA, GWO algorithm, BOA, HHO algorithm, SMA, JS algorithm, AO algorithm, AHA, and HBA expert for the basic BBO algorithm. Then, Friedman rank and Wilcoxon rank-sum (WRS) tests were utilized to analyze the statistical properties and rankings of the comparison methods. Finally, the proposed Chaos-BBO was utilized to address eight CEOPs and the breast cancer classification task. The results of the numerical optimization and application tasks demonstrated the superiority of the designed Chaos-BBO approach.
为了使用高性能启发式方法解决现实世界中的受限工程优化问题(CEOP)和乳腺癌分类任务,提出了一种名为Chaos-BBO的新型混沌平衡蝶优化算法,该算法对气味动态参数(C_1)和平衡动态参数(C_2)采用混沌调节策略。BBO基本算法的灵感来源于特殊蝴蝶的嗅觉和光感。值得注意的是,本文收集了十二种一维连续混沌映射,与常见的十种混沌映射有一定区别。我们收集了十二种连续混沌映射函数,以扩大它们在蜂群智能(SI)算法中的应用范围,并详细描绘了它们的混沌特性。应用23个CEC和9个CEC2022基准函数评估了所设计的Chaos-BBO的性能,并与基本BBO算法的FA、GWO算法、BOA、HHO算法、SMA、JS算法、AO算法、AHA和HBA专家进行了比较。然后,利用弗里德曼秩和检验(Friedman rank and Wilcoxon rank-sum (WRS))分析比较方法的统计特性和排名。最后,利用所提出的混沌-BBO算法处理了八个CEOPs和乳腺癌分类任务。数值优化和应用任务的结果证明了所设计的混沌-BBO方法的优越性。
{"title":"Chaos-BBO: Chaos balanced butterfly optimizer with dynamic continuum chaotic strategies and its applications","authors":"Mengjian Zhang, Guihua Wen, Pei Yang","doi":"10.1007/s10586-024-04666-2","DOIUrl":"https://doi.org/10.1007/s10586-024-04666-2","url":null,"abstract":"<p>To address the real-world constrained engineering optimization problem (CEOP) and the breast cancer classification task using a high-performance heuristic approach, a novel Chaos balanced butterfly optimizer, named Chaos-BBO, was proposed with chaos regulation strategies for the smell dynamic parameter <span>(C_1)</span> and balance dynamic parameter <span>(C_2)</span>. The basic BBO algorithm was inspired by the smell and light perception of the special butterfly. Notably, this article collected twelve continuum chaotic mappings with one-dimensional, which has some differences from the common ten chaos mappings. we collected twelve continuum chaotic mapping functions to expand their application scope in the swarm intelligent (SI) algorithm, and their chaotic properties were also depicted in detail. Twenty-three CEC and nine CEC2022 benchmark functions were applied to evaluate the performance of the designed Chaos-BBO, which was compared to FA, GWO algorithm, BOA, HHO algorithm, SMA, JS algorithm, AO algorithm, AHA, and HBA expert for the basic BBO algorithm. Then, Friedman rank and Wilcoxon rank-sum (WRS) tests were utilized to analyze the statistical properties and rankings of the comparison methods. Finally, the proposed Chaos-BBO was utilized to address eight CEOPs and the breast cancer classification task. The results of the numerical optimization and application tasks demonstrated the superiority of the designed Chaos-BBO approach.</p>","PeriodicalId":501576,"journal":{"name":"Cluster Computing","volume":"109 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141868483","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-30DOI: 10.1007/s10586-024-04650-w
Mazahir Hussain, Buseung Cho
Network telemetry plays a pivotal role in understanding and optimizing underlying network infrastructures by facilitating essential operations like troubleshooting and traffic load balancing. However, real-time processing of network packets, especially at speeds of 100 Gbps or more, presents significant challenges due to the uncoordinated processing performance between kernel and user-space applications. This study introduces high-performance telemetry collector (HPTCollector) aims at harmonizing the processing activities of kernel and user-space applications, thereby enhancing the performance of network telemetry systems. HPTCollector demonstrates exceptional adaptability and efficiency, achieving remarkable throughput rates. Specifically, our mechanism can process up to 31 million packets per second using just 12 CPU cores in user-space, an achievement made possible through parallel packet processing techniques. This capability ensures robust support for network telemetry processing at collector for network infrastructures with bandwidth of 350 Gbps and 2.03 Tbps, MTU size of 1500 and 9000 respectively. This breakthrough not only showcases the potential of our proposed mechanism but also sets a new benchmark in network telemetry collector performance.
{"title":"HPTCollector: high-performance telemetry collector","authors":"Mazahir Hussain, Buseung Cho","doi":"10.1007/s10586-024-04650-w","DOIUrl":"https://doi.org/10.1007/s10586-024-04650-w","url":null,"abstract":"<p>Network telemetry plays a pivotal role in understanding and optimizing underlying network infrastructures by facilitating essential operations like troubleshooting and traffic load balancing. However, real-time processing of network packets, especially at speeds of 100 Gbps or more, presents significant challenges due to the uncoordinated processing performance between kernel and user-space applications. This study introduces high-performance telemetry collector (HPTCollector) aims at harmonizing the processing activities of kernel and user-space applications, thereby enhancing the performance of network telemetry systems. HPTCollector demonstrates exceptional adaptability and efficiency, achieving remarkable throughput rates. Specifically, our mechanism can process up to 31 million packets per second using just 12 CPU cores in user-space, an achievement made possible through parallel packet processing techniques. This capability ensures robust support for network telemetry processing at collector for network infrastructures with bandwidth of 350 Gbps and 2.03 Tbps, MTU size of 1500 and 9000 respectively. This breakthrough not only showcases the potential of our proposed mechanism but also sets a new benchmark in network telemetry collector performance.</p>","PeriodicalId":501576,"journal":{"name":"Cluster Computing","volume":"349 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141868623","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-29DOI: 10.1007/s10586-024-04680-4
Xinyi Chen, Mengjian Zhang, Ming Yang, Deguang Wang
Beluga whale optimization (BWO) has received widespread attention in scientific and engineering domains. However, BWO suffers from limited adaptability, weak anti-stagnation, and poor exploration capability. Consequently, this study proposes an enhanced variant of BWO called multi-strategy improved beluga whale optimization (MIBWO). First, an improved ICMIC chaotic map is introduced to enhance exploration capability and optimization accuracy. Then, a dynamic parameter nonlinear adjustment strategy is integrated to achieve a better balance between exploration and exploitation. Finally, opposition learning based on the lens imaging principle is designed to strengthen anti-stagnation capability. An ablation experiment is performed to evaluate the impact of each strategy on the optimization capability of BWO. The experimental results demonstrate the significant enhancement in the performance of BWO owing to the used strategies. To further validate the performance of MIBWO, it is benchmarked against six state-of-the-art optimization algorithms using functions from CEC2005, CEC2014, and CEC2022. Statistical tests, including Friedman rank test and Wilcoxon rank-sum test, are performed. The experimental results show the superiority of MIBWO. Finally, MIBWO is applied to optimize 2D and 3D node coverage in wireless sensor networks and solve six constrained engineering problems. The experimental results indicate that MIBWO outperforms other competitors for practical engineering applications in terms of solution quality and convergence speed.
{"title":"A multi-strategy improved beluga whale optimization algorithm for constrained engineering problems","authors":"Xinyi Chen, Mengjian Zhang, Ming Yang, Deguang Wang","doi":"10.1007/s10586-024-04680-4","DOIUrl":"https://doi.org/10.1007/s10586-024-04680-4","url":null,"abstract":"<p>Beluga whale optimization (BWO) has received widespread attention in scientific and engineering domains. However, BWO suffers from limited adaptability, weak anti-stagnation, and poor exploration capability. Consequently, this study proposes an enhanced variant of BWO called multi-strategy improved beluga whale optimization (MIBWO). First, an improved ICMIC chaotic map is introduced to enhance exploration capability and optimization accuracy. Then, a dynamic parameter nonlinear adjustment strategy is integrated to achieve a better balance between exploration and exploitation. Finally, opposition learning based on the lens imaging principle is designed to strengthen anti-stagnation capability. An ablation experiment is performed to evaluate the impact of each strategy on the optimization capability of BWO. The experimental results demonstrate the significant enhancement in the performance of BWO owing to the used strategies. To further validate the performance of MIBWO, it is benchmarked against six state-of-the-art optimization algorithms using functions from CEC2005, CEC2014, and CEC2022. Statistical tests, including Friedman rank test and Wilcoxon rank-sum test, are performed. The experimental results show the superiority of MIBWO. Finally, MIBWO is applied to optimize 2D and 3D node coverage in wireless sensor networks and solve six constrained engineering problems. The experimental results indicate that MIBWO outperforms other competitors for practical engineering applications in terms of solution quality and convergence speed.</p>","PeriodicalId":501576,"journal":{"name":"Cluster Computing","volume":"152 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141868484","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}