Search Results - (( java implication based algorithm ) OR ( its selection problem algorithm ))

Refine Results
  1. 1

    Improved Salp Swarm Algorithm based on opposition based learning and novel local search algorithm for feature selection by Tubishat, Mohammad, Idris, Norisma, Shuib, Liyana, Abushariah, Mohammad A.M., Mirjalili, Seyedali

    Published 2020
    “…Two main improvements were included into the original SSA algorithm to alleviate its drawbacks and adapt it for feature selection problems. …”
    Get full text
    Get full text
    Article
  2. 2

    Bats echolocation-inspired algorithms for global optimisation problems by Nafrizuan, Mat Yahya

    Published 2016
    “…The works related to swarm intelligence algorithms include the development of the algorithm itself, its modification and improvisation as well as its application in solving global optimisation problems. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Feature selection and model selection algorithm using incremental mixed variable ant colony optimization for support vector machine classifier by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

    Published 2013
    “…In order to enhance SVM performance, these problems must be solved simultaneously because error produced from the feature subset selection phase will affect the values of the SVM parameters and resulted in low classification accuracy.Most approaches related with solving SVM model selection problem will discretize the continuous value of SVM parameters which will influence its performance.Incremental Mixed Variable Ant Colony Optimization (IACOMV) has the ability to solve SVM model selection problem without discretising the continuous values and simultaneously solve the two problems.This paper presents an algorithm that integrates IACOMV and SVM.Ten datasets from UCI were used to evaluate the performance of the proposed algorithm.Results showed that the proposed algorithm can enhance the classification accuracy with small number of features.…”
    Get full text
    Get full text
    Get full text
    Article
  4. 4
  5. 5

    Some metaheuristic algorithms for solving multiple cross-functional team selection problems by Ngo, S.T., Jaafar, J., Izzatdin, A.A., Tong, G.T., Bui, A.N.

    Published 2022
    “…The team selection problem has become more complicated in order to achieve multiple goals in its decision-making process. …”
    Get full text
    Get full text
    Article
  6. 6
  7. 7

    Adaptive differential evolution algorithm with fitness based selection of parameters and mutation strategies / Rawaa Dawoud Hassan Al-Dabbagh by Rawaa Dawoud Hassan, Al-Dabbagh

    Published 2015
    “…The performance of DE algorithm depends heavily on the selected mutation strategy and its associated control parameters. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Metaheuristic algorithms for feature selection (2014–2024) by Faizan, Muhammad, Muhammad Arif, Mohamad

    Published 2025
    “…Metaheuristic algorithms are suited to provide solutions to feature selection problems because these problems are combinatorial and require an effective and efficient search through large solution spaces. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Binary whale optimization algorithm with logarithmic decreasing time-varying modified sigmoid transfer function for descriptor selection problem by Yusof, Norfadzlia Mohd, Muda, Azah Kamilah, Pratama, Satrya Fajri, Carbo-Dorca, Ramon, Abraham, Ajith

    Published 2023
    “…The new Binary Whale Optimization Algorithm is integrated with wrapper feature selection and validated on descriptor selection problem to improve Amphetamine-type stimulants drug classification result. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

    Evolutionary algorithm with roulette-tournament selection for solving aquaculture diet formulation by Abd Rahman, Rosshairy, Ramli, Razamin, Jamari, Zainoddin, Ku-Mahamud, Ku Ruhana

    Published 2016
    “…In this paper, a new selection operator is introduced for a real valued encoding problem, which specifically exists in a shrimp diet formulation problem.This newly developed selection operator is a hybrid between two well-known established selection operators: roulette wheel and binary tournament selection.A comparison of the performance of the proposed operator and the other existing operator was made for evaluation purposes.The result shows that the proposed roulette-tournament selection is better in terms of its ability to provide many good feasible solutions when a population size of 30 is used.Thus, the proposed roulette-tournament is suitable and comparable to established selection for solving a real valued shrimp diet formulation problem.The selection operator can also be generalized to any problems related to EA.…”
    Get full text
    Get full text
    Get full text
    Article
  11. 11
  12. 12
  13. 13

    Enhanced Adaptive Confidence-Based Q Routing Algorithms For Network Traffic by Yap, Soon Teck

    Published 2004
    “…The CDRQ Routing Algorithm provides a solution to the problem addressed above by integrating the advantages of CQ Routing Algorithm and Dual Reinforcement Learning. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Improved Manta Ray Foraging Optimizer-based SVM for Feature Selection Problems: A Medical Case Study by Got, Adel, Zouache, Djaafar, Moussaoui, Abdelouahab, Laith, Abualigah *, Alsayat, Ahmed

    Published 2024
    “…The experimental results show the high ability of the proposed algorithm to find the appropriate SVM’s parameters, and its acceptable performance to deal with feature selection problem.…”
    Get full text
    Get full text
    Article
  15. 15

    Investigation of evolutionary multi-objective algorithms in solving view selection problem / Seyed Hamid Talebian by Talebian, Seyed Hamid

    Published 2013
    “…In this research, we showed how evolutionary multi-objective algorithms can be used to solve the view selection problem and its advantage over classical optimization problems were described. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Dynamic Probability Selection for Flower Pollination Algorithm based on Metropolis-hastings Criteria by Zamli, Kamal Zuhairi, Din, Fakhrud, Nasser, Abdullah, Ramli, Nazirah, Mohamed, Noraini

    Published 2021
    “…Flower Pollination Algorithm (FPA) is a relatively new meta-heuristic algorithm that adopts its metaphor from the proliferation role of flowers in plants. …”
    Get full text
    Get full text
    Article
  17. 17

    Suitability Factor on the Capacitated Vehicle Routing Problem by Md Rais, Helmi, Ali Othman, Zulaiha, Hamdan, Abdul Razak

    Published 2010
    “…It has been applied in Capacitated Vehicle Routing Problem (CVRP). Therefore, this research aims to improve its solution by applying elitist ant concept, rearrange its selection of candidates and to include current status of vehicle capacity as part of its decision making. …”
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    Robust variable selection methods for large- scale data in the presence of multicollinearity, autocorrelated errors and outliers by Uraibi, Hassan S.

    Published 2016
    “…To overcome the instability selection problem, a stability selection approach is put forward to enhance the performance of single-split variable selection method. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Improved whale optimization algorithm for feature selection in Arabic sentiment analysis by Tubishat, Mohammad, Abushariah, Mohammad A.M., Idris, Norisma, Aljarah, Ibrahim

    Published 2019
    “…To overcome these problems, two improvements for WOA algorithm are proposed in this paper. …”
    Get full text
    Get full text
    Article
  20. 20

    Multi-Objective Search Group Algorithm for engineering design problems by Huy, T.H.B., Nallagownden, P., Truong, K.H., Kannan, R., Vo, D.N., Ho, N.

    Published 2022
    “…The MOSGA is validated on twenty-five prominent case studies, including nineteen unconstrained multi-objective benchmark problems, six constrained multi-objective benchmark problems, and five multi-objective engineering design problems to validate its capability and effectiveness. …”
    Get full text
    Get full text
    Article