Search Results - (( variable selection proposed algorithm ) OR ( java simulation optimization algorithm ))

Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection by Nwogbaga, Nweso Emmanuel, Latip, Rohaya, Affendey, Lilly Suriani, Abdul Rahiman, Amir Rizaan

“…The simulation is implemented with iFogSim and java programming language. …”
Get full text
Get full text

Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

“…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
Get full text
Get full text
Get full text

Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

“…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
Get full text
Get full text
Get full text

Dynamic Bayesian Networks and Variable Length Genetic Algorithm for Dialogue Act Recognition by Ali Yahya, Anwar

“…The preparation phase transforms the original dialogue corpus into phrases space. In the selection phase, a new variable length genetic algorithm is applied to select the lexical cues. …”
Get full text
Get full text

Taguchi?s T-method with Normalization-Based Binary Bat Algorithm by Marlan Z.M., Jamaludin K.R., Harudin N.

“…Therefore, a variable selection technique using a swarm-based Binary Bat algorithm is proposed. …”

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

“…However, the original HHO is developed to solve the continuous optimization problems, but not to the problems with binary variables. This paper proposes the binary version of HHO (BHHO) to solve the feature selection problem in classification tasks. …”
Get full text
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

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

“…The results signify that our proposed RNGVS.RFCH method able to correctly select the important variables in the final model. …”
Get full text
Get full text

Dynamic Bayesian networks and variable length genetic algorithm for designing cue-based model for dialogue act recognition by Yahya, Anwar Ali, Mahmod, Ramlan, Ramli, Abd Rahman

“…In the second stage, the developed variable length genetic algorithm is used to select different sets of lexical cues to constitute the dynamic Bayesian networks' random variables. …”
Get full text
Get full text

OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

“…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”

A meta-heuristics based input variable selection technique for hybrid electrical energy demand prediction models by ul Islam, B., Baharudin, Z.

“…The focus of the paper is to propose a hybrid approach for the selection of the most influential input variables for the training and testing of neural network based hybrid models. …”
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

“…Support Vector Machine (SVM) is a present day classification approach originated from statistical approaches.Two main problems that influence the performance of SVM are selecting feature subset and SVM model selection. 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

Mixed-variable ant colony optimisation algorithm for feature subset selection and tuning support vector machine parameter by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…Experimental results obtained from the proposed algorithm are better compared with other approaches in terms of classification accuracy and feature subset selection.…”
Get full text
Get full text

Robust diagnostics and variable selection procedure based on modified reweighted fast consistent and high breakdown estimator for high dimensional data by Baba, Ishaq Abdullahi

“…The performance of the proposed method is illustrated using simulation study and on glass vessel data with 1920 variables, cardiomyopathy microarray data with 6319 variables, and octane data with 226 dimensions. …”
Get full text
Get full text

New selection algorithm for Mengubah Destini Anak Bangsa (MDAB) students / Zamali Tarmudi ... [et al.] by Tarmudi, Zamali, Saibin, Tammie Christy, Naharu, Nasrah, Ung, Ling Ling

“…This research introduces a new algorithm to select students from low income family the so-called Mengubah Destini Anak Bangsa (MDAB) using fuzzy approach. …”
Get full text
Get full text

Characteristic wavelength optimization for partial least squares regression using improved flower pollination algorithm by Pauline Ong, Pauline Ong, Jinbao Jian, Jinbao Jian, Jianghua Yin, Jianghua Yin, Guodong Ma, Guodong Ma

“…This study proposes a new wavelength selection method, interval flower pollination algorithm (iFPA), for spectral variable selection in the partial least squares regression (PLSR) model. …”
Get full text
Get full text
Get full text

Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

“…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
Get full text
Get full text

Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data by Qadir Saraf, Tara Othman, Fuad, Norfaiza, Md Taujuddin, Nik Shahidah Afifi

“…In order to fill this gap, this article proposes a novel framework for comparing various variants of variable length-searching meta-heuristic algorithms in the application of feature selection. …”
Get full text
Get full text
Get full text

Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data by Qadir Saraf, Tara Othman, Fuad, Norfaiza, Md Taujuddin, Nik Shahidah Afifi

“…In order to fill this gap, this article proposes a novel framework for comparing various variants of variable length-searching meta-heuristic algorithms in the application of feature selection. …”
Get full text
Get full text
Get full text

Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data by Qadir Sara, Tara Othman, Fuad, Norfaiza, Md Taujuddin, Nik Shahidah Afifi

“…In order to fill this gap, this article proposes a novel framework for comparing various variants of variable length-searching meta-heuristic algorithms in the application of feature selection. …”
Get full text
Get full text
Get full text