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

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

“…ACOMV-SVM algorithm is able to simultaneously tune SVM parameters and feature subset selection. …”
Get full text
Get full text

Hybrid ACO and SVM algorithm for pattern classification by Alwan, Hiba Basim

“…This study presents four algorithms for tuning the SVM parameters and selecting feature subset which improved SVM classification accuracy with smaller size of feature subset. …”
Get full text
Get full text
Get full text

Mixed variable ant colony optimization technique for feature subset selection and model selection by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…This paper presents the integration of Mixed Variable Ant Colony Optimization and Support Vector Machine (SVM) to enhance the performance of SVM through simultaneously tuning its parameters and selecting a small number of features.The process of selecting a suitable feature subset and optimizing SVM parameters must occur simultaneously,because these processes affect each ot her which in turn will affect the SVM performance.Thus producing unacceptable classification accuracy.Five datasets from UCI were used to evaluate the proposed algorithm.Results showed that the proposed algorithm can enhance the classification accuracy with the small size of features subset.…”
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

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

Integrated ACOR/IACOMV-R-SVM Algorithm by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…This paper presents two algorithms that can simultaneously tune SVM parameters and select the feature subset. …”
Get full text
Get full text
Get full text

Short-term electricity price forecasting in deregulated electricity market based on enhanced artificial intelligence techniques / Alireza Pourdaryaei by Alireza , Pourdaryaei

“…In the developed method of multi-objective feature determination, MOBBSA is used to search within different combinations of input variables and to select the non-dominated feature subsets. …”
Get full text
Get full text
Get full text

Intelligent classification algorithms in enhancing the performance of support vector machine by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…This paper presents two intelligent algorithms that hybridized between ant colony optimization (ACO) and SVM for tuning SVM parameters and selecting feature subset without having to discretize the continuous values. …”
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 findings show that the RFCH.cor is more robust than the Adj.Winso.cor in the presence of multivariate outliers. Forward selection (FS) is very effective variable selection procedure for selecting a parsimonious subset of covariates from a large number of candidate covariates. …”
Get full text
Get full text

Bayesian random forests for high-dimensional classification and regression with complete and incomplete microarray data by Oyebayo, Olaniran Ridwan

“…The new procedure called Bayesian Random Forest (BRF) focuses on modification of terminal node parameter estimation and selection of random subsets for splitting. BRF algorithm combines the strengths of random subset and greedy selection procedures in creating new maximal ordered variable relevance weights. …”
Get full text
Get full text
Get full text
Get full text

Using fuzzy association rule mining in cancer classification by Mahmoodian, Sayed Hamid, Marhaban, Mohammad Hamiruce, Abdul Rahim, Raha, Rosli, Rozita, Saripan, M. Iqbal

“…In addition, creating a fuzzy classifier with high performance in classification that uses a subset of significant genes which have been selected by different types of gene selection methods is another goal of this study. …”
Get full text
Get full text

Long-term electrical energy consumption: Formulating and forecasting via optimized gene expression programming / Seyed Hamidreza Aghay Kaboli by Seyed Hamidreza , Aghay Kaboli

“…In the developed feature selection approach, multi-objective binary-valued backtracking search algorithm (MOBBSA) is used as an efficient evolutionary search algorithm to search within different combinations of input variables and selects the non-dominated feature subsets, which minimize simultaneously both the estimation error and the number of features. …”
Get full text
Get full text
Get full text

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

Feature selection methods for optimizing clinicopathologic input variables in oral cancer prognosis by Chang, S.W., Kareem, S.A., Kallarakkal, A.F., Merican, A.F., Abraham, M.T., Zain, R.B.

“…However, due to time, cost and tissue limitations, the number of prognosis variables need to be reduced. In this research, we demonstrated the use of feature selection methods to select a subset of variables that is highly predictive of oral cancer prognosis. …”
Get full text
Get full text

Improving hand written digit recognition using hybrid feature selection algorithm by Wong, Khye Mun

“…While mRMR was capable of identifying a subset of features that were highly relevant to the targeted classification variable, it still carry the weakness of capturing redundant features along with the algorithm. …”
Get full text
Get full text

Development of genetic algorithm for optimization of yield models in oil palm production by Hilal, Yousif Y., Wan Ismail, Wan Ishak, Yahya, Azmi, Ash’aari, Zulfa Hanan

“…Nonetheless, the advance in computer technology has created a new opportunity for the study of modelling as selecting variables intended to choose the “best” subset of predictors. …”
Get full text
Get full text
Get full text

The framework of weighted subset-hood Mamdani fuzzy rule based system rule extraction (MFRBS-WSBA) for forecasting electricity load demand by Mansor, Rosnalini, Mat Kasim, Maznah, Othman, Mahmod

“…Fuzzy rules are very important elements that should be taken consideration seriously when applying any fuzzy system.This paper proposes the framework of Mamdani Fuzzy Rule-based System with Weighted Subset-hood Based Algorithm (MFRBS-WSBA) in the fuzzy rule extraction for electricity load demand forecasting.The framework consist of six main steps: (1) Data Collection and Selection; (2) Preprocessing Data; (3) Variables Selection; (4) Fuzzy Model; (5) Comparison with Other FIS and (6) Performance Evaluation. …”
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

The performance of Taguchi�s T-method with binary bat algorithm based on great value priority binarization for prediction by Marlan Z.M., Ramlie F., Jamaludin K.R., Harudin N.

“…In enhancing prediction accuracy, the T-method employed Taguchi�s orthogonal array as a variable selection approach to determine a subset of independent variables that are significant toward the dependent variable or output. …”