Search Results - (( set generation method algorithm ) OR ( program implementation tree algorithm ))

Refine Results
  1. 1

    Propositional satisfiability method in rough classification modeling for data mining by Abu Bakar, Azuraliza

    Published 2002
    “…The classification accuracy, the number of rules and the maximum length of rules obtained from the SIPIDRIP method was compared with other rough set method such as Genetic Algorithm (GA), Johnson, Holte l R, Dynamic and Exhaustive method. …”
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

    Optimizing tree planting areas through integer programming and improved genetic algorithm by Md Badarudin, Ismadi

    Published 2012
    “…Therefore, a hybrid algorithm through an incorporation of Integer Programming and Improved Genetic Algorithm was proposed for planting lining design. …”
    Get full text
    Get full text
    Thesis
  4. 4
  5. 5

    Comparison Of Phylogenetic Trees Using Difference Distance Function Method by Maziah, Medin

    Published 2005
    “…The pre-processing is implemented using the Microsoft Visual C++. The phylogenetic tree is build using the PHYLlP (the PHYlogeny Inference Package), a package of programs for inferring phylogenies (evolutionary trees). …”
    Get full text
    Get full text
    Final Year Project Report / IMRAD
  6. 6

    Predicting Student Performance in Object Oriented Programming Using Decision Tree : A Case at Kolej Poly-Tech Mara, Kuantan by Mohd Hanis, Rani, Abdullah, Embong

    Published 2013
    “…The objective was to identify and implement the most accurate algorithm for the KPTM dataset and to come up with a good prediction model using decision tree technique. …”
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7

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

    Published 2004
    “…The classification accuracy obtained from the CST method is compared to other selected classification methods such as Value Difference Metric (VDM), Pre-Category Feature Importance (PCF), Cross-Category Feature Importance (CCF), Instance-Based Algorithm (IB4), Decision Tree Algorithms such as Induction of Decision Tree Algorithm (ID3) and Base Learning Algorithm (C4.5), Rough Set methods such as Standard Integer Programming (SIP) and Decision Related Integer Programming (DRIP) and Neural Network methods such as the Multilayer method.…”
    Get full text
    Get full text
    Thesis
  8. 8

    SEALiP: A simple and efficient algorithm for listing permutation via starter set method by Ibrahim, Haslinda, Zake, Lugean, Omar, Zurni, Karim, Sharmila

    Published 2013
    “…Algorithm for listing permutations for n elements is an arduous task.This paper attempts to introduce a novel method for generating permutations.The fundamental concept for this method is to seek a starter set to begin with as an initial set to generate all distinct permutations. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Comparison between starter sets generation method for listing all permutations by Karim, Sharmila, Ibrahim, Haslinda, Omar, Zurni

    Published 2013
    “…distinct permutations is an exhaustive process.Using starter set, the process of listing the permutations becomes easy.However a problem arises when the equivalence starter sets will generate the similar permutation and needed to be discarded.Two new recursive strategies are proposed to generate starter sets without generating equivalence starter sets namely circular and exchange two elements operation.Once the starter sets are obtained, the circular and reverse of circular operation are employed to produce distinct permutation from each starter sets.Computational advantages are presented comparing the results obtained by the new method with two other existing methods.The result indicates that the exchange two elements based strategy is faster than the circular based.Overall all new algorithms are better than existing algorithms in time execution.…”
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

    A permutation parallel algorithm under exchange restriction with message passing interface by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda

    Published 2014
    “…The permutation generation method is based on starter sets generation under exchange operation and exploited it for listing down all n! …”
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

    Published 2012
    “…The experiments were conducted on self generated data sets (7 different sets) and well known datasets (Mushroom & Cars Data set). …”
    Get full text
    Get full text
    Thesis
  12. 12

    A new starter sets generation method by fixing any element under exchange restriction by Karim, Sharmila, Ibrahim, Haslinda, Omar, Zurni, Sapiri, Hasimah

    Published 2016
    “…Permutation array are of recent interest because of their application to data transmission over power lines.A new permutation technique based on distinct starter sets by employing circular and reversing operations.The crucial task is to generate the distinct starter sets by eliminating the equivalence starter sets.Meanwhile a new strategy for starter sets generation without generating its equivalence starter sets were developed and more efficient in terms of computation time compared to old method. …”
    Get full text
    Get full text
    Article
  13. 13

    A new method for starter sets generation by fixing any element by Karim, Sharmila, Ibrahim, Haslinda, Sapiri, Hasimah

    Published 2015
    “…a new permutation technique based on distinct starter sets was introduced by employing circular and reversing operations.The crucial task is to generate the distinct starter sets by eliminating the equivalence starter sets.Meanwhile new strategies for starter sets generation without generating its equivalence starter sets were developed and more efficient in terms of computation time compared to old method.However all these algorithms have limitations in terms of fixing element to construct the first set (starter set) to begin with.It would be interesting to derive new strategy by fixing an element in any position. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14

    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem by Ismail, Zuhaimy, Nurhadi, Irhamah, Zainuddin, Zaitul Marlizawati

    Published 2008
    “…Genetic Algorithm as population-based methods are better identifying promising areas in the search space, while Tabu Search and Simulated Annealing as trajectory methods are better in exploring promising areas in search space. …”
    Get full text
    Get full text
    Monograph
  15. 15

    New Learning Models for Generating Classification Rules Based on Rough Set Approach by Al Shalabi, Luai Abdel Lateef

    Published 2000
    “…Also, the proposed models for learning in data sets generated the classification rules faster than other methods. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    Rapid software framework for the implementation of machine learning classification models by Rahman, A.S.A., Masrom, S., Rahman, R.A., Ibrahim, R.

    Published 2021
    “…Additionally, this paper explains comparisons of results between two platforms of rapid software; the proposed software and Python program. The machine learning model in the two platforms were tested on breast cancer and tax avoidance datasets with Decision Tree algorithm. …”
    Get full text
    Get full text
    Article
  18. 18

    New recursive circular algorithm for listing all permutations by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda, Othman, Khairil Iskandar, Suleiman, Mohamed

    Published 2014
    “…In this paper, a new recursive strategy is proposed to generate starter sets that will not incur equivalence by circular operation. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19
  20. 20

    Parallel strategy for starter sets to list all permutation based on cycling restriction by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda, Othman, Khairil Iskandar

    Published 2011
    “…This paper presents a parallel implementation of a new permutation generation method.This permutation generation method is based on the starter sets for listing all the n! …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item