Search Results - (( using selection problem algorithm ) OR ( evolution optimization mining algorithm ))

Class binarization with self-adaptive algorithm to improve human activity recognition by Zainudin, Muhammad Noorazlan Shah

“…However, the learning complexity of classification is increased due to the expansion number of learning model. Therefore, feature selection using Relief-f with self-adaptive Differential Evolution (rsaDE) algorithm is proposed to select the most significant features. …”
Get full text
Get full text

Y-type Random 2-satisfiability In Discrete Hopfield Neural Network by Guo, Yueling

“…During the retrieval phase, a new activation function and Swarm Mutation were proposed to ensure the diversity of the neuron states. The proposed algorithm and mutation mechanism showed optimal performances as compared to the existing algorithms. …”
Get full text
Get full text

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

“…A new self-adaptive hybrid algorithm (CSCMAES) is introduced for optimization. …”
Get full text
Get full text

Seed disperser ant algorithm for optimization / Chang Wen Liang by Chang , Wen Liang

“…The Seed Disperser Ant Algorithm (SDAA) is developed based on the evolution or expansion process of Seed Disperser Ant (Aphaenogaster senilis) colony. …”
Get full text
Get full text
Get full text

Classification with degree of importance of attributes for stock market data mining by Khokhar, Rashid Hafeez, Md. Sap, Mohd. Noor

“…The experimental results show that predictive FDT algorithm can generate a relatively optimal tree without much computation effort (comprehensibility), and WFPRs have a better predictive accuracy of stock market time series data. …”
Get full text
Get full text

Formulating new enhanced pattern classification algorithms based on ACO-SVM by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…ACO originally deals with discrete optimization problem.In applying ACO for solving SVM model selection problem which are continuous variables, there is a need to discretize the continuously value into discrete values.This discretization process would result in loss of some information and hence affects the classification accuracy and seeking time.In this algorithm we propose to solve SVM model selection problem using IACOR without the need to discretize continuous value for SVM.The second algorithm aims to simultaneously solve SVM model selection problem and selects a small number of features.SVM model selection and selection of suitable and small number of feature subsets must occur simultaneously because error produced from the feature subset selection phase will affect the values of SVM model selection and result in low classification accuracy.In this second algorithm we propose the use of IACOMV to simultaneously solve SVM model selection problem and features subset selection.Ten benchmark datasets were used to evaluate the proposed algorithms.Results showed that the proposed algorithms can enhance the classification accuracy with small size of features subset.…”
Get full text
Get full text
Get full text

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

“…An improved version of Salp Swarm Algorithm (ISSA) is proposed in this study to solve feature selection problems and select the optimal subset of features in wrapper-mode. …”
Get full text
Get full text

Dengue classification system using clonal selection algorithm / Karimah Mohd by Mohd, Karimah

“…Some popular intelligent techniques like Genetic Algorithm, Fuzzy Logic and Artificial Neural Network are often used by reasearcher to perform classifcation problems. …”
Get full text
Get full text

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

“…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

A Comparative Study on three Component Selection Mechanisms for Hyper-Heuristics in Expensive Optimization by Jia Hui Ong, Jason Teo

“…Numerous studies in optimization problems often lead to tailoring a specific algorithm to adapt to the problem instances, especially in expensive optimization problems. …”
Get full text
Get full text
Get full text

Diagnosis of eyesight using Improved Clonal Selection Algorithm (ICLONALG) / Nor Khirda Masri by Masri, Nor Khirda

“…This study aims to implement the classification algorithm using the Improved Clonal Selection Algorithm (ICLONALG) to classify the eyesight’s problems. …”
Get full text
Get full text

Static and self-scalable filter range selection algorithms for peer-to-peer networks by Kweh, Yeah Lun

“…The research works were implemented by simulation in which it was used to identify the selection problem, implementation of the proposed algorithms and the measurement of the results. …”
Get full text
Get full text

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

“…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

Broadening selection competitive constraint handling algorithm for faster convergence by Shaikh, T.A., Hussain, S.S., Tanweer, M.R., Hashmani, M.A.

“…The proposed algorithm has been evaluated using 24 benchmark functions. …”
Get full text
Get full text

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

“…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

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

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

Enhanced selection method for genetic algorithm to solve traveling salesman problem by Jubeir, Mohammed, Almazrooie, Mishal, Abdullah, Rosni

“…Genetic algorithms (GAs) have been applied by many researchers to get an optimized solution for hard problems such as Traveling Salesman Problem (TSP). …”
Get full text
Get full text
Get full text

Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences by Rajesvary Rajoo R., Salam R.A.

A prototype for driving school instructor timetabling using case-based heuristics selection algorithm / CT Munnirah Niesha Mohd Shafee by Mohd Shafee, CT Munnirah Niesha

“…The specification with both hard constraints which must be satisfied and soft constraint which should satisfied. This problem can be solved using Case-Based Heuristics Selection approaches. …”
Get full text
Get full text

Genetic Algorithm Performance with Different Selection Strategies in Solving TSP by Noraini, Mohd Razali, Geraghty, John

“…There are several ways for selection. This paper presents the comparison of GA performance in solving travelling salesman problem (TSP) using different parent selection strategy. …”
Get full text
Get full text