Search Results - (( evolution classification mining algorithm ) OR ( based constructive path algorithm ))

Refine Results
  1. 1

    Classification of Immunosignature Using Random Forests for Cancer Diagnosis by Zarzar, Mouayad, Razak, Eliza, Htike@Muhammad Yusof, Zaw Zaw, Yusof, Faridah

    Published 2015
    “…To attain this essential research purpose, a minimum set of genes that can assure higher performance in classification using data mining algorithms need to be detected. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  2. 2

    Multi-Objective Hybrid Algorithm For The Classification Of Imbalanced Datasets by Saeed, Sana

    Published 2019
    “…The proposed algorithm is grounded on the two famous metaheuristic algorithms: cuckoo search (CS) and covariance matrix adaptation evolution strategy (CMA-es). …”
    Get full text
    Get full text
    Thesis
  3. 3

    Classification with degree of importance of attributes for stock market data mining by Khokhar, Rashid Hafeez, Md. Sap, Mohd. Noor

    Published 2004
    “…The SVM is a training algorithm for learning classification and regression rules from data [7]. …”
    Get full text
    Get full text
    Article
  4. 4

    Y-type Random 2-satisfiability In Discrete Hopfield Neural Network by Guo, Yueling

    Published 2024
    “…Additionally, the proposed Hybrid Differential Evolution Algorithm was implemented into the training phase to ensure that the cost function of the Discrete Hopfield Neural Network is minimized. …”
    Get full text
    Get full text
    Thesis
  5. 5

    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

    Published 2013
    “…The motion planning problem poses the question of how a robot can move from an initial to a final position. Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7

    A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

    Published 2022
    “…The suggested algorithm outperforms the competition in terms of improving path cost, smoothness, and search time. …”
    Get full text
    Thesis
  8. 8
  9. 9
  10. 10

    Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed by Aneesa Ali, Ali Saeed

    Published 2017
    “…A model-driven approach was used for generating abstract test cases from the feasible paths. This model driven approach was integrated with the proposed infeasible path detection method which based on analyzing various OCL constructs and operations. …”
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11

    An application of Floyd-Warshall Algortihm in finding shortest path of order picker in warehouse / Saidatul Aisyah Roslan, Siti Norhakimah Mohd Yatim and Siti Sarah Sulaiman by Roslan, Saidatul Aisyah, Mohd Yatim, Siti Norhakimah, Sulaiman, Siti Sarah

    Published 2019
    “…The objectives of this study are to construct the distance matrix and sequence matrix based on the network layout and to find the shortest path to collect the item in the warehouse. …”
    Get full text
    Get full text
    Student Project
  12. 12

    AUTOMATED GUIDED ROBOT (AGR) by Abd Rahim, Mohd Azlan Shah

    Published 2007
    “…Algorithm conversion to C code programming has been done throughout the project for the obstacle avoidance and path planning algorithms based upon the GA platform ofAI.…”
    Get full text
    Get full text
    Final Year Project
  13. 13
  14. 14

    Multi agent quality of service routing based on scheme ant colony optimization algorithm by Baygi, Maassoumeh Javadi

    Published 2014
    “…The proposed scheme has been simulated by OMNET++ and compared with standard AntNet and two well-known standard QoS routings; Widest Shortest Path (WSP) algorithm and Shortest Widest Path (SWP) algorithm. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques by Qtaish, Osama Kayed Taher

    Published 2014
    “…The aim is to solve the above-mentioned problems via an optimization mechanism based upon the combination between runtime path prediction method and heuristic algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    Class binarization with self-adaptive algorithm to improve human activity recognition by Zainudin, Muhammad Noorazlan Shah

    Published 2018
    “…Therefore, feature selection using Relief-f with self-adaptive Differential Evolution (rsaDE) algorithm is proposed to select the most significant features. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Ant colony optimization (ACO) algorithm for CNC route problem by Wan Nur Farhanah , Wan Zakaria

    Published 2012
    “…The GUT will be display the shortest path that should be taken by user and give user authority to manipulate the coordinate based on the requirement.…”
    Get full text
    Get full text
    Undergraduates Project Papers
  19. 19

    Application of data mining techniques for economic evaluation of air pollution impact and control by Lukman, Iing

    Published 2007
    “…For that purpose, we use data mining techniques. Data mining techniques applied in this thesis were: 1) Group method of data handling (GMDH), originally from engineering, introducing principles of evolution - inheritance, mutation and selection - for generating a network structure systematically to develop the automatic model, synthesis, and its validation; 2) The weighted least square (WLS) and step wise regression were also applied for some cases; 3) The classification-based association rules were applied. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Interference avoidance routing and scheduling using multiple transceivers for IEEE 802.16 mesh network by Qasem, Yaaqob Ali Ahmed

    Published 2010
    “…This algorithm looks for a short path from the subscriber station (SS) node to BS, while the optimal path is achieved when the whole path has the lowest EbMR. …”
    Get full text
    Get full text
    Thesis