Search Results - (( subset selection problem algorithm ) OR ( simulation optimization method algorithm ))

Refine Results
  1. 1

    Fuzzy clustering method and evaluation based on multi criteria decision making technique by Sameer, Fadhaa Othman

    Published 2018
    “…For the third problem a modified of Kohonen Network (MKN) algorithm was proposed to select the initial centres of clusters. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    A new ant based rule extraction algorithm for web classification by Ku-Mahamud, Ku Ruhana, Saian, Rizauddin

    Published 2011
    “…Web documents contain enormous number of attributes as compared to other type of data. Ant-Miner algorithm is also still lacking in efficiency, accuracy and rule simplicity because of the local minima problem.Therefore, the Ant-Miner algorithm needs to be improved by taking into consideration of the accuracy and rule simplicity criteria so that it could be used to classify Web documents data sets or any large data sets.The best attribute selection method for Web texts categorization is the combination of correlation-based evaluation with random search as the search method.However, this attribute selection method will not give the best performance in attributes reduction. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  3. 3

    Information Theoretic-based Feature Selection for Machine Learning by Muhammad Aliyu, Sulaiman

    Published 2018
    “…In these extended IFS method, feature selection method was defined and presented as a 0-1 Knapsack Problem (MKP). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

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

    Published 2018
    “…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
    Thesis
  5. 5

    Development of optimized maintenance scheduling model for coal-fired power plant boiler by Noor Fazreen Binti Ahmad Fuzi, Ms.

    Published 2023
    “…Literature revealed that mathematical methods and metaheuristic algorithms are common approaches in solving combinatorial optimization problems with a large search space in a reasonable computational run time. …”
    text::Thesis
  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 optimisation algorithm for feature subset selection and tuning support vector machine parameter by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

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

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

    Published 2013
    “…However, SVM suffers two main problems which include feature subset selection and parameter tuning. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10

    Aco-based feature selection algorithm for classification by Al-mazini, Hassan Fouad Abbas

    Published 2022
    “…An enhanced graph clustering ant colony optimisation (EGCACO) algorithm is proposed to solve the three (3) MGCACO algorithm problems. …”
    Get full text
    Get full text
    Thesis
  11. 11

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

    Published 2017
    “…The main problems of SVM are selecting feature subset and tuning the parameters. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

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

    Gene subset selection for lung cancer classification using a multi-objective strategy by Mohamad, Mohd. Saberi, Omatu, Sigeru, Deris, Safaai, Yoshioka, Michifuci

    Published 2008
    “…It has been shown that selecting a small subset of genes can lead to improved classification accuracy. …”
    Get full text
    Get full text
    Article
  14. 14

    A hybrid local search algorithm for minimum dominating set problems by Abed, S.A., Rais, H.M., Watada, J., Sabar, N.R.

    Published 2022
    “…MDS seeks for the minimum subset of vertices in which every vertex not in the selected subset is adjacent to at least one vertex of this subset. …”
    Get full text
    Get full text
    Article
  15. 15

    A hybrid local search algorithm for minimum dominating set problems by Abed, S.A., Rais, H.M., Watada, J., Sabar, N.R.

    Published 2022
    “…MDS seeks for the minimum subset of vertices in which every vertex not in the selected subset is adjacent to at least one vertex of this subset. …”
    Get full text
    Get full text
    Article
  16. 16

    An ensemble learning method for spam email detection system based on metaheuristic algorithms by Behjat, Amir Rajabi

    Published 2015
    “…Feature subset selection and classifier ensemble learning are familiar techniques with high ability to optimize above problems. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Mutable composite firefly algorithm for gene selection in microarray based cancer classification by Fajila, Mohamed Nisper Fathima

    Published 2022
    “…This leads to the classification accuracy and genes subset size problem. Hence, this study proposed to modify the Firefly Algorithm (FA) along with the Correlation-based Feature Selection (CFS) filter for the gene selection task. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Improved TLBO-JAYA Algorithm for Subset Feature Selection and Parameter Optimisation in Intrusion Detection System by Aljanabi, Mohammad, Mohd Arfian, Ismail, Mezhuyev, Vitaliy

    Published 2020
    “…ITLBO with supervised machine learning (ML) technique was used for feature subset selection (FSS). The selection of the least number of features without causing an effect on the result accuracy in FSS is a multiobjective optimisation problem. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    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

    Published 2020
    “…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
    Article
  20. 20

    Case Slicing Technique for Feature Selection by A. Shiba, Omar A.

    Published 2004
    “…CST was compared to other selected classification methods based on feature subset selection such as Induction of Decision Tree Algorithm (ID3), Base Learning Algorithm K-Nearest Nighbour Algorithm (k-NN) and NaYve Bay~sA lgorithm (NB). …”
    Get full text
    Get full text
    Thesis