<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Detection of Heart Failure Using Swarm Intelligence</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author role="corresp">
							<persName><forename type="first">Arunima</forename><surname>Jaiswal</surname></persName>
							<email>arunimajaiswal@igdtuw.ac.in</email>
							<affiliation key="aff0">
								<orgName type="department">Computer Science &amp; Engineering Department</orgName>
								<orgName type="institution">Indira Gandhi Delhi Technical University for Women</orgName>
								<address>
									<settlement>Delhi</settlement>
									<country key="IN">India</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Amritaya</forename><surname>Ray</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Computer Science &amp; Engineering Department</orgName>
								<orgName type="institution">Indira Gandhi Delhi Technical University for Women</orgName>
								<address>
									<settlement>Delhi</settlement>
									<country key="IN">India</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Swati</forename><surname>Gola</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">Computer Science &amp; Engineering Department</orgName>
								<orgName type="institution">Indira Gandhi Delhi Technical University for Women</orgName>
								<address>
									<settlement>Delhi</settlement>
									<country key="IN">India</country>
								</address>
							</affiliation>
						</author>
						<author>
							<affiliation key="aff1">
								<orgName type="department">Symposium on Computing &amp; Intelligent Systems (SCI)</orgName>
								<address>
									<addrLine>May 10</addrLine>
									<postCode>2024</postCode>
									<region>New Delhi</region>
									<country key="IN">INDIA</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Detection of Heart Failure Using Swarm Intelligence</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">6843331EF6D01CCE1E6F99723F18496B</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T19:39+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>Heart Disease, Deep Learning, Swarm Intelligence, Feature Selection, Hyperparameter Tuning, Sparrow Search Algorithm, Long Short-Term Memory, Bidirectional Long Short-Term Memory, Gated Recurrent Unit, Mealpy, Tensorflow S. Gola) 0000-0002-4530-9904 (J.Sarda)</term>
					<term>0000-0003-2759-3224 (A.Bhoi)</term>
					<term>0000-0002-6376-8346(D. Garg)</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Heart disease remains a significant health concern globally. In this study, we propose an innovative approach by combining the Sparrow Search Algorithm (SSA) with deep learning techniques, including Long Short-Term Memory (LSTM), Bidirectional LSTM (BI-LSTM), and Gated Recurrent Unit (GRU) networks. The UCI Cleveland Heart Disease dataset is utilized for evaluating the performance of the suggested hybrid algorithms. We can reach an accuracy up to 97.86% with BI-LSTM. The results indicate promising outcomes in terms of accuracy and computational efficiency. This convergence of swarm intelligence and healthcare has the potential to transform medical care, cut costs, and save lives, presenting a significant advancement in predictive medicine.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>Heart failure is a very significant public medical concern globally, posing substantial challenges to healthcare systems due to its high prevalence, mortality rates, and associated healthcare costs. Early and accurate prediction of heart failure is crucial for effective patient management, timely interventions, and improved clinical outcomes. In recent years, the integration of advanced machine learning techniques with healthcare data has shown promising results in enhancing predictive models for heart failure prognosis. <ref type="bibr" target="#b0">[1]</ref> This research paper explores the application of Sparrow Search Algorithm (SSA), a novel metaheuristic optimization algorithm which is inspired by the sparrows' behavioral foraging nature <ref type="bibr" target="#b1">[2]</ref>, combined with three deep learning (DL) techniques, namely Long Short-Term Memory (LSTM), Bidirectional-LSTM (Bi-LSTM) and Gated Recurrent Unit (GRU) for heart failure prediction. The chief objective of this comparative research is to investigate the efficiency of SSA in optimizing DL models to accurately predict heart failure risk.</p><p>Heart failure is a very significant public medical concern globally, posing substantial challenges to healthcare systems due to its high prevalence, mortality rates, and associated healthcare costs. Early and accurate prediction of heart failure is crucial for effective patient management, timely interventions, and improved clinical outcomes. In recent years, the integration of advanced machine learning techniques with healthcare data has shown promising results in enhancing predictive models for heart failure prognosis. <ref type="bibr" target="#b0">[1]</ref> This research paper explores the application of Sparrow Search Algorithm (SSA), a novel metaheuristic optimization algorithm which is inspired by the sparrows' behavioral foraging nature <ref type="bibr" target="#b1">[2]</ref>, combined with three deep learning (DL) techniques, namely Long Short-Term Memory (LSTM), Bidirectional-LSTM (Bi-LSTM) and Gated Recurrent Unit (GRU) for heart failure prediction. The chief objective of this comparative research is to investigate the efficiency of SSA in optimizing DL models to accurately predict heart failure risk.</p><p>The motive of this research is to develop robust and reliable predictive models that leverage both the optimization capabilities of SSA and the representational power of DL techniques to enhance heart failure prediction accuracy. By leveraging large-scale healthcare datasets, this study is targeted to enhance the advancement of predictive analytics in healthcare, facilitating early identification of individuals at risk of heart failure and enabling proactive intervention strategies to mitigate adverse health outcomes.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Dataset Description</head><p>The UCI Cleveland Heart Disease dataset is a widely used dataset for heart disease prediction and classification. It contains 1025 instances and 14 attributes, including both categorical and continuous variables. Some of the dataset attributes are Sex, Age, Fasting Blood Sugar, Serum Cholesterol(chol), Chest Pain Type (CP) and many others. <ref type="bibr" target="#b2">[3]</ref> This dataset is of great utility in creating and validating models for forecasting the probability of heart disease, relying on a patient's characteristics. It has been widely employed in healthcare-focused projects involving machine learning and data analysis.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Literature Review</head><p>The proposed Swarm-ANN strategy, developed by Sudarshan Nandy, introduces an innovative approach to cardiovascular disease prediction by leveraging swarm intelligence for neural network optimization. The strategy involves the random generation of Neural Networks, multiple stages of weight changes, and a heuristic formulation for weight adjustment. While achieving an impressive accuracy of 95.78% on a benchmark dataset, the research may be limited in its generalizability due to the focus on specific dataset characteristics and predefined parameter ranges for learning rates and population sizes. This could pose a risk of overfitting to the peculiarities of the chosen dataset, raising questions about the strategy's adaptability to diverse datasets and real-world scenarios. <ref type="bibr" target="#b3">[4]</ref> The presented MLP-PSO Hybrid Algorithm, introduced by Ali Al Bataineh and Sarah Manacek, contributes significantly to healthcare by leveraging machine learning for enhanced heart disease prediction. The study acknowledges the challenge of developing heart disease due to multiple underlying factors. Utilizing the Cleveland Heart Disease dataset, the suggested MLP-PSO hybrid algorithm demonstrates superiority over 10 different ML algorithms, achieving a notable accuracy of 84.61%. However, the research does not explicitly address potential limitations, leaving room for further exploration into the algorithm's scalability, robustness, and performance across varied datasets and clinical settings. <ref type="bibr" target="#b4">[5]</ref> The methodology proposed by Shahrokh Asadi, merging multiple objective particle swarm optimization (MOPSO) as well as Random Forest for the prediction of heart disease, addresses the challenges associated with traditional diagnostic methods. The fusion of evolutionary multi-objective optimization and Random Forest aims to produce diverse and accurate decision trees simultaneously, demonstrating promising results with an accuracy of 88.26% on the Statlog dataset. Comparative analyses across six heart datasets showcase the superiority of the proposed method, emphasizing its potential to outperform conventional Random Forest algorithms with different classifiers. Nevertheless, potential loopholes may include a lack of in-depth analysis of algorithmic complexities and scalability concerns across different datasets. Addressing these aspects could further validate the proposed methodology's effectiveness and reliability in diverse clinical applications. <ref type="bibr" target="#b5">[6]</ref> The newly proposed heart disease prediction model, QPSO-SVM, by E. I. Elsedimy, Sara M. M. AboHashish, and Fahad Algarni, showcases innovation through the integration of quantum-behaved particle swarm optimization (QPSO) and support vector machine (SVM). While achieving a remarkable accuracy of 96.31% on the Cleveland heart dataset, potential loopholes may include the need for comprehensive exploration of QPSO-SVM's computational efficiency and scalability, especially when applied to larger datasets or in resource-constrained environments. Further investigation into these aspects can enhance the model's applicability and robustness. <ref type="bibr" target="#b6">[7]</ref> The Deep Edge Intelligence-based solution by Hossain and Tabassum employs the OQFFN algorithm on a Raspberry Pi, ensuring real-time heart failure predictions in IoT-based healthcare. The approach enhances reliability without constant network stability, making it unique in comparison to cloud-based services. Evaluation shows OQFFN's superior accuracy and efficiency at the edge, with potential applications in Ambient Assisted Living. Despite success, limitations in edge processing for complex algorithms are acknowledged, highlighting the need for future developments in distributed prediction models. The research significantly contributes to enhancing IoT-based healthcare systems. <ref type="bibr" target="#b7">[8]</ref> </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Methodology</head><p>Our principal methodology of implementation is outlined as follows: Explore Python Packages for Genetic and Evolutionary Algorithms: The research began by exploring various Python packages for genetic algorithms (GAs) and evolutionary algorithms (EAs), such as DEAP, PyGAD, and Genetic Algorithm Python. Further evaluation involved assessing each package based on factors like functionality, ease of use, documentation, and community support.</p><p>Implement Mealpy Package in Python: We implemented the Sparrow Search Algorithm (SSA) from the Mealpy package, to aid in feature selection. It was done by implementing genetic, swarm-based and evolutionary patterns followed by sparrows moving in a swarm using Python capability for optimization tasks.</p><p>Feature Selection Using Sparrow Search Algorithm: We studied the SSA algorithm and its associated mathematical formulae to change the bias, weight and threshold values applied in the code so that it provides optimal feature selection for our dataset.</p><p>Apply DL models like LSTM, Bi-LSTM, and GRU: We chose the deep learning (DL) models, LSTM, BiLSTM, and GRU, based on the nature of our data and task requirements. Implemented these models using TensorFlow and PyTorch in Python. We also used libraries like Keras for easier implementation. Further data preprocessing was done, including normalization and sequence padding. We then trained each DL using hyperparameters that were fine-tuned using SSA for optimized performance.</p><p>Compare the Results: We compared the results by assessing the performance metrics. We visualized the results using plots to present comparisons between different models and algorithms. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1">Data Preprocessing</head><p>In the pursuit of optimal performance and robustness in deep learning models, meticulous attention to data preprocessing methodologies is imperative. Data preprocessing serves as a critical precursor to model training, facilitating enhanced model generalization and efficacy by mitigating the deleterious effects of noise, imbalance, and irregularities inherent in raw data. Preprocessing steps commonly entail data normalization to standardize feature scales, imputation techniques for handling missing values, and encoding categorical variables to numerical representations. Additionally, feature selection or extraction techniques may be applied to reduce dimensionality and enhance model interpretability. In the context of our investigation, comprehensive data preprocessing procedures were meticulously executed, including outlier detection and removal to attenuate the influence of aberrant data points, and stratified sampling to alleviate class imbalance concerns. Subsequently, the preprocessed data were subjected to rigorous cross-validation to ascertain model performance and generalization capabilities. These meticulous preprocessing endeavors culminated in superior model performance metrics and bolstered the veracity of our findings.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.2">SSA in Feature Selection</head><p>In the context of feature selection, the Sparrow Search Algorithm (SSA) incorporates mathematical formulations that enable the optimization of feature subsets based on objective functions designed to evaluate their relevance and discriminative power. SSA employs mathematical expressions to model the movement of individual sparrows within the feature space, with each sparrow representing a potential feature subset. The algorithm utilizes mathematical operators such as random walks, levy flights, and local search mechanisms to explore and exploit the solution space efficiently. Furthermore, SSA employs fitness functions that quantitatively assess the quality of feature subsets based on criteria such as classification accuracy, information gain, or other relevant metrics. These fitness functions guide the optimization process by assigning higher scores to feature subsets that contribute positively to the performance of the machine learning model. <ref type="bibr" target="#b9">[10]</ref>[11]</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.3">SSA in Hyperparameter Tuning</head><p>In the realm of hyperparameter tuning, the Sparrow Search Algorithm (SSA) offers a versatile and efficient approach to optimize the configuration settings of machine learning models. SSA operates by iteratively exploring the hyperparameter space, represented by individual sparrows, and updating their positions based on fitness evaluations. In the context of hyperparameter tuning, SSA dynamically adjusts hyperparameter values to maximize model performance on a validation dataset. This involves formulating an objective function that quantifies the model's performance based on chosen evaluation metrics such as accuracy, loss, or cross-validation scores. SSA optimizes hyperparameters by iteratively evaluating different configurations, seeking to minimize the objective function. Through a combination of exploration and exploitation, SSA efficiently searches for optimal hyperparameter settings, adapting its search strategy based on the observed performance of candidate solutions. By leveraging SSA for hyperparameter tuning, researchers can automate the process of optimizing model configurations, thereby improving model performance, generalization capabilities, and computational efficiency. <ref type="bibr" target="#b11">[12]</ref> </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.4">Sparrow Search Algorithm</head><p>The Sparrow Search Algorithm (SSA) is a recently introduced metaheuristic optimization algorithm inspired by the cumulative foraging behavior of sparrows in searching for food. It is categorized with a family of swarm intelligence algorithms, which mirror the social behavior of organisms to solve complex optimization problems. SSA operates based on the concept of exploration and exploitation, where individual sparrows in the population search for optimal solutions through a combination of random exploration and local exploitation of promising regions in the search space. <ref type="bibr" target="#b12">[13]</ref> From a research perspective, the Sparrow Search Algorithm offers several notable characteristics that make it appealing for solving optimization problems. Firstly, SSA exhibits strong global search capabilities, allowing it to efficiently explore the solution space and locate potential optima across a wide range of problem domains. This attribute is particularly advantageous for addressing highdimensional and non-convex optimization problems commonly encountered in various scientific and engineering fields. <ref type="bibr" target="#b13">[14]</ref> Secondly, SSA incorporates adaptive mechanisms to dynamically adjust its search behavior based on the efficacy of solutions generated during the optimization process. This adaptability enables the algorithm to effectively balance exploration and exploitation, thereby enhancing its convergence speed and solution quality over successive iterations.</p><p>Moreover, the use of adaptive parameters reduces the reliance on manual parameter tuning, making SSA more user-friendly and accessible to researchers and practitioners. <ref type="bibr" target="#b14">[15]</ref> </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.5">Application of Deep Learning Models</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.5.1">The Gated Recurrent Unit (GRU):</head><p>It is a simplified recurrent neural network (RNN) architecture adept at capturing temporal dependencies in serialized data. GRU operates by employing gating mechanisms to modify the network's hidden state during each time step, controlling the flow of information within the network. <ref type="bibr" target="#b15">[16]</ref> It comprises of two gating mechanisms where the reset gate decides the extent to which the prior hidden state should be disregarded, whereas the update gate governs the degree to which the new input influences the hidden state's update. Subsequently, the GRU's output is determined based on the modified hidden state. With its update and reset gates, GRU efficiently retains and updates hidden states, making it suitable for tasks like heart failure prediction. Its streamlined design and adaptability enable effective modeling of both short-term fluctuations and long-term patterns in patient data. Additionally, the streamlined design of GRU reduces the risk of overfitting and enables faster convergence during training. <ref type="bibr" target="#b16">[17]</ref> </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.5.2">Long Short-Term Memory (LSTM):</head><p>LSTM represents a specific architecture within recurrent neural networks (RNNs) tailored to tackle the complexities associated with capturing prolonged dependencies in sequential data. In contrast to conventional RNNs, LSTM incorporates distinct memory cells, allowing the network to preserve information across extended temporal intervals. This design renders LSTM particularly adept at handling tasks involving sequential data, including but not limited to time series prediction, language processing, and healthcare analytics. <ref type="bibr" target="#b17">[18]</ref> The fundamental elements of an LSTM unit comprise the input gate, forget gate, output gate, and cell state, each playing a crucial role in managing information flow within the network. The input gate regulates what information should be stored in the cell state, while the forget gate determines which information should be discarded from the cell state. Through the cell state, the LSTM unit retains information over time, facilitating the capture of long-term dependencies. Lastly, the output gate governs which information should be passed from the cell state to the subsequent time step. Renowned for its efficacy in modeling temporal dependencies and mitigating challenges such as vanishing gradients, the LSTM has garnered widespread adoption across diverse domains. <ref type="bibr" target="#b18">[19]</ref> </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.5.3">Bidirectional Long Short-Term Memory (Bi-LSTM):</head><p>It is an expansion of the classic Long Short-Term Memory (LSTM) design, aiming to grasp context from both past and future in sequential data. It is composed of two LSTM layers: one handling the input sequence forwards and the other backwards. This bidirectional approach allows the model to grasp dependencies from both preceding and succeeding time steps, thereby improving its comprehension of temporal sequences and predictive accuracy. <ref type="bibr" target="#b19">[20]</ref> In Bi-LSTM, each hidden state incorporates input not just from the past but also from the future, enabling the model to adeptly handle long-term dependencies. This bidirectional method proves particularly advantageous in tasks necessitating context from both past and future, such as natural language processing, speech recognition, and time series analysis. The Bi-LSTM architecture comprises forward and backward LSTM layers linked to a dense layer, amalgamating insights from both directions prior to making predictions. By harnessing information from both preceding and succeeding contexts, Bi-LSTM models excel in capturing intricate patterns in sequential data, outperforming unidirectional LSTM models. <ref type="bibr" target="#b20">[21]</ref> </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Result and Discussion</head><p>In this paper, we conducted experiments that are aimed to investigate the effectiveness of Sparrow Search Algorithm (SSA) combined with three Deep Learning (DL) models, namely Long Short-Term Memory (LSTM), Gated Recurrent Unit (GRU), and Bidirectional Long Short-Term Memory (Bi-LSTM), for heart failure prediction. Among these models, Bi-LSTM emerged as the most accurate predictor of heart failure risk with the accuracy of 97.86%, while GRU and LSTM got 82.92% and 97.50% respectively. As for the models that were not optimized by swarm techniques, showed comparatively less accuracy i.e. 77.17%, 89.75% and 90.73% were the results of the DL models GRU, LSTM and BI-LSTM respectively.</p><p>The results revealed that all the swarm integrated models outperformed various normal deep learning models in terms of predictive accuracy, precision and recall. Among all the swarm optimized DL models with SSA, Bi-LSTM showed the best result i.e. 97.86% accuracy. It's ability to grasp both past and future sequential data proved to be improving the ability of the model to understand the complex temporal patterns underlying heart failure progression. This bidirectional processing enabled Bi-LSTM to leverage information from both preceding and succeeding time steps, leading to more accurate predictions compared to unidirectional models.</p><p>The integration of Sparrow Search Algorithm (SSA) with DL models significantly enhanced the predictive performance of Bi-LSTM. SSA effectively fine-tuned the various parameters of the Bi-LSTM model, enabling it to achieve superior accuracy in heart failure prediction tasks. The optimization process facilitated the exploration of the solution space and the identification of optimal model configurations, leading to improved generalization and robustness.</p><p>While Bi-LSTM demonstrated remarkable accuracy in heart failure prediction, further research is warranted to explore its applicability in real-world clinical settings. Future studies could focus on evaluating the interpretability of Bi-LSTM models, exploring the influence of different input features on predictive performance, and conducting prospective validation studies to assess the model's clinical utility. Additionally, exploring ensemble techniques and hybrid models combining DL with other machine learning approaches could further enhance predictive accuracy and robustness.     prediction. Through extensive experimentation and evaluation on real-world healthcare datasets, we have demonstrated the effectiveness of the proposed approach in accurately predicting heart failure risk.</p><p>The results obtained from our experiments highlight the significant impact of optimization techniques such as SSA in fine-tuning DL models for improved predictive performance. We observed that the combination of SSA with DL techniques not only enhanced the predictive accuracy of heart failure prediction models but also contributed to better generalization and robustness.</p><p>Furthermore, our findings underscore the importance of selecting appropriate DL architectures for healthcare analytics tasks. While LSTM, GRU, and Bi-LSTM all exhibited promising results, Bi-LSTM, with its ability to capture both past and future context in sequential data, emerged as the most effective model for heart failure prediction in our experiments.</p><p>Overall, the outcomes of this study have implications for clinical practice, offering healthcare practitioners a valuable tool for early detection and risk stratification of heart failure patients. By leveraging the synergy between optimization algorithms like SSA and advanced DL models, we can pave the way for more accurate, efficient, and personalized healthcare interventions, finally progressing towards an improved patient health results and boosted quality of care in the management of heart failure.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 .</head><label>1</label><figDesc>Figure 1. Building a Swarm Algorithm Enhanced Deep Learning Model for Heart Prediction on the UCI Cleveland Dataset</figDesc><graphic coords="4,168.75,117.87,235.50,265.80" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 2 .</head><label>2</label><figDesc>Figure 2. A bar plot visualizing the performance metrics of each Deep Learning model without any optimization</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Figure 3 .</head><label>3</label><figDesc>Figure 3. A bar plot visualizing the performance metrics of each SSA optimized Deep Learning model</figDesc><graphic coords="9,100.08,371.28,411.12,242.16" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>Figure 4 .</head><label>4</label><figDesc>Figure 4. A bar plot visualizing the comparative accuracy derived from each Deep Learning model executed along with and without Sparrow Search Algorithm</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 1 .</head><label>1</label><figDesc>Tabulation of accuracy achieved by applying various DL models on results generated without SSA</figDesc><table><row><cell>DL Models</cell><cell>GRU</cell><cell>LSTM</cell><cell>Bi-LSTM</cell></row><row><cell>Accuracy (%)</cell><cell>77.17</cell><cell>89.75</cell><cell>90.73</cell></row><row><cell>Precision (%)</cell><cell>81.03</cell><cell>87.27</cell><cell>88.18</cell></row><row><cell>Recall (%)</cell><cell>91.26</cell><cell>93.20</cell><cell>94.17</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_1"><head>Table 2 .</head><label>2</label><figDesc>Tabulation of accuracy achieved by applying various DL models on results generated with SSA</figDesc><table><row><cell>DL Models</cell><cell>SSA-GRU</cell><cell>SSA-LSTM</cell><cell>SSA-Bi-LSTM</cell></row><row><cell>Accuracy (%)</cell><cell>82.92</cell><cell>97.50</cell><cell>97.86</cell></row><row><cell>Precision (%)</cell><cell>78.68</cell><cell>76.22</cell><cell>81.30</cell></row><row><cell>Recall (%)</cell><cell>93.20</cell><cell>90.29</cell><cell>84.46</cell></row></table></figure>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Cardiovascular diseases</title>
		<ptr target="https://www.who.int/health-topics/cardiovascular-diseases#tab=tab_1" />
	</analytic>
	<monogr>
		<title level="m">World Health Organization: WHO</title>
				<imprint>
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">A weighted-sum chaotic sparrow search algorithm for interdisciplinary feature selection and data classification</title>
		<author>
			<persName><forename type="first">L</forename><surname>Jia</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">G</forename><surname>Gad</surname></persName>
		</author>
		<idno type="DOI">10.1038/s41598-023-38252-0</idno>
		<idno>doi:</idno>
		<ptr target="https://doi.org/10.1038/s41598-023-38252-0" />
	</analytic>
	<monogr>
		<title level="j">Sci Rep</title>
		<imprint>
			<biblScope unit="volume">13</biblScope>
			<biblScope unit="page">14061</biblScope>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<monogr>
		<ptr target="https://archive.ics.uci.edu/dataset/45/heart+disease" />
		<title level="m">UCI Machine Learning Repository</title>
				<imprint/>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">An intelligent heart disease prediction system based on swarm-artificial neural network</title>
		<author>
			<persName><forename type="first">S</forename><surname>Nandy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Adhikari</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Balasubramanian</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">G</forename><surname>Menon</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Zakarya</surname></persName>
		</author>
		<idno type="DOI">10.1007/s00521-021-06124-1</idno>
		<idno>doi:</idno>
		<ptr target="https://doi.org/10.1007/s00521-021-06124-1" />
	</analytic>
	<monogr>
		<title level="j">Neural Computing and Applications</title>
		<imprint>
			<biblScope unit="volume">35</biblScope>
			<biblScope unit="issue">20</biblScope>
			<biblScope unit="page" from="14723" to="14737" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">MLP-PSO Hybrid Algorithm for Heart Disease Prediction</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">A</forename><surname>Bataineh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Manacek</surname></persName>
		</author>
		<idno type="DOI">10.3390/jpm12081208</idno>
		<idno>doi:</idno>
		<ptr target="https://doi.org/10.3390/jpm12081208" />
	</analytic>
	<monogr>
		<title level="j">Journal of Personalized Medicine</title>
		<imprint>
			<biblScope unit="volume">12</biblScope>
			<biblScope unit="issue">8</biblScope>
			<biblScope unit="page">1208</biblScope>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Random forest swarm optimization-based for heart diseases diagnosis</title>
		<author>
			<persName><forename type="first">S</forename><surname>Asadi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">E</forename><surname>Roshan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">W</forename><surname>Kattan</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.jbi.2021.103690</idno>
		<idno>doi:</idno>
		<ptr target="https://doi.org/10.1016/j.jbi.2021.103690" />
	</analytic>
	<monogr>
		<title level="j">Journal of Biomedical Informatics</title>
		<imprint>
			<biblScope unit="volume">115</biblScope>
			<biblScope unit="page">103690</biblScope>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">New cardiovascular disease prediction approach using support vector machine and quantum-behaved particle swarm optimization</title>
		<author>
			<persName><forename type="first">E</forename><forename type="middle">I</forename><surname>Elsedimy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">M M</forename><surname>Abohashish</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Algarni</surname></persName>
		</author>
		<idno type="DOI">10.1007/s11042-023-16194-z</idno>
		<idno>doi:</idno>
		<ptr target="https://doi.org/10.1007/s11042-023-16194-z" />
	</analytic>
	<monogr>
		<title level="j">Multimedia Tools and Applications</title>
		<imprint>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Deep edge intelligence-based solution for heart failure prediction in ambient assisted living</title>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">I A</forename><surname>Hossain</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Tabassum</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Shamszaman</surname></persName>
		</author>
		<idno type="DOI">10.1007/s43926-023-00043-4</idno>
		<idno>doi:</idno>
		<ptr target="https://doi.org/10.1007/s43926-023-00043-4" />
	</analytic>
	<monogr>
		<title level="j">Discover Internet of Things</title>
		<imprint>
			<biblScope unit="volume">3</biblScope>
			<biblScope unit="issue">1</biblScope>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Novel Crow Swarm Optimization Algorithm and Selection Approach for Optimal Deep Learning COVID-19 Diagnostic Model</title>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">A</forename><surname>Mohammed</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Al-Khateeb</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Yousif</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">A</forename><surname>Mostafa</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Kadry</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">H</forename><surname>Abdulkareem</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>García-Zapirain</surname></persName>
		</author>
		<idno type="DOI">10.1155/2022/1307944</idno>
		<idno>doi:</idno>
		<ptr target="https://doi.org/10.1155/2022/1307944" />
	</analytic>
	<monogr>
		<title level="j">Computational Intelligence and Neuroscience</title>
		<imprint>
			<biblScope unit="page" from="1" to="22" />
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">A learning sparrow search algorithm</title>
		<author>
			<persName><forename type="first">C</forename><surname>Ouyang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Zhu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Wang</surname></persName>
		</author>
		<idno type="DOI">10.1155/2021/3946958</idno>
		<idno>doi:</idno>
		<ptr target="https://doi.org/10.1155/2021/3946958" />
	</analytic>
	<monogr>
		<title level="j">Computational Intelligence and Neuroscience</title>
		<imprint>
			<biblScope unit="page" from="1" to="23" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">An improved binary sparrow search algorithm for feature selection in data classification</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">G</forename><surname>Gad</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">M</forename><surname>Sallam</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">K</forename><surname>Chakrabortty</surname></persName>
		</author>
		<idno type="DOI">10.1007/s00521-022-</idno>
		<idno>07203-7</idno>
		<ptr target="org/10.1007/s00521-022-" />
	</analytic>
	<monogr>
		<title level="j">Neural Comput &amp; Applic</title>
		<imprint>
			<biblScope unit="volume">34</biblScope>
			<biblScope unit="page" from="15705" to="15752" />
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Advances in Sparrow Search Algorithm: A Comprehensive survey</title>
		<author>
			<persName><forename type="first">F</forename><forename type="middle">S</forename><surname>Gharehchopogh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">H</forename><surname>Namazi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Ebrahimi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><forename type="middle">S</forename><surname>Gharehchopogh</surname></persName>
		</author>
		<idno type="DOI">10.1007/s11831-022-09804-w</idno>
		<idno>doi:</idno>
		<ptr target="https://doi.org/10.1007/s11831-022-09804-w" />
	</analytic>
	<monogr>
		<title level="j">Archives of Computational Methods in Engineering</title>
		<imprint>
			<biblScope unit="volume">30</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="427" to="455" />
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">An Improved Sparrow Search Algorithm</title>
		<author>
			<persName><forename type="first">W</forename><surname>Song</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Liu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Wu</surname></persName>
		</author>
		<idno type="DOI">10.1109/ISPA-BDCloud-SocialCom-SustainCom51426.2020.00093</idno>
	</analytic>
	<monogr>
		<title level="m">IEEE Intl Conf on Parallel &amp; Distributed Processing with Applications, Big Data &amp; Cloud Computing, Sustainable Computing &amp; Communications, Social Computing &amp; Networking (ISPA/BDCloud/SocialCom/SustainCom)</title>
				<meeting><address><addrLine>Exeter, United Kingdom</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2020">2020</date>
			<biblScope unit="page" from="537" to="543" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">Recent Versions and Applications of Sparrow Search Algorithm</title>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">A</forename><surname>Awadallah</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">A</forename><surname>Al-Betar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><forename type="middle">A</forename><surname>Doush</surname></persName>
		</author>
		<idno type="DOI">10.1007/s11831-023-09887-z</idno>
		<ptr target="https://doi.org/10.1007/s11831-023-09887-z" />
	</analytic>
	<monogr>
		<title level="j">Arch Computat Methods Eng</title>
		<imprint>
			<biblScope unit="volume">30</biblScope>
			<biblScope unit="page" from="2831" to="2858" />
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">A novel swarm intelligence optimization approach: sparrow search algorithm</title>
		<author>
			<persName><forename type="first">J</forename><surname>Xue</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Shen</surname></persName>
		</author>
		<idno type="DOI">10.1080/21642583.2019.1708830</idno>
		<idno>doi:</idno>
		<ptr target="https://doi.org/10.1080/21642583.2019.1708830" />
	</analytic>
	<monogr>
		<title level="j">Systems Science &amp; Control Engineering</title>
		<imprint>
			<biblScope unit="volume">8</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="22" to="34" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">Improved Particle Swarm Optimization-based GRU Networks for Short-time Traffic Flow Prediction</title>
		<author>
			<persName><forename type="first">Z</forename><surname>Cheng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Zhu</surname></persName>
		</author>
		<idno type="DOI">10.1109/CAC51589.2020.9327749</idno>
	</analytic>
	<monogr>
		<title level="m">Chinese Automation Congress (CAC)</title>
				<meeting><address><addrLine>Shanghai, China</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2020">2020</date>
			<biblScope unit="page" from="2863" to="2868" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">Gated recurrent unit</title>
		<ptr target="https://en.wikipedia.org/wiki/Gated_recurrent_unit#:~:text=Gated%20recurrent%20units%20(GRUs)%20are,in%20fewer%20parameters%20than%20LSTM" />
	</analytic>
	<monogr>
		<title level="m">Wikipedia contributors</title>
				<imprint>
			<date type="published" when="2024-02">Feb. 2024</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">Research on particle swarm optimization in LSTM neural networks for rainfall-runoff simulation</title>
		<author>
			<persName><forename type="first">Y</forename><surname>Xu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Hu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Q</forename><surname>Wu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Jian</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Wang</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.jhydrol.2022.127553</idno>
		<idno>doi:</idno>
		<ptr target="https://doi.org/10.1016/j.jhydrol.2022.127553" />
	</analytic>
	<monogr>
		<title level="j">Journal of Hydrology</title>
		<imprint>
			<biblScope unit="volume">608</biblScope>
			<biblScope unit="page">127553</biblScope>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<analytic>
		<title level="a" type="main">An adaptive particle swarm optimization-based hybrid long shortterm memory model for stock price time series forecasting</title>
		<author>
			<persName><forename type="first">G</forename><surname>Kumar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">U</forename><forename type="middle">P</forename><surname>Singh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Jain</surname></persName>
		</author>
		<idno type="DOI">10.1007/s00500-022-07451-8</idno>
		<idno>doi:</idno>
		<ptr target="https://doi.org/10.1007/s00500-022-07451-8" />
	</analytic>
	<monogr>
		<title level="j">Soft Computing</title>
		<imprint>
			<biblScope unit="volume">26</biblScope>
			<biblScope unit="issue">22</biblScope>
			<biblScope unit="page" from="12115" to="12135" />
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b19">
	<analytic>
		<title level="a" type="main">Social network analysis for crime rate detection using Spizella swarm optimization based BiLSTM classifier</title>
		<author>
			<persName><forename type="first">P</forename><surname>Mithoo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Kumar</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.knosys.2023.110450</idno>
		<idno>doi:</idno>
		<ptr target="https://doi.org/10.1016/j.knosys.2023.110450" />
	</analytic>
	<monogr>
		<title level="j">Knowledge-Based Systems</title>
		<imprint>
			<biblScope unit="volume">269</biblScope>
			<biblScope unit="page">110450</biblScope>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b20">
	<analytic>
		<title level="a" type="main">Levy flight-particle swarm optimization-assisted BiLSTM + dropout deep learning model for short-term load forecasting</title>
		<author>
			<persName><forename type="first">D</forename><surname>Kiruthiga</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Manikandan</surname></persName>
		</author>
		<idno type="DOI">10.1007/s00521-022-07751-y</idno>
		<idno>doi:</idno>
		<ptr target="https://doi.org/10.1007/s00521-022-07751-y" />
	</analytic>
	<monogr>
		<title level="j">Neural Computing and Applications</title>
		<imprint>
			<biblScope unit="volume">35</biblScope>
			<biblScope unit="issue">3</biblScope>
			<biblScope unit="page" from="2679" to="2700" />
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b21">
	<analytic>
		<title level="a" type="main">Improved heart disease prediction using particle swarm optimization based stacked sparse autoencoder</title>
		<author>
			<persName><forename type="first">I</forename><forename type="middle">D</forename><surname>Mienye</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Sun</surname></persName>
		</author>
		<idno type="DOI">10.3390/electronics10192347</idno>
		<idno>doi:</idno>
		<ptr target="https://doi.org/10.3390/electronics10192347" />
	</analytic>
	<monogr>
		<title level="j">Electronics</title>
		<imprint>
			<biblScope unit="volume">10</biblScope>
			<biblScope unit="issue">19</biblScope>
			<biblScope unit="page">2347</biblScope>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b22">
	<analytic>
		<title level="a" type="main">Effective heart disease prediction using improved particle swarm optimization algorithm and ensemble classification technique</title>
		<author>
			<persName><forename type="first">N</forename><forename type="middle">V</forename><surname>Mahalakshmi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">K</forename><surname>Rout</surname></persName>
		</author>
		<idno type="DOI">10.1007/s00500-023-08388-2</idno>
		<idno>doi:</idno>
		<ptr target="https://doi.org/10.1007/s00500-023-08388-2" />
	</analytic>
	<monogr>
		<title level="j">Soft Computing</title>
		<imprint>
			<biblScope unit="volume">27</biblScope>
			<biblScope unit="issue">15</biblScope>
			<biblScope unit="page" from="11027" to="11040" />
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
