Search Results - (( _ application ((bleu algorithm) OR (tree algorithm)) ) OR ( its application ant algorithm ))*

Refine Results
  1. 1

    A class skew-insensitive ACO-based decision tree algorithm for imbalanced data sets by Mohd Razali, Muhamad Hasbullah, Saian, Rizauddin, Yap, Bee Wah, Ku-Mahamud, Ku Ruhana

    Published 2021
    “…Ant-tree-miner (ATM) has an advantage over the conventional decision tree algorithm in terms of feature selection. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Evaluation of structured questions using modified BLEU algorithm by Siraj, Fadzilah, Ali, Mohamed Salem

    Published 2016
    “…This paper describes and exemplifies an application of a Structured Exam Questions Test Bank and Evaluation Using Modified Bilingual Evaluation Understudy (BLEU) Algorithm, a software system developed in pursuit of robust computerized marking of free-text answers to open-ended questions.It employs the Information System Development Research Methodology with modified BLEU Algorithm and Expert System for similar words.The system was developed to facilitate in managing and administrating structured questions for client/server architecture based on intranet. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7

    Rule pruning techniques in the ant-miner classification algorithm and its variants: A review by Al-Behadili, Hayder Naser Khraibet, Ku-Mahamud, Ku Ruhana, Sagban, Rafid

    Published 2018
    “…Rule-based classification is considered an important task of data classification.The ant-mining rule-based classification algorithm, inspired from the ant colony optimization algorithm, shows a comparable performance and outperforms in some application domains to the existing methods in the literature.One problem that often arises in any rule-based classification is the overfitting problem. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8

    Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid by Ku-Mahamud, Ku Ruhana, Ramli, Razamin, Yusof, Yuhanis, Mohamed Din, Aniza, Mahmuddin, Massudi

    Published 2012
    “…Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
    Get full text
    Get full text
    Monograph
  9. 9
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20