Search Results - (( variable affecting selection algorithm ) OR ( java applications optimization algorithm ))

Refine Results
  1. 1
  2. 2

    Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

    Published 2016
    “…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

    Route Optimization System by Zulkifli, Abdul Hayy

    Published 2005
    “…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
    Get full text
    Get full text
    Final Year Project
  4. 4
  5. 5
  6. 6

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

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

    Published 2013
    “…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
    Conference or Workshop Item
  8. 8

    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. 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
    Article
  9. 9
  10. 10
  11. 11

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

    Published 2022
    “…However, in practice, high leverage points may lead to misleading results in solving variable selection problems. Therefore, a robust sure independence screening procedure based on the weighted correlation algorithm of MRFCH for high dimensional data is developed to address this problem. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Assessing the simulation performances of multiple model selection algorithm by Yusof, Norhayati, Ismail, Suzilah, Tuan Muda, Tuan Zalizam

    Published 2015
    “…The capability of the algorithm in finding the true specification of multiple models is measured by the percentage of simulation outcomes.Overall results show that the algorithm has performed well for a model with two equations.The findings also indicated that the number of variables in the true models affect the algorithm performances. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  13. 13

    Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT by Abdullah, Amran

    Published 2006
    “…Genetic Algorithm is one of the most popular optimization solutions used in various applications such as scheduling. …”
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15
  16. 16
  17. 17

    Minimization of Test Cases and Fault Detection Effectiveness Improvement through Modified Reduction with Selective Redundancy Algorithm by Nikfal, Shima

    Published 2007
    “…To achieve such goal, this research modifies and improves the Reduction with Selective Redundancy (RSR) algorithm. In the modify algorithm, test cases would be selected according to the branch coverage if they covered different branch combination. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Examination timetabling using genetic algorithm case study: KUiTTHO by Mohd Salikon, Mohd Zaki

    Published 2005
    “…Genetic Algorithm (GA) is one of the most popular optimization solutions. …”
    Get full text
    Get full text
    Thesis
  19. 19

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

    Published 2017
    “…This process will result in loss of information which affects the classification accuracy. 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
    Article
  20. 20

    Examination Timetabling Using Genetic Algorithm Case Study : KUiTTHO by Mohd. Zaki, Mohd. Salikon

    Published 2005
    “…Genetic Algorithm (GA) is one of the most popular optimization solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis