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

Refine Results
  1. 1

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

    Published 2013
    “…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
    Article
  2. 2

    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
    “…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. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    SURE-Autometrics algorithm for model selection in multiple equations by Norhayati, Yusof

    Published 2016
    “…This automatic model selection algorithm is better than non-algorithm procedure which requires knowledge and extra time. …”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    Model structure selection for a discrete-time non-linear system using genetic algorithm by Ahmad, Robiah, Jamaluddin , Hishamuddin, Hussain, Mohd. Azlan

    Published 2004
    “…The results show that the proposed algorithm can be employed as an algorithm to select the structure of the proposed model.…”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    Algorithmic approaches in model selection of the air passengers flows data by Ismail, Suzilah, Yusof, Norhayati, Tuan Muda, Tuan Zalizam

    Published 2015
    “…Algorithm is an important element in any problem solving situation.In statistical modelling strategy, the algorithm provides a step by step process in model building, model testing, choosing the ‘best’ model and even forecasting using the chosen model.Tacit knowledge has contributed to the existence of a huge variability in manual modelling process especially between expert and non-expert modellers.Many algorithms (automated model selection) have been developed to bridge the gap either through single or multiple equation modelling.This study aims to evaluate the forecasting performances of several selected algorithms on air passengers flow data based on Root Mean Square Error (RMSE) and Geometric Root Mean Square Error (GRMSE).The findings show that multiple models selection performed well in one and two step-ahead forecast but was outperformed by single model in three step-ahead forecasts.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6

    Model structure selection for a discrete-time non-linear system using a genetic algorithm by Ahmad, R., Jamaluddin, H., Hussain, M. A.

    Published 2004
    “…The results show that the proposed algorithm can be employed as an algorithm to select the structure of the proposed model.…”
    Get full text
    Get full text
    Article
  7. 7

    Model structure selection for a discrete-time non-linear system using a genetic algorithm by Ahmad, R., Jamaluddin, H., Hussain, M. A.

    Published 2004
    “…The results show that the proposed algorithm can be employed as an algorithm to select the structure of the proposed model.…”
    Get full text
    Get full text
    Article
  8. 8

    Development of committee machine models for multiple response optimization problems by Golestaneh, Seyed Jafar

    Published 2014
    “…Four methodologies are to make four different CM models to solve MRO problems. The fifth methodology proposes the final algorithm which uses four CM models together to solve MRO problems. …”
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10

    Process Sequencing Modeled as TSP with Precedence Constraints - A Genetic Algorithm Approach by N. M., Razali

    Published 2014
    “…The process sequencing problem can be modeled as the travelling salesman problem with precedence constraints (TSPPC). …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    Dynamic Robust Bootstrap Algorithm for Linear Model Selection Using Least Trimmed Squares by Uraibi, Hassan Sami

    Published 2009
    “…The results show that the DRBLTS is more efficient than other estimators discussed in this thesis. The results on the model selection again signify that our proposed robust bootstrap model selection method is more robust than the classical bootstrap model selection.…”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    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
    “…We can find solutions to the team selection problem in many different areas. The problem solver needs to scan across a large array of available solutions during their search. …”
    Get full text
    Get full text
    Article
  14. 14

    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
  15. 15

    Deterministic Mutation-Based Algorithm for Model Structure Selection in Discrete-Time System Identification by Abd Samad, Md Fahmi

    Published 2011
    “…A deterministic mutation-based algorithm is introduced to overcome this problem. Identification studies using NARX (Nonlinear AutoRegressive with eXogenous input) models employing simulated systems and real plant data are used to demonstrate that the algorithm is able to detect significant variables and terms faster and to select a simpler model structure than other well-known EC methods.…”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Fuzzy Rules Optimization in Fuzzy Expert System for Machinability Data Selection: Genetic Algorithms Approach by Wong, Shaw Voon, Salem Hamouda, Abdel Magid

    Published 2001
    “…(Wong et aL 1997) developed fuzzy models for machinability data selection. There are more than 2 x 1029 possible sets of rules for each model. …”
    Get full text
    Get full text
    Article
  17. 17

    Model structure selection for a discrete-time non-linear system using a genetic algorithm by Ahmad, R., Jamaluddin, H., Hussain, Mohd Azlan

    Published 2004
    “…The results show that the proposed algorithm can be employed as an algorithm to select the structure of the proposed model.…”
    Get full text
    Get full text
    Article
  18. 18

    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
  19. 19

    Hybrid Artificial Bees Colony algorithms for optimizing carbon nanotubes characteristics by Mohammad Jarrah, Mu'ath Ibrahim

    Published 2018
    “…Optimization is a crucial process to select the best parameters in single and multi-objective problems for manufacturing process.However,it is difficult to find an optimization algorithm that obtain the global optimum for every optimization problem.Artificial Bees Colony (ABC) is a well-known swarm intelligence algorithm in solving optimization problems.It has noticeably shown better performance compared to the state-of-art algorithms.This study proposes a novel hybrid ABC algorithm with β-Hill Climbing (βHC) technique (ABC-βHC) in order to enhance the exploitation and exploration process of the ABC in optimizing carbon nanotubes (CNTs) characteristics.CNTs are widely used in electronic and mechanical products due to its fascinating material with extraordinary mechanical,thermal,physical and electrical properties. …”
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    Genetic algorithm to optimize routing problem modelled as the travelling salesman problem by Muhammad Azrul Faiz , Nor Adzmi

    Published 2013
    “…This study presents genetic algorithm (GA) to solve routing problem modelled as the travelling salesman problem (TSP). …”
    Get full text
    Get full text
    Undergraduates Project Papers