Showing 1 - 20 results of 208 for search 'context selection algorithm', query time: 0.18s Refine Results
  1. 1

    Proposed genetic algorithm for feature selection. by Shirin Dehghan (19837936)

    Published 2024
    “…</p><p>Method</p><p>The research approached five prominent machine learning algorithms, including Random Forest, Artificial Neural Network (ANN), Support Vector Machine (SVM), Recursive Partitioning and Regression Trees (RPART), and AdaBoost, in the context of IVF success prediction. …”
  2. 2

    The ANFIS algorithm details. by Mohammadmahdi Taheri (21722285)

    Published 2025
    “…In the first stage, the pharmaceutical industry data collected from the Tehran Stock Exchange (TSE) website is used to apply the robust ratio data envelopment analysis (RR-DEA) in GAMS software with respect to some specific financial indicators to determine efficient stocks in conditions of data uncertainty. These selected stocks are then moved to the second stage, where the ANFIS algorithm is employed in MATLAB to predict the final closing prices and calculate the prediction error (RMSE). …”
  3. 3
  4. 4
  5. 5
  6. 6

    Overview of the Cell2Spatial algorithm. by Huamei Li (8815955)

    Published 2025
    Subjects: “…minimizing assignment algorithm…”
  7. 7
  8. 8
  9. 9
  10. 10

    Convergence curves for all algorithms. by Genliang Li (5816264)

    Published 2025
    “…This approach encompasses a novel nonlinear parameter control strategy to balance exploration and exploitation effectively, thereby preventing the algorithm from converging prematurely. Additionally, an adaptive fitness distance balancing mechanism is proposed to prevent premature convergence and enhance search efficiency by selecting high-potential solutions. …”
  11. 11

    Parameter Settings for competitive algorithms. by Genliang Li (5816264)

    Published 2025
    “…This approach encompasses a novel nonlinear parameter control strategy to balance exploration and exploitation effectively, thereby preventing the algorithm from converging prematurely. Additionally, an adaptive fitness distance balancing mechanism is proposed to prevent premature convergence and enhance search efficiency by selecting high-potential solutions. …”
  12. 12
  13. 13
  14. 14

    Details of multiple GWO algorithm variants. by Genliang Li (5816264)

    Published 2025
    “…This approach encompasses a novel nonlinear parameter control strategy to balance exploration and exploitation effectively, thereby preventing the algorithm from converging prematurely. Additionally, an adaptive fitness distance balancing mechanism is proposed to prevent premature convergence and enhance search efficiency by selecting high-potential solutions. …”
  15. 15

    The quantity of selected shares with λ = 0. by Mohammadmahdi Taheri (21722285)

    Published 2025
    “…In the first stage, the pharmaceutical industry data collected from the Tehran Stock Exchange (TSE) website is used to apply the robust ratio data envelopment analysis (RR-DEA) in GAMS software with respect to some specific financial indicators to determine efficient stocks in conditions of data uncertainty. These selected stocks are then moved to the second stage, where the ANFIS algorithm is employed in MATLAB to predict the final closing prices and calculate the prediction error (RMSE). …”
  16. 16

    The quantity of selected shares with λ = 1. by Mohammadmahdi Taheri (21722285)

    Published 2025
    “…In the first stage, the pharmaceutical industry data collected from the Tehran Stock Exchange (TSE) website is used to apply the robust ratio data envelopment analysis (RR-DEA) in GAMS software with respect to some specific financial indicators to determine efficient stocks in conditions of data uncertainty. These selected stocks are then moved to the second stage, where the ANFIS algorithm is employed in MATLAB to predict the final closing prices and calculate the prediction error (RMSE). …”
  17. 17

    The quantity of selected shares with λ = 0.75. by Mohammadmahdi Taheri (21722285)

    Published 2025
    “…In the first stage, the pharmaceutical industry data collected from the Tehran Stock Exchange (TSE) website is used to apply the robust ratio data envelopment analysis (RR-DEA) in GAMS software with respect to some specific financial indicators to determine efficient stocks in conditions of data uncertainty. These selected stocks are then moved to the second stage, where the ANFIS algorithm is employed in MATLAB to predict the final closing prices and calculate the prediction error (RMSE). …”
  18. 18

    The quantity of selected shares with λ = 0.5. by Mohammadmahdi Taheri (21722285)

    Published 2025
    “…In the first stage, the pharmaceutical industry data collected from the Tehran Stock Exchange (TSE) website is used to apply the robust ratio data envelopment analysis (RR-DEA) in GAMS software with respect to some specific financial indicators to determine efficient stocks in conditions of data uncertainty. These selected stocks are then moved to the second stage, where the ANFIS algorithm is employed in MATLAB to predict the final closing prices and calculate the prediction error (RMSE). …”
  19. 19

    The quantity of selected shares with λ = 0.25. by Mohammadmahdi Taheri (21722285)

    Published 2025
    “…In the first stage, the pharmaceutical industry data collected from the Tehran Stock Exchange (TSE) website is used to apply the robust ratio data envelopment analysis (RR-DEA) in GAMS software with respect to some specific financial indicators to determine efficient stocks in conditions of data uncertainty. These selected stocks are then moved to the second stage, where the ANFIS algorithm is employed in MATLAB to predict the final closing prices and calculate the prediction error (RMSE). …”
  20. 20

    Algorithm comparison. by Manxian Yang (20521600)

    Published 2025
    “…Experimental results demonstrate that, compared to random operation directions, the proposed method reduces the path length by 1.9% to 3.1%, decreases the turning frequency by 19.5% to 24.0%, and improves coverage by 1.0% to 1.4%. In the context of multi-machine scheduling, the BNSGA-III algorithm outperforms the NSGA-II, NSGA-III, and MOEA/D algorithms, achieving improvements in total travel distance (12.3% to 34.4%), path balance (60.9% to 66.2%), and workload distribution (78.7% to 92.9%). …”