<?xml version="1.0" encoding="UTF-8"?>
<article xmlns:xlink="http://www.w3.org/1999/xlink">
<front><article-meta>
<title-group><article-title>Marine Predators Algorithm for Compact Feature Selection on the Wisconsin Diagnostic Breast Cancer</article-title></title-group>
<contrib-group>
<contrib contrib-type="author"><name><surname>Pourqasem</surname><given-names>Javad</given-names></name><xref ref-type="aff" rid="aff1"/></contrib>
<contrib contrib-type="author"><name><surname>Diwan</surname><given-names>Bhumika</given-names></name><xref ref-type="aff" rid="aff2"/></contrib>
<contrib contrib-type="author"><name><surname>Parandavar</surname><given-names>Zeinab</given-names></name><xref ref-type="aff" rid="aff3"/></contrib>
<aff id="aff1">Department of Computer Engineering, Urmia University, Urmia, Iran.</aff>
<aff id="aff2">Manav Rachna University, Faridabad, Haryana, India.</aff>
<aff id="aff3">Department of Computer Engineering, Ra.C., Islamic Azad University, Rasht, Iran.</aff>
</contrib-group>
<abstract><p>This study evaluates the Marine Predators Algorithm (MPA) as a binary wrapper feature selector for a support vector machine on the Wisconsin Diagnostic Breast Cancer (WDBC) dataset. The scalar objective combines cross-validation classification error and normalized subset cardinality with accuracy weight 0.9. Ten comparator optimizers were evaluated under a reported common population size of 20 and 100 iterations over 30 runs. The recorded tables give MPA the highest mean accuracy, 98.49%, and the smallest mean subset, 11.13 of 30 features, a 62.9% reduction. These summaries describe a single retrospective benchmark. Their interpretation is conditional on resolving the reported accuracy, sensitivity and specificity aggregation and on recovering the paired run-level outputs and evaluation counts. The supplied one-sided Wilcoxon p-values are nominal comparisons rather than evidence of superiority after every possible multiplicity correction. The results motivate further evaluation of the wrapper; they do not establish early detection, biological validation or clinical readiness.</p></abstract>
<kwd-group kwd-group-type="author"><kwd>Marine predators algorithm</kwd><kwd>Feature selection</kwd><kwd>Breast cancer diagnosis</kwd><kwd>Metaheuristic optimization</kwd><kwd>Wrapper method</kwd><kwd>Support vector machine</kwd><kwd>WDBC dataset</kwd></kwd-group>
</article-meta></front>
<body>
<sec id="sec-1"><label>1</label><title>Introduction</title>
<p>Feature selection can simplify a classifier by restricting the measured descriptors while preserving useful predictive information. The Wisconsin Diagnostic Breast Cancer (WDBC) benchmark contains image-derived nuclear morphology features from fine-needle aspirates of breast masses <xref ref-type="bibr" rid="ref-1">[1]</xref>. It is a retrospective diagnostic classification dataset, rather than a screening cohort or a longitudinal study of early detection. A computational comparison on these records therefore addresses benchmark classification and subset compactness, while clinical benefit requires separate validation.</p>
<p>WDBC contains thirty real-valued descriptors: mean, standard-error and worst-value summaries of ten nuclear attributes <xref ref-type="bibr" rid="ref-1">[1]</xref>. A full search over binary masks has 1,073,741,824 possible masks, exceeding one billion. Correlated descriptors can make several distinct subsets similarly predictive, so a small selected mask does not by itself identify a unique biological mechanism. Compactness is a computational design objective whose practical value depends on measurement cost and external validation.</p>
<p>Marine Predators Algorithm (MPA) uses phased Brownian and Lévy updates, an elite representation and memory-based replacement <xref ref-type="bibr" rid="ref-2">[2]</xref>. These components provide a stochastic search strategy for nonlinear objectives; their original continuous formulation is not automatically a specification of binary feature selection. Here the reported binary adaptation is examined alongside ten alternative optimizers under one wrapper objective.</p>
<p>A useful comparison must separate the optimizer from preprocessing, classifier configuration and evaluation design. Matching population size and iteration count controls two settings but does not guarantee equal objective evaluations. The same untouched test split, paired experimental units and documented binary updates are needed before differences can be attributed to the search procedure.</p>
<p>The study contributes a reported comparison of eleven wrapper search methods, a joint accuracy-cardinality objective and descriptive feature-selection patterns on WDBC. It does not establish that this is the largest comparison in the literature. The statistical and computational interpretation is bounded by the run-level evidence, metric definitions and implementation details described below.</p>
</sec>
<sec id="sec-2"><label>2</label><title>Related Work</title>
<p>The relevant methodological literature concerns the search representation, the classifier within the wrapper and the validity of algorithm comparison. These questions are more directly informative than the biological metaphor associated with each optimizer.</p>
<sec id="sec-3"><label>2.1</label><title>Metaheuristics in Medical Diagnosis</title>
<p>The WDBC repository describes nuclear feature extraction and a separating-plane construction using a small-feature exhaustive search <xref ref-type="bibr" rid="ref-1">[1]</xref>. The present wrapper uses an SVM <xref ref-type="bibr" rid="ref-3">[3]</xref> to score candidate masks. Its results should be compared with earlier methods only under compatible datasets, partitions, preprocessing and tuning protocols; published accuracy numbers from different protocols are not a common leaderboard. Nature-inspired search provides a range of update rules for wrapper optimization <xref ref-type="bibr" rid="ref-2">[2, 4–9]</xref>. Their performance is empirical and problem-dependent. This comparison examines ten alternatives to MPA, but does not establish that other medical feature selectors or simpler deterministic baselines have been exhausted.</p>
</sec>
<sec id="sec-4"><label>2.2</label><title>Feature Selection Paradigms</title>
<p>Filter methods score variables independently of a chosen learner, wrappers evaluate subsets through a fitted prediction model, and embedded methods perform selection within model fitting. A wrapper can capture learner-specific interactions, but repeated scoring can overfit its validation criterion. Final predictive performance must therefore be assessed on data that played no role in selecting the mask or configuring the learner.</p>
<p>The objective studied here is a weighted scalarization of classification error and subset cardinality, rather than a Pareto optimization procedure. Overall accuracy weights errors according to class frequency and does not encode a larger false-negative cost. The coefficient 0.9 is a design choice about accuracy and feature count, not an empirically elicited clinical risk preference.</p>
</sec>
<sec id="sec-5"><label>2.3</label><title>The Marine Predators Algorithm and Comparison Methods</title>
<p>The canonical MPA implementation schedules a Brownian phase, a mixed Brownian-Lévy phase and a late Lévy phase, with elite, memory and environmental perturbation operations <xref ref-type="bibr" rid="ref-2">[2]</xref>. The interpretation of these operations as exploration or exploitation is conditional on the landscape and parameter settings. A best-fitness trace alone cannot identify which component causes an observed gain.</p>
<p>A binary wrapper also needs a precise transfer rule, continuous bounds, clipping convention and empty-mask policy. The reported use of a hyperbolic tangent does not determine these choices. A nonnegative V-shaped probability may use |tanh(z)|, but whether it flips an existing bit or assigns a new bit changes the algorithm. The experimental implementation must determine which rule was actually evaluated.</p>
<p>The comparison includes GA <xref ref-type="bibr" rid="ref-10">[10]</xref>, PSO <xref ref-type="bibr" rid="ref-11">[11]</xref>, DE <xref ref-type="bibr" rid="ref-12">[12]</xref>, ABC <xref ref-type="bibr" rid="ref-13">[13]</xref>, GWO <xref ref-type="bibr" rid="ref-4">[4]</xref>, WOA <xref ref-type="bibr" rid="ref-5">[5]</xref>, HHO <xref ref-type="bibr" rid="ref-6">[6]</xref>, AO <xref ref-type="bibr" rid="ref-7">[7]</xref>, SMA <xref ref-type="bibr" rid="ref-8">[8]</xref> and SSA <xref ref-type="bibr" rid="ref-9">[9]</xref>. This is a specified comparator set rather than the full contemporary metaheuristic landscape. Each continuous-to-binary adaptation and its objective-call budget must be documented consistently.</p>
</sec>
</sec>
<sec id="sec-6"><label>3</label><title>Methodology</title>
<p>The reported protocol combines WDBC, a stratified holdout, five-fold training-partition cross-validation and repeated stochastic search. This section specifies the documented settings and distinguishes them from implementation details required to reproduce the recorded tables.</p>
<sec id="sec-7"><label>3.1</label><title>Dataset Description</title>
<p>WDBC consists of 569 records with thirty morphology features and two classes, 357 benign and 212 malignant <xref ref-type="bibr" rid="ref-2">[2]</xref>. The features describe nuclei from digitized fine-needle aspirates. These are correlated image-derived descriptors, not independently validated molecular biomarkers.</p>
<table-wrap id="tab1"><label>Table 1</label><caption><p>Characteristics of the WDBC dataset.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:2:66,284.6,537.1,390.5"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p><xref ref-type="table" rid="tab1">Table 1</xref> records the dataset properties. There are no missing values in the distributed dataset <xref ref-type="bibr" rid="ref-1">[1]</xref>. The malignant proportion is approximately 37.3%, making sensitivity, specificity and the aggregation of overall accuracy important when interpreting the results.</p>
</sec>
<sec id="sec-8"><label>3.2</label><title>Preprocessing</title>
<p>The reported procedure uses a 70% training and 30% stratified test split and five-fold cross-validation within training. Standardization is estimated from the training partition rather than the test set. For cross-validation fitness, scaling must additionally be fitted inside each training fold to prevent validation-fold information from entering the scaler. The source description does not resolve whether that nesting was implemented, whether the split was fixed across runs, or how SVM C and kernel gamma were chosen. The test set must remain outside mask selection and all tuning.</p>
</sec>
<sec id="sec-9"><label>3.3</label><title>Problem Formulation</title>
<p>A feature mask x is a binary vector of length d = 30, with s selected variables. The minimized scalar objective shown below uses training-only cross-validation accuracy as a fraction in [0,1], combining its complement with normalized mask cardinality. The treatment of an empty mask must be specified because an SVM cannot be fitted without features. No asymmetric clinical error cost or global-optimality guarantee is encoded by this formula.</p>
<p>f(x) = α(1 − AccCV(x)) + (1 − α) , α = 0.9.</p>
</sec>
<sec id="sec-10"><label>3.4</label><title>MPA-Based Wrapper Framework</title>
<p>The wrapper represents a candidate by a continuous search state and a binary feature mask. The mask is evaluated by an SVM using training-partition cross-validation, and the scalar fitness guides the MPA search. The reported phase schedule follows the Brownian, mixed and Lévy phases of MPA <xref ref-type="bibr" rid="ref-2">[2]</xref>. <xref ref-type="fig" rid="fig1">Fig. 1</xref> shows the intended workflow. The evaluated implementation must specify memory replacement, environmental perturbations, phase boundaries and the binary transfer convention; these cannot be reconstructed uniquely from the diagram.</p>
<fig id="fig1"><label>Figure 1</label><caption><p>Links preprocessing, candidate search and repeated wrapper evaluation.</p></caption><graphic xlink:href="https://scfa.reapress.com/public/journals/1/jats-figures/104/fig-1-dea8ed815106.jpg"/></fig>
<p>At termination the procedure returns the best mask found under its computational budget and a classifier fitted without using the test labels. The returned mask is a heuristic solution, not a proven optimum. An interchangeable optimizer interface facilitates comparison only when its data access, scoring and evaluation budgets are controlled.</p>
<sec id="sec-11"><label>3.4.1</label><title>MPA update and binary encoding</title>
<p>In canonical MPA, the first third of the search uses Brownian updates, the middle third splits the population between Brownian and Lévy updates, and the final third uses Lévy updates around the elite state, together with a decaying control factor and memory operations <xref ref-type="bibr" rid="ref-2">[2]</xref>. The manuscript does not provide the complete implemented update equations. Its binary adaptation additionally requires a nonnegative transfer probability, a bit-assignment or bit-flipping rule and a feasible-mask repair. The reported outcomes refer to that implementation; the ecological description alone is not a reproducibility specification.</p>
</sec>
</sec>
<sec id="sec-12"><label>3.5</label><title>Comparison Algorithms and Parameterization</title>
<p>The recorded GA settings are tournament selection, single-point crossover probability 0.8 and bit-flip mutation probability 0.05. PSO uses inertia decreasing from 0.9 to 0.4 and cognitive and social coefficients 2.0. DE uses a rand-to-best mutation strategy, factor 0.5 and crossover probability 0.9. The ABC description specifies a 100-trial abandonment limit but does not uniquely define employed, onlooker and scout allocation. Other optimizers are described as following their source publications <xref ref-type="bibr" rid="ref-4">[4–8]</xref>. Population size 20 and 100 iterations are shared. Applying a transfer function to methods already operating on bits, and additional objective calls in multi-stage updates, must be distinguished in the implementation record.</p>
<table-wrap id="tab2"><label>Table 2</label><caption><p>Common experimental settings shared by all eleven algorithms.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:4:66,663,537.1,757.6"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p>Transfer function tanh (binary) Binary update convention unresolved Weighting alpha 0.9 Reported accuracy-cardinality preference Search dimension d 30 WDBC feature count</p>
<p><xref ref-type="table" rid="tab2">Table 2</xref> records the common design settings. The RBF SVM configuration and its training-only parameter selection must be fixed across optimizers. Equal population size and iterations do not imply an equal number of fitness evaluations, so the table does not by itself prove budget fairness. Thirty stochastic runs describe optimizer variability on the chosen data; they are not thirty independent clinical cohorts.</p>
</sec>
<sec id="sec-13"><label>3.6</label><title>Computational Complexity</title>
<p>Let E be the actual number of mask evaluations, K the number of cross-validation folds and C(n,s) the per-fold fitting and scoring cost for n training observations and s selected features. The principal wrapper cost is approximately E·K·C(n,s), plus search-update and preprocessing costs. Kernel construction contributes O(n²s), while solver cost and memory depend on the SVM implementation and data. Fewer features may reduce kernel construction cost, but no wall-clock advantage follows without measured runtimes, hardware details and objective-call counts.</p>
</sec>
<sec id="sec-14"><label>3.7</label><title>Evaluation Metrics and Statistical Testing</title>
<p>Performance is summarized by accuracy, F1, ROC AUC, sensitivity, specificity and selected-feature count. Malignant is the positive class in the reported encoding. For a common fixed test population, accuracy satisfies Acc = π·Sensitivity + (1−π)·Specificity, where π is malignant prevalence. <xref ref-type="table" rid="tab3">Table 3</xref> requires reconciliation with this identity or an explicit explanation of differing evaluation populations and averaging. The reported one-sided Wilcoxon comparisons use per-run accuracy; valid pairing must share the experimental split and randomization unit <xref ref-type="bibr" rid="ref-14">[14]</xref>. The nominal p-values in <xref ref-type="table" rid="tab5">Table 5</xref> do not independently establish corrected significance.</p>
</sec>
<sec id="sec-15"><label>3.8</label><title>Experimental Protocol</title>
<p>The protocol reports thirty runs of each of eleven methods, totaling 330 optimization runs, with masks, training cross-validation scores, test metrics and convergence traces. Those run-level outputs, code, split indices, classifier parameters and environment versions are required to audit the recorded summaries. The reported Python, scikit-learn and SciPy implementation has no supplied versioned release or execution artifact, so exact numerical reproduction is not established by the present description.</p>
</sec>
</sec>
<sec id="sec-16"><label>4</label><title>Results</title>
<p><xref ref-type="table" rid="tab3">Tables 3</xref>-5 retain the reported numerical summaries, while <xref ref-type="fig" rid="fig2">Figs. 2</xref>-7 retain the recorded visualizations. Rankings describe those summaries. Their inferential and clinical interpretation remains conditional on resolving metric aggregation, run pairing, split integrity and computational budgets.</p>
<sec id="sec-17"><label>4.1</label><title>Classification Performance</title>
<p>In <xref ref-type="table" rid="tab3">Table 3</xref>, MPA has the largest reported mean accuracy, 98.49%, 0.29 percentage points above HHO and 1.12 above the all-feature baseline. Its reported sensitivity is 98.56%. The accuracy standard deviation is 0.23 percentage points, rather than a variance of 0.23%; GA has the largest listed standard deviation, 0.90, followed by PSO at 0.78. These summaries do not prove generalization or stability outside the recorded runs, and their joint confusion-matrix consistency must be resolved.</p>
<table-wrap id="tab3"><label>Table 3</label><caption><p>Classification performance of all eleven algorithms and the all-feature baseline, reported as mean +/- standard deviation over 30 independent runs on the WDBC dataset.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:5:66,549.4,537.1,711.5"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p>The recorded accuracy ordering places MPA, HHO and GWO above 98.1%, with a 0.32-point span. SMA, WOA, DE and AO form an intermediate group. ABC and SSA exceed the all-feature baseline, whereas GA at 97.35% and PSO at 97.22% are below its 97.37%. Thus feature selection does not improve the listed mean accuracy for every optimizer. No mechanism or clinical advantage follows from this ordering alone.</p>
</sec>
<sec id="sec-18"><label>4.2</label><title>Feature Subset Compactness</title>
<p><xref ref-type="table" rid="tab4">Table 4</xref> reports the feature-count means and standard deviations. MPA selects 11.13 variables on average, corresponding to 100(1 − 11.13/30) = 62.9% reduction. HHO and GWO retain means 12.37 and 13.33. PSO and GA retain 18.40 and 17.97. This describes mask size; measuring fewer correlated summaries from the same image does not automatically reduce specimen collection or imaging cost.</p>
<table-wrap id="tab4"><label>Table 4</label><caption><p>Mean number of selected features over 30 runs, with reduction relative to the full 30-feature set.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:5:66,214.9,537.1,365.8"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p>The recorded mean accuracy and subset size both favor MPA within this comparator set. Its 62.9% count reduction exceeds PSO&apos;s 38.7% by 24.2 percentage points. This is a descriptive accuracy-cardinality comparison, not evidence of a universal frontier or a validated eleven-marker clinical panel. <xref ref-type="fig" rid="fig2">Fig. 2</xref> visualizes the subset-count summaries.</p>
<fig id="fig2"><label>Figure 2</label><caption><p>Mean subset counts and one-standard-deviation error bars across runs, with the full thirty-variable set as a reference.</p></caption><graphic xlink:href="https://scfa.reapress.com/public/journals/1/jats-figures/104/fig-2-a1c0f225cd93.jpg"/></fig>
<p>These bars describe variability in count, not agreement in feature identity. Stability of a selected mask would require overlap or selection-frequency analyses and validation on resampled or external data.</p>
</sec>
<sec id="sec-19"><label>4.3</label><title>Convergence Behavior</title>
<p><xref ref-type="fig" rid="fig3">Fig. 3</xref> shows the reported median best-fitness trajectories. MPA decreases early and continues to improve within the recorded iteration budget, while some comparators plateau earlier. Best-fitness traces describe optimizer progress under the scalar objective; they cannot separate the effects of Brownian updates, Lévy steps, memory or binary repair without component ablations.</p>
<fig id="fig3"><label>Figure 3</label><caption><p>The reported median best-fitness trajectories.</p></caption><graphic xlink:href="https://scfa.reapress.com/public/journals/1/jats-figures/104/fig-3-650e13ada36e.png"/></fig>
<p>The recorded terminal objective values broadly follow the accuracy-cardinality ordering. A lower scalar fitness can reflect either lower cross-validation error or fewer variables, and must not be interpreted as test accuracy alone. Comparing traces by iterations also requires objective-call counts because one iteration can contain different amounts of scoring work.</p>
</sec>
<sec id="sec-20"><label>4.4</label><title>Statistical Significance</title>
<p><xref ref-type="table" rid="tab5">Table 5</xref> retains ten reported one-sided Wilcoxon statistics and nominal p-values. The HHO comparison has p = 0.0057 and the GWO comparison p = 0.0010; eight comparisons are listed as p &lt; 0.0001. Nine p-values are therefore at or below 0.001, rather than strictly below it. Paired run outputs and tie handling are needed to reproduce the tests.</p>
<table-wrap id="tab5"><label>Table 5</label><caption><p>Wilcoxon signed-rank test results for the pairwise comparison of MPA against each competitor (one-sided, MPA yields higher accuracy), over 30 independent runs.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:7:66,517.3,537.1,656.9"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p>Multiplicity changes the interpretation of nominal significance. A Bonferroni threshold for ten comparisons is 0.005, which the HHO value 0.0057 does not meet. Holm correction could retain all ten recorded comparisons if the reported nominal p-values and pairing are correct, but adjusted results have not been independently reconstructed from the runs. These tests concern optimizer randomness under the experimental data design, not clinical sampling uncertainty.</p>
<fig id="fig4"><label>Figure 4</label><caption><p>The recorded distributions.</p></caption><graphic xlink:href="https://scfa.reapress.com/public/journals/1/jats-figures/104/fig-4-760ad40679e1.png"/></fig>
<p><xref ref-type="fig" rid="fig4">Fig. 4</xref> displays the recorded accuracy distributions across runs. MPA has the highest central location and the smallest listed accuracy standard deviation. Overlap between distributions, shared test observations and unresolved metric aggregation limit interpretation; the plot does not establish a causal explanation of search behavior.</p>
</sec>
<sec id="sec-21"><label>4.5</label><title>Feature Selection Patterns</title>
<p><xref ref-type="fig" rid="fig5">Fig. 5</xref> displays the reported feature-selection frequencies. Several mean and worst-value morphology descriptors are frequently retained, while many standard-error features are less frequent. A frequency pattern reflects the wrapper, correlated predictors and the data partition; it does not validate the biological role of a feature or show that all low-frequency features are uninformative.</p>
<fig id="fig5"><label>Figure 5</label><caption><p>The reported feature-selection frequencies.</p></caption><graphic xlink:href="https://scfa.reapress.com/public/journals/1/jats-figures/104/fig-5-43efa18ad79d.jpg"/></fig>
<p>The heatmap suggests a common predictive core across methods and differences in how broadly they retain variables. Interpreting sharper frequency differences as a Lévy-driven effect would require an ablation with the same evaluation budget. Identifying a clinically reliable mask additionally requires stability assessment and validation outside WDBC.</p>
<fig id="fig6"><label>Figure 6</label><caption><p>The recorded metrics using normalized radar axes for MPA, HHO, GWO and SMA.</p></caption><graphic xlink:href="https://scfa.reapress.com/public/journals/1/jats-figures/104/fig-6-7d9b7b20d6d7.png"/></fig>
<p><xref ref-type="fig" rid="fig6">Fig. 6</xref> summarizes the recorded metrics using normalized radar axes for MPA, HHO, GWO and SMA. Its apparent polygon areas depend on normalization, axis order and the chosen feature penalty. The tabulated values provide the quantitative comparison; radar area is not a statistical test, utility function or Pareto certificate.</p>
<fig id="fig7"><label>Figure 7</label><caption><p>Mean accuracy against mean subset size.</p></caption><graphic xlink:href="https://scfa.reapress.com/public/journals/1/jats-figures/104/fig-7-4704a66e65a8.png"/></fig>
<p><xref ref-type="fig" rid="fig7">Fig. 7</xref> plots mean accuracy against mean subset size. MPA is the most favorable recorded point in this two-dimensional comparison. The all-feature baseline has the largest count, but exceeds GA and PSO in reported accuracy. This plot illustrates trade-offs among the measured means rather than proving that every feature selector improves generalization.</p>
</sec>
</sec>
<sec id="sec-22"><label>5</label><title>Discussion</title>
<p>The reported tables favor MPA in mean accuracy and subset count, but establish a benchmark observation rather than a general or clinical preference. The interpretation depends on reconciling the metric summaries and documenting the validation and search implementations.</p>
<sec id="sec-23"><label>5.1</label><title>Interpretation of the Recorded Performance</title>
<p>MPA&apos;s phased movement, memory replacement and environmental updates are plausible contributors to search performance <xref ref-type="bibr" rid="ref-2">[2]</xref>. The recorded convergence curves do not isolate their effects. Controlled ablations and matched objective-call budgets would be required to determine whether Lévy movement, memory or the binary encoding explains the observed ordering.</p>
<p>Memory is not unique to MPA: canonical PSO stores personal and global bests <xref ref-type="bibr" rid="ref-11">[11]</xref>, and GA can use elitist retention <xref ref-type="bibr" rid="ref-10">[10]</xref>. The reported standard deviations, 0.23 for MPA and 0.78 for PSO, describe these configurations rather than an inherent stability ordering of their algorithm families. Wilcoxon tests compare output distributions and do not identify a memory mechanism.</p>
</sec>
<sec id="sec-24"><label>5.2</label><title>Exploration Versus Exploitation</title>
<p>Exploration and exploitation depend on both update rules and the evaluated landscape. Larger subsets or early plateaus do not diagnose an optimizer as excessively exploratory or exploitative. The recorded comparison is useful for this wrapper configuration, but a mechanistic interpretation needs controlled changes to the search components and budgets.</p>
<p>HHO and GWO have near-MPA reported accuracies with larger mean masks. HHO&apos;s rapid-dive operations can themselves use Lévy steps <xref ref-type="bibr" rid="ref-6">[6]</xref>, so their absence cannot explain MPA&apos;s result. Compactness may matter in choosing an experimental configuration, but this comparison does not establish clinical superiority or a universally preferred optimizer.</p>
</sec>
<sec id="sec-25"><label>5.3</label><title>Morphological Interpretation</title>
<p>Selected radius, perimeter, area, concavity and concave-point descriptors quantify nuclear morphology <xref ref-type="bibr" rid="ref-1">[1]</xref>. Their frequent selection is compatible with predictive use of size and contour information. Correlation among descriptors and the lack of external biological validation prevent treating the optimizer output as identification of independent disease mechanisms.</p>
<p>Lower selection frequency for standard-error variables does not establish that they lack diagnostic information. The wrapper can substitute correlated descriptors, and a selection pattern on one dataset may change under resampling, a different classifier or a different objective. Biological interpretation should therefore remain descriptive.</p>
</sec>
<sec id="sec-26"><label>5.4</label><title>Comparison with Prior Work</title>
<p>Comparisons with prior medical classifiers require equivalent data, splits, preprocessing, tuning and metrics. Accuracy figures reported under other protocols cannot establish a discriminative ceiling or a state-of-the-art ordering for the present wrapper. The contribution is the specified comparator experiment and its documented limits, rather than a cross-paper accuracy ranking.</p>
<p>The eleven-method suite is broader than a two-method comparison, but its coverage is finite. Formal tests add information only when run pairing and data dependence are explicit <xref ref-type="bibr" rid="ref-14">[14]</xref>. The unresolved confusion-matrix identity and implementation record are more important to validity than the number of competitors or nominally significant p-values.</p>
</sec>
<sec id="sec-27"><label>5.5</label><title>Limitations</title>
<p>This study uses a single retrospective benchmark and one wrapper learner. Training-only cross-validation, scaling nested inside folds, a documented untouched holdout and clear SVM parameter selection are needed to assess leakage. The reported accuracy, sensitivity and specificity require a common averaging convention and paired confusion matrices before performance conclusions can be considered validated.</p>
<p>The fixed population and iteration settings do not prove matched objective-call or tuning budgets. Run-level outputs are also needed to reproduce significance tests and quantify subset identity stability. No prospective cohort, clinical workflow cost, mechanism ablation or independent external validation is reported. These are substantive limits on publication and translation, rather than evidence that the recorded ranking must generalize.</p>
</sec>
</sec>
<sec id="sec-28"><label>6</label><title>Conclusion</title>
<p>The study evaluates an MPA-driven binary wrapper using an SVM and a scalar accuracy-cardinality objective on WDBC. The reported comparison covers ten alternatives and thirty runs per optimizer. The weight 0.9 expresses an accuracy-cardinality preference and does not encode false-negative clinical risk.</p>
<p>The recorded MPA means are 98.49% accuracy, 11.13 selected variables and 98.56% sensitivity, with a 62.9% feature-count reduction and an accuracy standard deviation of 0.23 percentage points. These values are retained as reported. Their joint metric aggregation, paired inferential analysis and execution provenance must be resolved before treating them as validated predictive results. Convergence and feature-frequency figures provide descriptive evidence, not causal component attribution or biological confirmation.</p>
<p>MPA is a candidate wrapper optimizer for further controlled evaluation. The next scientific steps are recovery of masks, split indices, paired predictions, classifier configurations and objective-call logs, followed by a leakage-safe replication and external-cohort validation where clinical claims are intended. The present evidence supports neither an early-detection claim nor a recommendation for deployment.</p>
</sec>
<sec id="sec-29"><title>Funding</title>
<p>This research received no external funding.</p>
</sec>
<sec id="sec-30"><title>Data Availability</title>
<p>Sufficient data is available upon request.</p>
</sec>
<sec id="sec-31"><title>Conflict of Interest</title>
<p>No potential conflict of interest was reported by the authors.</p>
</sec>
<sec id="sec-32"><title>Consent for Publication</title>
<p>All authors have provided their consent for the publication of this manuscript.</p>
</sec>
</body>
<back><ref-list><title>References</title>
<ref id="ref-1"><label>1</label><mixed-citation>Wolberg, W., Mangasarian, O., Street, N., &amp; Street, W. (1993). Breast cancer wisconsin (diagnostic) [Dataset]. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.24432/C5DW2B">https://doi.org/10.24432/C5DW2B</ext-link></mixed-citation></ref>
<ref id="ref-2"><label>2</label><mixed-citation>Faramarzi, A., Heidarinejad, M., Mirjalili, S., &amp; Gandomi, A. H. (2020). Marine predators algorithm: A nature-inspired metaheuristic. Expert systems with applications, 152, 113377. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.eswa.2020.113377">https://doi.org/10.1016/j.eswa.2020.113377</ext-link></mixed-citation></ref>
<ref id="ref-3"><label>3</label><mixed-citation>Cortes, C., &amp; Vapnik, V. (1995). Support-vector networks. Machine learning, 20, 273–297. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/BF00994018">https://doi.org/10.1007/BF00994018</ext-link></mixed-citation></ref>
<ref id="ref-4"><label>4</label><mixed-citation>Mirjalili, S., Mirjalili, S. M., &amp; Lewis, A. (2014). Grey wolf optimizer. Advances in engineering software, 69, 46–61. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.advengsoft.2013.12.007">https://doi.org/10.1016/j.advengsoft.2013.12.007</ext-link></mixed-citation></ref>
<ref id="ref-5"><label>5</label><mixed-citation>Mirjalili, S., &amp; Lewis, A. (2016). The whale optimization algorithm. Advances in engineering software, 95, 51–67. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.advengsoft.2016.01.008">https://doi.org/10.1016/j.advengsoft.2016.01.008</ext-link></mixed-citation></ref>
<ref id="ref-6"><label>6</label><mixed-citation>Heidari, A. A., Mirjalili, S., Faris, H., Aljarah, I., Mafarja, M., &amp; Chen, H. (2019). Harris hawks optimization: Algorithm and applications. Future generation computer systems, 97, 849–872. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.future.2019.02.028">https://doi.org/10.1016/j.future.2019.02.028</ext-link></mixed-citation></ref>
<ref id="ref-7"><label>7</label><mixed-citation>Abualigah, L., Yousri, D., Abd Elaziz, M., Ewees, A. A., Al-Qaness, M. A. A., &amp; Gandomi, A. H. (2021). Aquila Optimizer: A novel meta-heuristic optimization algorithm. Computers &amp; industrial engineering, 157, 107250. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.cie.2021.107250">https://doi.org/10.1016/j.cie.2021.107250</ext-link></mixed-citation></ref>
<ref id="ref-8"><label>8</label><mixed-citation>Li, S., Chen, H., Wang, M., Heidari, A. A., &amp; Mirjalili, S. (2020). Slime mould algorithm: A new method for stochastic optimization. Future generation computer systems, 111, 300–323. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.future.2020.03.055">https://doi.org/10.1016/j.future.2020.03.055</ext-link></mixed-citation></ref>
<ref id="ref-9"><label>9</label><mixed-citation>Mirjalili, S., Gandomi, A. H., Mirjalili, S. Z., Saremi, S., Faris, H., &amp; Mirjalili, S. M. (2017). Salp swarm algorithm: A bio-inspired optimizer for engineering design problems. Advances in engineering software, 114, 163–191. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.advengsoft.2017.07.002">https://doi.org/10.1016/j.advengsoft.2017.07.002</ext-link></mixed-citation></ref>
<ref id="ref-10"><label>10</label><mixed-citation>Holland, J. H. (1992). Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control, and artificial intelligence. MIT Press.</mixed-citation></ref>
<ref id="ref-11"><label>11</label><mixed-citation>Kennedy, J., &amp; Eberhart, R. (1995). Particle swarm optimization. Proceedings of ICNN’95, 4, 1942–1948. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/ICNN.1995.488968">https://doi.org/10.1109/ICNN.1995.488968</ext-link></mixed-citation></ref>
<ref id="ref-12"><label>12</label><mixed-citation>Storn, R., &amp; Price, K. (1997). Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. Journal of global optimization, 11, 341–359. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1023/A:1008202821328">https://doi.org/10.1023/A:1008202821328</ext-link></mixed-citation></ref>
<ref id="ref-13"><label>13</label><mixed-citation>Karaboga, D. (2005). An idea based on honey bee swarm for numerical optimization. <ext-link ext-link-type="uri" xlink:href="https://abc.erciyes.edu.tr/publ.htm">https://abc.erciyes.edu.tr/publ.htm</ext-link></mixed-citation></ref>
<ref id="ref-14"><label>14</label><mixed-citation>Derrac, J., García, S., Molina, D., &amp; Herrera, F. (2011). A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm and evolutionary computation, 1, 3–18. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.swevo.2011.02.002">https://doi.org/10.1016/j.swevo.2011.02.002</ext-link></mixed-citation></ref>
</ref-list></back>
</article>