Search Results - (( based classification using algorithm ) OR ( program solution using algorithm ))

Refine Results
  1. 1

    Overview of metaheuristic: classification of population and trajectory by Zainul Rashid, Zarina

    Published 2010
    “…Algorithms are used to find the solutions through the computer program. …”
    Get full text
    Get full text
    Monograph
  2. 2

    Different mutation and crossover set of genetic programming in an automated machine learning by Masrom, S., Mohamad, M., Hatim, S.M., Baharun, N., Omar, N., Abd. Rahman, A.S.

    Published 2020
    “…One of the progressing works for automated machine learning improvement is the inclusion of evolutionary algorithm such as Genetic Programming. The function of Genetic Programming is to optimize the best combination of solutions from the possible pipelines of machine learning modelling, including selection of algorithms and parameters optimization of the selected algorithm. …”
    Get full text
    Get full text
    Article
  3. 3

    Different mutation and crossover set of genetic programming in an automated machine learning by Masrom, S., Mohamad, M., Hatim, S.M., Baharun, N., Omar, N., Abd. Rahman, A.S.

    Published 2020
    “…One of the progressing works for automated machine learning improvement is the inclusion of evolutionary algorithm such as Genetic Programming. The function of Genetic Programming is to optimize the best combination of solutions from the possible pipelines of machine learning modelling, including selection of algorithms and parameters optimization of the selected algorithm. …”
    Get full text
    Get full text
    Article
  4. 4
  5. 5

    Classification models for higher learning scholarship award decisions by Wirawati Dewi Ahmad, Azuraliza Abu Bakar

    Published 2018
    “…A dataset of successful and unsuccessful applicants was taken and processed as training data and testing data used in the modelling process. Five algorithms were employed to develop a classification model in determining the award of the scholarship, namely J48, SVM, NB, ANN and RT algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Angle Based Protein Tertiary Structure Prediction Using Bees Optimization Algorithm by Al-Qattan, Zakaria Noor Aldeen Mahmood

    Published 2010
    “…WEKA program application was used for main chain angles (Phi and Psi) data classification. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7
  8. 8

    Adaptive differential evolution algorithm with fitness based selection of parameters and mutation strategies / Rawaa Dawoud Hassan Al-Dabbagh by Rawaa Dawoud Hassan, Al-Dabbagh

    Published 2015
    “…ARDE algorithm makes use of JADE strategy and the MDE_pBX parameters adaptive schemes as frameworks. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Differential evolution for neural networks learning enhancement by Ismail Wdaa, Abdul Sttar

    Published 2008
    “…Evolutionary computation is the name given to a collection of algorithms based on the evolution of a population toward a solution of a certain problem. …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    Towards a better feature subset selection approach by Shiba, Omar A. A.

    Published 2010
    “…The selection of the optimal features subset and the classification has become an important issue in the data mining field.We propose a feature selection scheme based on slicing technique which was originally proposed for programming languages.The proposed approach called Case Slicing Technique (CST).Slicing means that we are interested in automatically obtaining that portion 'features' of the case responsible for specific parts of the solution of the case at hand.We show that our goal should be to eliminate the number of features by removing irrelevant once.Choosing a subset of the features may increase accuracy and reduce complexity of the acquired knowledge.Our experimental results indicate that the performance of CST as a method of feature subset selection is better than the performance of the other approaches which are RELIEF with Base Learning Algorithm (C4.5), RELIEF with K-Nearest Neighbour (K-NN), RELIEF with Induction of Decision Tree Algorithm (ID3) and RELIEF with Naïve Bayes (NB), which are mostly used in the feature selection task.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11
  12. 12

    Using genetic algorithms to optimise land use suitability by Pormanafi, Saeid

    Published 2012
    “…In this study, under environmentfriendliness objective, based on multi-agent genetic algorithms, was developed a geospatial model for the land use allocation. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Problem restructuring in interger programming for reduct searching by Ungku Chulan, Ungku Azmi Iskandar

    Published 2003
    “…The thesis emphasizes mainly on the improvement of the original SIP/DRIP algorithm in term of performance. By using problem restructuring, the searching time and memory are minimized. …”
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15
  16. 16

    Logistics center location-inventory-routing problem optimization: a systematic review using PRISMA method by Liu, Lihua, Lee, Lai Soon, Seow, Hsin Vonn, Chen, Chuei Yee

    Published 2022
    “…When dealing with the LIRP, heuristic and metaheuristic algorithms are the most widely used solution methodologies in the literature. …”
    Get full text
    Get full text
    Article
  17. 17
  18. 18

    Development of cost reduction mathematical model for natural gas transmission network system by Mehrdad, Nikbakht Eliaderany

    Published 2012
    “…Since the optimization problem in NGTSs was non terministic polynomial and this complexity would be increased for the development of the NGTSC in the proposed MINLP model, exact methods had to be replaced with metaheuristic methods for finding the global optimum solution. In this research, an Extended Genetic Algorithms (EGA) was investigated to solve the proposed mathematical model and to achieve global or near to global optimum solutions in a reasonable time. …”
    Get full text
    Get full text
    Thesis
  19. 19
  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