<?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">Leveraging Bio-Inspired Optimization Algorithms for Advanced Feature Selection in Chronic Disease Datasets</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author role="corresp">
							<persName><forename type="first">Abeer</forename><surname>Dyoub</surname></persName>
							<email>abeer.dyoub@uniba.it</email>
							<affiliation key="aff0">
								<orgName type="department">Computer Science Department</orgName>
								<orgName type="institution">University of Bari</orgName>
								<address>
									<settlement>Bari</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Ivan</forename><surname>Letteri</surname></persName>
							<affiliation key="aff1">
								<orgName type="department">Department of Life, Health and Environmental Sciences</orgName>
								<orgName type="institution">University of L&apos;Aquila</orgName>
								<address>
									<settlement>L&apos;Aquila</settlement>
									<country key="IT">ITALY</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Leveraging Bio-Inspired Optimization Algorithms for Advanced Feature Selection in Chronic Disease Datasets</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">B5839738ED0FA60AF5CD1DBFE2C95C21</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T16:54+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>Chronic Diseases Prediction</term>
					<term>Bio-Inspired Feature Selection</term>
					<term>Genetic Algorithms</term>
					<term>Flower Pollination Optimization</term>
					<term>Particle Swarm Optimization</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>In this study, we investigated the application of bio-inspired optimization algorithms for feature selection in chronic disease prediction. The primary goal was to enhance models' predictive accuracy, streamline data dimensionality, and make predictions more interpretable and actionable. The research encompassed a comparative analysis of the three bio-inspired categories: evolutionary-based, swarm-intelligence, and ecology-based. For the feature selection method, we selected one algorithm for each category: Genetic Algorithms, Flower Pollination Optimization, and Particle Swarm Optimization, applying them across diverse chronic diseases including cancer, kidney, and cardiovascular diseases. The results demonstrate in some cases, that the bio-inspired optimization algorithms effectively reduce the number of features required for accurate classification and consequently the convergence time. The findings underscore this work's potential impact on early intervention, precision medicine, and improved patient outcomes, providing new avenues for delivering healthcare services tailored to individual needs.</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>Chronic diseases pose a significant global health challenge, impacting morbidity and mortality rates. Early detection is crucial for prevention and personalised healthcare. Advanced analytics and AI offer the potential for revolutionising prediction in many field like finance <ref type="bibr" target="#b0">[1]</ref> [2], cybersecurity <ref type="bibr" target="#b2">[3]</ref> and in particular disease.</p><p>Supervised learning in various fields relies heavily on feature selection (FS) to reduce input dimensionality. Maintaining target class integrity amidst irrelevant characteristics is essential for accurate classification in the medical domain.</p><p>Bio-inspired optimisation emulates behaviours found in various natural creatures such as fish, insects, bird swarms, terrestrial animals, reptiles, humans, and other phenomena. These methods have been used for supervised feature selection (see <ref type="bibr" target="#b3">[4]</ref>). The same source categorises bio-inspired optimisation algorithms into three groups based on their source of inspiration: swarm intelligence algorithms, evolutionary-based algorithms, and ecology-based algorithms. For robustness and diversity, we selected Genetic Algorithms (GA), Particle Swarm Optimisation (PSO), and Flower Pollination Optimisation (FPO), one from each category.</p><p>We refine feature subsets from medical datasets encompassing cancer, kidney, and cardiovascular diseases to enhance model accuracy and simplify data dimensionality. The aim is to improve interpretability and practicality in chronic disease prediction.</p><p>Investigating chronic diseases presents significant challenges in the healthcare domain. This study aims to improve the predictive accuracy of chronic diseases by employing machine learning (ML) and feature selection (FS) techniques, which involve data collection, preprocessing, and performance assessment.</p><p>The paper proceeds with an outline of the methodology in Section 2. Section 3 presents experimental findings, followed by a discussion in Section 4. Finally, Section 5 summarises key findings, limitations, and future directions.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Methodology</head><p>Preprocessing techniques, including transformation, cleaning, imputation, balancing, and normalization, were applied to ensure data quality <ref type="bibr" target="#b4">[5]</ref>. Subsequently, feature selection was performed by GA, PSO, and FPO algorithms. The selected features were then used for classification using Decision Trees (DT), Random Forest (RF), Logistic Regression (LR), Support Vector Machines (SVM), and K-Nearest Neighbour (KNN). Finally, we evaluated the performance of these models using various metrics.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.1.">The Datasets</head><p>Breast Cancer dataset: From the University of Wisconsin, this dataset involves cytological examinations to distinguish between benign and malignant tumours. It contains 569 samples and 31 features.</p><p>Kidney Disease: Medical information on chronic kidney disease, collected over two months in India, is included in this dataset, available on Kaggle or UCI. It consists of 400 samples and 25 features.</p><p>Heart failure dataset: Comprising medical records of heart failure patients during follow-up, this dataset contains 299 samples and 13 features.</p><p>Each dataset has the "diagnosis" column with binary values used as targets for supervised learning of classifiers, where 0 denotes a negative and 1 indicates a positive outcome, respectively.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.2.">Datsets Pre-processing</head><p>Missing Values Imputation. Addressing missing data poses risks of performance degradation and biased results. We used the K-Nearest Neighbors (KNN) algorithm, known for its adaptability to diverse data types, to fill the lack in the datasets.</p><p>Data Balancing. To balance the datasets is a critical concern due to the struggle of the classifiers when faced with disparate class distributions, leading to biased models. To mitigate this issue, we used the Synthetic Minority Over-sampling Technique for Nominal and Continuous features (SMOTEEN) <ref type="bibr" target="#b5">[6]</ref> which addresses imbalanced datasets by oversampling the minority class and cleaning the majority class by combining the SMOTE and Edited Nearest Neighbors (ENN) methods.</p><p>Min-max Normalization. We applied this scaling method to normalize the datasets to a predefined range, as follows: 𝑋𝑛𝑜𝑟𝑚 = 𝑋−𝑋 𝑚𝑖𝑛 𝑋𝑚𝑎𝑥−𝑋 𝑚𝑖𝑛 , where 𝑋𝑛𝑜𝑟𝑚 represents the normalized value of the feature, 𝑋 is the original value of the feature. 𝑋𝑚𝑖𝑛 and 𝑋𝑚𝑎𝑥 denote the minimum and maximum values respectively.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.3.">Bio-inspired Feature Selection</head><p>Following the data preparation stage, we applied the three aforementioned bio-inspired feature selection algorithms to each of the three datasets (see section 2.1). All algorithms employ the same fitness function, with the 𝛼 value set to 0.99 to prioritize classification accuracy.</p><p>For assessing fitness, we utilized the K-Nearest Neighbors (KNN) classifier, known for its efficiency and adopted by <ref type="bibr" target="#b6">[7]</ref>, as it does not necessitate a lengthy training phase. A neighbour count of 𝐾 = 10 was used. The feature selection algorithms were configured with 20 agents (individuals) and 100 generations.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.4.">Performance Evaluation Method</head><p>For each dataset detailed in section 2.1, every machine learning model is trained using 70% of the data and tested using the remaining 30%, employing all features, and filtered features by PSO, FPO, and GA algorithms. This process is iterated 100 times with each iteration involving shuffling the dataset. Moreover, for each iteration, the dataset is split into training and testing sets to evaluate measures such as Accuracy, Recall, Precision, and F1-score.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Experiments and Results</head><p>Figures 1, 2, 3 show the fitness trends of the FS algorithms, and table 1 summarizes the performance of these FS algorithms in terms of feature reduction.</p><p>In table <ref type="table" target="#tab_1">2</ref>, we report the accuracies of the classifiers with the features. Whereas, in table 3, we report the percentage variations of the training time before and after the FS.  </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.1.">Breast Cancer Dataset</head><p>The final features selected by the various algorithms are:    </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2.">Heart Failure Dataset</head><p>The final features selected by the three algorithms are:</p><p>• FPO: ['anaemia', 'diabetes', 'smoking']</p><p>• GA: ['platelets', 'serum sodium', 'time'] • PSO: ['platelets', 'serum creatinine'] we note that GA has acheived a better fitness with respect to FPO, even both have achieved the same reduction percentage in dimentionality with breast cancer dataset. The two algorithms have selected different sets of features. The genetic algorithm significantly higher fitness with respect to FPO and PSO even though the the dimentionality reduction is almost the same. RF, DT, SVM and KNN have achieved a better performance on this dataset when combined with GA algorithm. In general, however, the training times have all decreased, with the maximum decrease 57% by LR model with both GA and PSO. See further metrics in figures 7, 8 , 9.  </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.3.">Kidney Disease Dataset</head><p>The final features selected by the various algorithms are:</p><p>• FPO: ['su', 'rbc', 'pcc', 'pe', 'ane'] • GA: ['rbc', 'bgr', 'sod', 'hemo', 'pcv', 'dm', 'cad'] • PSO: ['age', 'su', 'rbc', 'pc', 'bgr', 'sod', 'pot', 'hemo', 'pcv', 'rc', 'cad'] In this dataset, high performance was achieved with most models combined with PSO and GA, while with FPO there was a significant decrease in performance. There has been a 55% decrease in processing time without loss in the performance with LR model combined with PSO and a reduction in processing time up to 57% with LR combined with GA with a very slight reduction in the performance. The highest fitness was achieved by GA with 7 features (70% reduction in dimentionality), while the lowest fitness was achieved by FPO with the highest features reduction. See further metrics in figures 10, 11, 12. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Discussion</head><p>From Table <ref type="table" target="#tab_1">2</ref>, it is evident that GA emerged as the most effective FS technique in terms of performance. It consistently improved accuracy across various ML models and datasets, or maintained accuracy levels compared to pre-FS values with other techniques. The accuracy enhancement with GA ranged from 0.1% to 7%. Following GA, PSO ranked second in terms of accuracy perfor-  mance among the three bio-inspired algorithms. While PSO did not notably enhance accuracy, it also did not lead to significant decreases. FPO exhibited diverse outcomes across different ML models and datasets. While accuracy decreases were marginal (less than 2.5%) for most ML models on the breast cancer dataset, there were more pronounced decreases on the heart failure and kidney disease datasets.</p><p>In terms of training times, the impact was particularly notable for DT and LR, as evidenced in Table <ref type="table" target="#tab_2">3</ref>. Generally, training times decreased across all models when employing feature selection (FS), except for K-Nearest Neighbours (KNN) with breast cancer and kidney disease datasets, where a significant increase of up to 21% was observed. Minor fluctuations within ±2% in training times were considered insignificant, likely due to variable hardware conditions and software factors. Overall, machine learning (ML) models exhibited reduced training times with FS, especially DT and LR models with GA and PSO. The most substantial reduction in training time, up to 67%, was achieved by the LR model with FPO on the Kidney disease dataset. Although FS did not significantly improve ML model performance in most cases, and even led to a decrease in performance in some instances, the noteworthy decrease in processing times without significant loss in accuracy represents a significant achievement.</p><p>The experimental findings indicate that the GA outperformed other FS algorithms in terms of precision, recall, and F1-measure. GA demonstrated superior performance when paired with nearly all ML models compared to FPO and PSO across all datasets. However, the PSO algorithm, when combined with the LR model, exhibited slightly higher recall and F1 scores for breast cancer and kidney disease datasets, as well as marginally improved recall for heart failure dataset. Conversely, FPO generally exhibited the poorest performance when paired with various ML models. Although FPO achieved the highest recall when combined with the LR model on the heart failure dataset, its overall performance was inferior. In terms of fitness trends, GA displayed the most favourable results, with PSO closely trailing behind, while FPO yielded significantly lower fitness levels compared to GA and PSO. Further experiments are planned to investigate the behaviour of these FS algorithms with varying parameters, datasets, and ML models. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Conclusion</head><p>Our experiments have highlighted the importance of feature selection (FS) in improving the performance of machine learning (ML) models. The impact of FS varies depending on factors such as the chosen FS algorithm and dataset characteristics <ref type="bibr" target="#b7">[8]</ref>. FS holds the potential to significantly enhance ML outcomes, especially for datasets with a large number of features. For example, in the breast cancer dataset, reducing features from 30 to 12 or 8 resulted in up to a 50% reduction in training time, while maintaining the same performance across various ML models. However, the effect of FS on training time </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: Fitness trends on breast cancer dataset</figDesc><graphic coords="2,302.62,310.98,203.36,152.52" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 2 :Figure 3 :</head><label>23</label><figDesc>Figure 2: Fitness trends on heart failure dataset</figDesc><graphic coords="3,89.29,84.19,203.36,152.52" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Figure 4 :</head><label>4</label><figDesc>Figure 4: Precision on dataset Breast Cancer.</figDesc><graphic coords="3,312.79,107.46,183.03,129.54" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>Figure 5 :</head><label>5</label><figDesc>Figure 5: Recall on dataset Breast Cancer.</figDesc><graphic coords="3,89.29,271.38,203.36,152.52" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_4"><head>Figure 6 :</head><label>6</label><figDesc>Figure 6: F1-score on dataset Breast Cancer.</figDesc><graphic coords="3,312.79,456.94,183.03,130.24" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_5"><head>Figure 7 :</head><label>7</label><figDesc>Figure 7: Precision on dataset Hearth Failure.</figDesc><graphic coords="4,99.46,252.81,183.02,127.92" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_6"><head>Figure 8 :</head><label>8</label><figDesc>Figure 8: Recall on dataset Hearth Failure.</figDesc><graphic coords="4,99.46,424.84,183.02,130.59" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_7"><head>Figure 9 :</head><label>9</label><figDesc>Figure 9: F1-score on dataset Hearth Failure.</figDesc><graphic coords="4,312.79,84.19,183.03,127.73" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_8"><head>Figure 10 :</head><label>10</label><figDesc>Figure 10: Precision on dataset Kidney Disease.</figDesc><graphic coords="4,312.79,394.35,183.02,131.09" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_9"><head>Figure 11 :</head><label>11</label><figDesc>Figure 11: Recall on dataset Kidney Disease.</figDesc><graphic coords="5,99.46,84.19,183.02,127.92" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_10"><head>Figure 12 :</head><label>12</label><figDesc>Figure 12: F1-score on dataset Kidney Disease.</figDesc><graphic coords="5,99.46,247.19,183.03,129.81" type="bitmap" /></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>Performance of Dimensional Reduction in the different Feature Selection Algorithms.</figDesc><table><row><cell>Dataset</cell><cell>Algorithm</cell><cell>Fitness</cell><cell>#Features</cell><cell>Reduction</cell></row><row><cell></cell><cell>GA</cell><cell>≈ 0.992</cell><cell>8</cell><cell>73.3%</cell></row><row><cell>Breast Cancer</cell><cell>PSO</cell><cell>≈ 0.985</cell><cell>12</cell><cell>60%</cell></row><row><cell></cell><cell>FPO</cell><cell>≈ 0.9092</cell><cell>8</cell><cell>73.3%</cell></row><row><cell></cell><cell>GA</cell><cell>≈ 0.91</cell><cell>3</cell><cell>75%</cell></row><row><cell>Heart Failure</cell><cell>PSO</cell><cell>≈ 0.79</cell><cell>2</cell><cell>83.3%</cell></row><row><cell></cell><cell>FPO</cell><cell>≈ 0.581</cell><cell>3</cell><cell>75%</cell></row><row><cell></cell><cell>GA</cell><cell>≈ 0.998</cell><cell>7</cell><cell>70%</cell></row><row><cell>Kidney Disease</cell><cell>PSO</cell><cell>≈ 0.995</cell><cell>11</cell><cell>54%</cell></row><row><cell></cell><cell>FPO</cell><cell>≈ 0.8454</cell><cell>5</cell><cell>80%</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>Models Accuracy.</figDesc><table><row><cell></cell><cell></cell><cell>Breast Cancer</cell><cell>Heart Failure</cell><cell>Kidney Disease</cell></row><row><cell></cell><cell>No FS</cell><cell>98.4%</cell><cell>85.5%</cell><cell>98.7%</cell></row><row><cell>RF</cell><cell>FPO PSO</cell><cell>96.2% 98%</cell><cell>61.2% 83.6%</cell><cell>57% 97.5%</cell></row><row><cell></cell><cell>GA</cell><cell>98.5%</cell><cell>89.2%</cell><cell>96.8%</cell></row><row><cell></cell><cell>No FS</cell><cell>97.3%</cell><cell>79.2%</cell><cell>96.9%</cell></row><row><cell>DT</cell><cell>FPO PSO</cell><cell>94.9% 96.7%</cell><cell>61.1% 83%</cell><cell>57% 96.8%</cell></row><row><cell></cell><cell>GA</cell><cell>97.3%</cell><cell>83.6%</cell><cell>96.8%</cell></row><row><cell></cell><cell>No FS</cell><cell>99.5%</cell><cell>77.7%</cell><cell>99.4%</cell></row><row><cell>SVM</cell><cell>FPO PSO</cell><cell>96.9% 99.5%</cell><cell>56.8% 68.2%</cell><cell>57% 98.7%</cell></row><row><cell></cell><cell>GA</cell><cell>99.6%</cell><cell>78.3%</cell><cell>97.5%</cell></row><row><cell></cell><cell>No FS</cell><cell>99.5%</cell><cell>79.4%</cell><cell>97.7%</cell></row><row><cell>LR</cell><cell>FPO PSO</cell><cell>96.1% 98.3%</cell><cell>59.1% 59.9%</cell><cell>57% 97.6%</cell></row><row><cell></cell><cell>GA</cell><cell>98.3%</cell><cell>77.8%</cell><cell>94.7%</cell></row><row><cell></cell><cell>No FS</cell><cell>98.7%</cell><cell>69.6%</cell><cell>96.1%</cell></row><row><cell>KNN</cell><cell>FPO PSO</cell><cell>96.1% 98.5%</cell><cell>52.9% 64.6%</cell><cell>52.5% 98.4%</cell></row><row><cell></cell><cell>GA</cell><cell>98.4%</cell><cell>77.3%</cell><cell>97.1%</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_2"><head>Table 3</head><label>3</label><figDesc>Models Processing Time While FS could improve training efficiency for some datasets, it may require more training cycles for others. Additionally, we have highlighted the limitations of the Flower Pollination Optimization (FPO) algorithm and emphasised the importance of considering multiple evaluation metrics beyond accuracy alone. Finally, we note that this work forms part of our broader research project on healthcare assistant agents, encompassing various aspects, including ethical considerations<ref type="bibr" target="#b8">[9]</ref>,<ref type="bibr" target="#b9">[10,</ref><ref type="bibr" target="#b10">11]</ref>.</figDesc><table><row><cell></cell><cell></cell><cell>Breast Cancer</cell><cell>Heart Failure</cell><cell>Kidney Disease</cell></row><row><cell></cell><cell>FPO</cell><cell>-7%</cell><cell>+2%</cell><cell>-2%</cell></row><row><cell>RF</cell><cell>PSO</cell><cell>-3.5%</cell><cell>+1%</cell><cell>-2%</cell></row><row><cell></cell><cell>GA</cell><cell>-5%</cell><cell>+1%</cell><cell>-4%</cell></row><row><cell></cell><cell>FPO</cell><cell>-40%</cell><cell>-8%</cell><cell>-25%</cell></row><row><cell>DT</cell><cell>PSO</cell><cell>-40%</cell><cell>-6%</cell><cell>-11%</cell></row><row><cell></cell><cell>GA</cell><cell>-50%</cell><cell>-8%</cell><cell>-18%</cell></row><row><cell></cell><cell>FPO</cell><cell>-4%</cell><cell>-6%</cell><cell>-10%</cell></row><row><cell>SVM</cell><cell>PSO</cell><cell>-10%</cell><cell>+1%</cell><cell>-0.6%</cell></row><row><cell></cell><cell>GA</cell><cell>-16%</cell><cell>-8.5%</cell><cell>-4%</cell></row><row><cell></cell><cell>FPO</cell><cell>-20.5%</cell><cell>-17%</cell><cell>-67%</cell></row><row><cell>LR</cell><cell>PSO</cell><cell>-54%</cell><cell>-57%</cell><cell>-55%</cell></row><row><cell></cell><cell>GA</cell><cell>-54.5%</cell><cell>-57%</cell><cell>-57%</cell></row><row><cell></cell><cell>FPO</cell><cell>+11%</cell><cell>-2%</cell><cell>+3.6%</cell></row><row><cell>KNN</cell><cell>PSO</cell><cell>+21%</cell><cell>-4%</cell><cell>+4%</cell></row><row><cell></cell><cell>GA</cell><cell>+10%</cell><cell>-7%</cell><cell>-0.009%</cell></row><row><cell>may vary.</cell><cell></cell><cell></cell><cell></cell><cell></cell></row></table></figure>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">AITA: A new framework for trading forward testing with an artificial intelligence engine</title>
		<author>
			<persName><forename type="first">I</forename><surname>Letteri</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Italia Intelligenza Artificiale -Thematic Workshops co-located with the 3rd CINI National Lab AIIS Conference on Artificial Intelligence (Ital IA 2023)</title>
				<editor>
			<persName><forename type="first">F</forename><surname>Falchi</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">F</forename><surname>Giannotti</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">A</forename><surname>Monreale</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">C</forename><surname>Boldrini</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">S</forename><surname>Rinzivillo</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">S</forename><surname>Colantonio</surname></persName>
		</editor>
		<meeting>the Italia Intelligenza Artificiale -Thematic Workshops co-located with the 3rd CINI National Lab AIIS Conference on Artificial Intelligence (Ital IA 2023)<address><addrLine>Pisa, Italy</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2023">May 29-30, 2023. 2023</date>
			<biblScope unit="volume">3486</biblScope>
			<biblScope unit="page" from="506" to="511" />
		</imprint>
	</monogr>
	<note>CEUR Workshop Proceedings</note>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Trading strategy validation using forwardtesting with deep neural networks</title>
		<author>
			<persName><forename type="first">I</forename><surname>Letteri</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">D</forename><surname>Penna</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">D</forename><surname>Gasperis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Dyoub</surname></persName>
		</author>
		<idno type="DOI">10.5220/0011715300003494</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 5th International Conference on Finance, Economics, Management and IT Business, FEMIB 2023</title>
				<meeting>the 5th International Conference on Finance, Economics, Management and IT Business, FEMIB 2023<address><addrLine>Prague, Czech Republic</addrLine></address></meeting>
		<imprint>
			<publisher>SCITEPRESS</publisher>
			<date type="published" when="2023">April 23-24, 2023. 2023</date>
			<biblScope unit="page" from="15" to="25" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Security in the internet of things: botnet detection in softwaredefined networks by deep learning techniques</title>
		<author>
			<persName><forename type="first">I</forename><surname>Letteri</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">D</forename><surname>Penna</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">D</forename><surname>Gasperis</surname></persName>
		</author>
		<idno type="DOI">10.1504/IJHPCN.2019.106095</idno>
	</analytic>
	<monogr>
		<title level="j">Int. J. High Perform. Comput. Netw</title>
		<imprint>
			<biblScope unit="volume">15</biblScope>
			<biblScope unit="page" from="170" to="182" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">A review on bioinspired optimization method for supervised feature selection</title>
		<author>
			<persName><forename type="first">M</forename><surname>Petwan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">R</forename><surname>Ku-Mahamud</surname></persName>
		</author>
		<idno type="DOI">10.14569/IJACSA.2022.0130516</idno>
		<ptr target="http://dx.doi.org/10.14569/IJACSA.2022.0130516.doi:10.14569/IJACSA.2022.0130516" />
	</analytic>
	<monogr>
		<title level="j">International Journal of Advanced Computer Science and Applications</title>
		<imprint>
			<biblScope unit="volume">13</biblScope>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Mtakdd&apos;19: A dataset for malware traffic detection</title>
		<author>
			<persName><forename type="first">I</forename><surname>Letteri</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">D</forename><surname>Penna</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><forename type="middle">D</forename><surname>Vita</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">T</forename><surname>Grifa</surname></persName>
		</author>
		<ptr target="https://ceur-ws.org/Vol-2597/paper-14.pdf" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Fourth Italian Conference on Cyber Security</title>
		<title level="s">CEUR Workshop Proceedings</title>
		<meeting>the Fourth Italian Conference on Cyber Security<address><addrLine>Ancona, Italy</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2020">February 4th to 7th, 2020. 2020</date>
			<biblScope unit="volume">2597</biblScope>
			<biblScope unit="page" from="153" to="165" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">A comparative performance analysis of data resampling methods on imbalance medical data</title>
		<author>
			<persName><forename type="first">M</forename><surname>Khushi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Shaukat</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">M</forename><surname>Alam</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><forename type="middle">A</forename><surname>Hameed</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Uddin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Luo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Yang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">C</forename><surname>Reyes</surname></persName>
		</author>
		<idno type="DOI">10.1109/ACCESS.2021.3102399</idno>
	</analytic>
	<monogr>
		<title level="j">IEEE Access</title>
		<imprint>
			<biblScope unit="volume">9</biblScope>
			<biblScope unit="page" from="109960" to="109975" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Feature selection approach based on whale optimization algorithm</title>
		<author>
			<persName><forename type="first">M</forename><surname>Sharawi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><forename type="middle">M</forename><surname>Zawbaa</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Emary</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Ninth international conference on advanced computational intelligence (ICACI), IEEE</title>
				<imprint>
			<date type="published" when="2017">2017. 2017</date>
			<biblScope unit="page" from="163" to="168" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Feature selection strategies for HTTP botnet traffic detection</title>
		<author>
			<persName><forename type="first">I</forename><surname>Letteri</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">D</forename><surname>Penna</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Caianiello</surname></persName>
		</author>
		<idno type="DOI">10.1109/EUROSPW.2019.00029</idno>
	</analytic>
	<monogr>
		<title level="m">IEEE European Symposium on Security and Privacy Workshops, EuroS&amp;P Workshops 2019</title>
				<meeting><address><addrLine>Stockholm, Sweden</addrLine></address></meeting>
		<imprint>
			<publisher>IEEE</publisher>
			<date type="published" when="2019-06-17">2019. June 17-19, 2019. 2019</date>
			<biblScope unit="page" from="202" to="210" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Learning domain ethical principles from interactions with users</title>
		<author>
			<persName><forename type="first">A</forename><surname>Dyoub</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Costantini</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><forename type="middle">A</forename><surname>Lisi</surname></persName>
		</author>
		<idno type="DOI">10.1007/S44206-022-00026-Y</idno>
	</analytic>
	<monogr>
		<title level="j">Digit. Soc</title>
		<imprint>
			<biblScope unit="volume">1</biblScope>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Care robots learning rules of ethical behavior under the supervision of an ethical teacher (short paper)</title>
		<author>
			<persName><forename type="first">A</forename><surname>Dyoub</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Costantini</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Letteri</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Joint Proceedings of the 1st International Workshop on HYbrid Models for Coupling Deductive and Inductive ReAsoning (HY-DRA 2022) and the 29th RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA 2022) co-located with the 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2022)</title>
				<editor>
			<persName><forename type="first">P</forename><surname>Bruno</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">F</forename><surname>Calimeri</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">F</forename><surname>Cauteruccio</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">M</forename><surname>Maratea</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">G</forename><surname>Terracina</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">M</forename><surname>Vallati</surname></persName>
		</editor>
		<meeting><address><addrLine>Genova Nervi, Italy</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2022-09-05">September 5, 2022. 2022</date>
			<biblScope unit="volume">3281</biblScope>
			<biblScope unit="page" from="1" to="8" />
		</imprint>
	</monogr>
	<note>CEUR Workshop Proceedings</note>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Logicbased machine learning for transparent ethical agents</title>
		<author>
			<persName><forename type="first">A</forename><surname>Dyoub</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Costantini</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><forename type="middle">A</forename><surname>Lisi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Letteri</surname></persName>
		</author>
		<ptr target="https://ceur-ws.org/Vol-2710/paper11.pdf" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 35th Italian Conference on Computational Logic -CILC 2020</title>
		<title level="s">CEUR Workshop Proceedings</title>
		<editor>
			<persName><forename type="first">F</forename><surname>Calimeri</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">S</forename><surname>Perri</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">E</forename><surname>Zumpano</surname></persName>
		</editor>
		<meeting>the 35th Italian Conference on Computational Logic -CILC 2020<address><addrLine>Rende, Italy</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2020">October 13-15, 2020. 2710. 2020</date>
			<biblScope unit="page" from="169" to="183" />
		</imprint>
	</monogr>
</biblStruct>

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