Search Results - (( evolution classification _ algorithm ) OR ( problem implementation based algorithm ))

Algorithmic design issues in adaptive differential evolution schemes: Review and taxonomy by Al-Dabbagh, Rawaa Dawoud, Neri, Ferrante, Idris, Norisma, Baba, Mohd Sapiyan

“…A trend that has emerged recently is to make the algorithm parameters automatically adapt to different problems during optimization, thereby liberating the user from the tedious and time-consuming task of manual setting. …”
Get full text
Get full text

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

“…Differential evolution (DE) is a simple yet powerful evolutionary algorithm (EA). …”
Get full text
Get full text

Feature selection optimization using hybrid relief-f with self-adaptive differential evolution by Zainudin, Muhammad Noorazlan Shah, Sulaiman, Md. Nasir, Mustapha, Norwati, Perumal, Thinagaran, Ahmad Nazri, Azree Shahrel, Mohamed, Raihani, Abd Manaf, Syaifulnizam

“…Differential evolution (DE) is one of the evolutionary algorithms that are widely used in various classification domains. …”
Get full text
Get full text
Get full text

Design Of Feature Selection Methods For Hand Movement Classification Based On Electromyography Signals by Too, Jing Wei

“…In this regard, this thesis proposes five FS methods for efficient EMG signals classification. The first method is the Binary Tree Growth Algorithm (BTGA), which implements a hyperbolic tangent function to convert the Tree Growth Algorithm into the binary version. …”
Get full text
Get full text
Get full text
Get full text

Multi-Objective Hybrid Algorithm For The Classification Of Imbalanced Datasets by Saeed, Sana

“…The proposed algorithm is grounded on the two famous metaheuristic algorithms: cuckoo search (CS) and covariance matrix adaptation evolution strategy (CMA-es). …”
Get full text
Get full text

Differential evolution for neural networks learning enhancement by Ismail Wdaa, Abdul Sttar

“…Evolutionary computation is the name given to a collection of algorithms based on the evolution of a population toward a solution of a certain problem. …”
Get full text
Get full text
Get full text

Effective EEG channels for emotion identification over the brain regions using differential evolution algorithm by Al-Qazzaz, Noor Kamal, Sabir, Mohannad K., Md. Ali, Sawal Hamid, Ahmad, Siti Anom, Grammer, Karl

“…The spectral features were performed by employing the relative spectral powers of delta (δRP), theta (θRP), alpha (αRP), beta (βRP), and gamma (γRP). The differential evolution-based channel selection algorithm (DEFS_Ch) was computed to find the most suitable EEG channels that have the greatest efficacy for identifying the various emotional states of the brain regions. …”
Get full text
Get full text

An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

“…We have chosen four neighborhood based algorithms which are commonly used in optimization problems and divided them in newly implemented and re-implemented category. …”
Get full text
Get full text

Enhancing Market-Based Scheduling Algorithm on Globally Distributed Web Servers Using Least Suitable Sealed Bid Technique by Al-Ewiwi, Mahmoud

“…Scheduling of a multiple distributed servers is considered as a complex problem.considered as NP-complete problem,where no single efficient algorithm guaranteed to produce optimal results.This thesis investigates on how to find optimal solution for distribute system,by implementing market based scheduling Algorithm(MBSA).On implementing the MBSA, a new auction technique which is the least suitable sealed bid auction will be introduced.it is found that least suitable sealed bid technique will give the close-to-optimum solution.In the implementation, cooperative agents were used as a middleware between web servers and stand-alone schedulers. …”
Get full text
Get full text

A New Quadratic Binary Harris Hawk Optimization For Feature Selection by Abdullah, Abdul Rahim, Too, Jing Wei, Mohd Saad, Norhashimah

“…In this study, twenty-two datasets collected from the UCI machine learning repository are used to validate the performance of proposed algorithms. A comparative study is conducted to compare the effectiveness of QBHHO with other feature selection algorithms such as binary differential evolution (BDE), genetic algorithm (GA), binary multi-verse optimizer (BMVO), binary flower pollination algorithm (BFPA), and binary salp swarm algorithm (BSSA). …”
Get full text
Get full text
Get full text

Intersection Features For Android Botnet Classification by Ismail, Najiahtul Syafiqah, Yusof, Robiah, Saad, Halizah, Abdollah, Mohd Faizal, Yusof, Robiah

“…This paper proposed an enhancement approach for Android botnet classification based on features selection and classification algorithms. …”
Get full text
Get full text
Get full text

Low-level hybridization scripting language with dynamic parameterization in PSO-GA / Suraya Masrom by Masrom, Suraya

“…However, in many cases, implementing the suitable hybrid algorithms for a given optimization problem is a considerably difficult, which in most cases, is time consuming. …”
Get full text
Get full text

Chaotic Immune Symbiotic Organisms Search algorithm for solving optimisation problem by Zamani M.K.M., Musirin I., Suliman S.I., Mustaffa S.A.S.

“…Good performance of these heuristics-based algorithm has been implied through various implementation in solving optimisation problems. …”

AAβ public key cryptosystem - a new practical asymmetric implementation based on the square root problem by Mahad, Zahari, Kamel Ariffin, Muhammad Rezal

Get full text
Get full text
Get full text

Parallel distributed genetic algorithm development based on microcontrollers framework by Krishnan P.S., Kiong T.S., Koh J.

“…This work is focused on the implementation of evolutionary based computer algorithms, genetic algorithms (GAs), on microcontrollers. …”

Improving Ant Swarm Optimization With Embedded Vaccination For Optimum Reducts Generation by Pratiwi, Lustiana, Choo, Yun Huoy, Draman @ Muda, Azah Kamilah, Draman @ Muda, Noor Azilah

“…Unlike a conventional PSOIACO algorithm, this hybrid algorithm shows improvement of the classification accuracy in its generated rough reducts to solve NP-Hard problem. …”
Get full text
Get full text

EMG Feature Selection And Classification Using A Pbest-Guide Binary Particle Swarm Optimization by Too, Jing Wei, Tee, Wei Hown, Abdullah, Abdul Rahim, Mohd Saad, Norhashimah

“…In order to measure the effectiveness of PBPSO, binary particle swarm optimization (BPSO), genetic algorithm (GA), modified binary tree growth algorithm (MBTGA), and binary differential evolution (BDE) were used for performance comparison. …”
Get full text
Get full text
Get full text

Genetic ensemble biased ARTMAP method of ECG-Based emotion classification by Loo, C.K., Liew, W.S., Sayeed, M.S.

“…Individual emotional states are highly variable and are subject to evolution from personal experiences. For this reason, the above system is designed to be able to perform learning and classification in real-time to account for inter-individual and intra-individual emotional drift over time. …”
Get full text
Get full text

A New Co-Evolution Binary Particle Swarm Optimization With Multiple Inertia Weight Strategy For Feature Selection by Too, Jing Wei, Abdullah, Abdul Rahim, Mohd Saad, Norhashimah

“…To examine the effectiveness of proposed method, four recent and popular feature selection methods namely BPSO, genetic algorithm (GA), binary gravitational search algorithm (BGSA) and competitive binary grey wolf optimizer (CBGWO) are used in a performance comparison. …”
Get full text
Get full text
Get full text

Quantum Processing Framework And Hybrid Algorithms For Routing Problems by Soltan Aghaei, Mohammad Reza

“…The designed hybrid architecture and framework were tested using the above quantum algorithms and the existing quantum algorithms. Implementing and simulating results are then represented based on the probabilistic hybrid algorithm in the case of linear array, binary heap and quantum search for dense and sparse graphs.…”
Get full text
Get full text