Search Results - (( programming case classification algorithm ) OR ( java simulation optimization algorithm ))

Refine Results
  1. 1

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

    Published 2004
    “…Case Slicing Technique (CST) helps in identifying the subset of features used in computing the similarity measures needed by classification algorithms. …”
    Get full text
    Get full text
    Thesis
  2. 2

    An efficient and effective case classification method based on slicing by Shiba, Omar A. A., Sulaiman, Md. Nasir, Mamat, Ali, Ahmad, Fatimah

    Published 2006
    “…The paper also discusses two of common classification algorithms that are used either in data mining or in general AI. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3
  4. 4

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph
  6. 6

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
    Review
  7. 7

    Twofold Integer Programming Model for Improving Rough Set Classification Accuracy in Data Mining. by Saeed, Walid

    Published 2005
    “…The accuracy for rules and classification resulted from the TIP method are compared with other methods such as Standard Integer Programming (SIP) and Decision Related Integer Programming (DRIP) from Rough Set, Genetic Algorithm (GA), Johnson reducer, HoltelR method, Multiple Regression (MR), Neural Network (NN), Induction of Decision Tree Algorithm (ID3) and Base Learning Algorithm (C4.5); all other classifiers that are mostly used in the classification tasks. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

    Published 2016
    “…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11
  12. 12

    Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2011
    “…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  13. 13

    Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter by Azhar, Nur Huwaina

    Published 2019
    “…Cloudsim is used as Discrete Event Simulation tool and Java as coding language to evaluate LACE algorithm. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Improved voting technique for ensemble of MLP system applied on various classification data / Saodah Omar, Iza Sazanita Isa and Junita Mohd Saleh. by Omar, Saodah, Isa, Iza Sazanita, Mohd Saleh, Junita

    Published 2010
    “…The MLP networks are trained using two types of learning algorithm, which are the Levenberg Marquardt and the Resilient Back Propagation algorithms. …”
    Get full text
    Get full text
    Research Reports
  15. 15
  16. 16

    Derivations of some classes of Leibniz algebras by Ahmed I, Al-Nashri Al-Hossain

    Published 2013
    “…Starting from dimensions four and above there are classifications of subclasses (in dimension four nilpotent case and in dimensions (5-8) there are classifications of filiform Leibniz algebras). …”
    Get full text
    Get full text
    Thesis
  17. 17

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

    Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance by Nor Azlan, Nor Asmaa Alyaa

    Published 2021
    “…The methodology starts with literature comprehension studies on the computation pitfalls and existed augmentation studies of Simplex algorithm. Then, followed by concept development which consists of concept extraction, computation stages classification and algorithms integration. …”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

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

    Published 2002
    “…The propositional satisfiability method in rough classification model is proposed in this thesis. Two models, Standard Integer Programming (SIP) and Decision Related Integer Programming (DRIP) to represent the minimal reduct computation problem were proposed. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Computing irreducible representations of two-generator groups by Sarmin, Nor Haniza, Robert F., Morse, Ahmad, Satapah, Ahmad, Azhana, Mohd. Ali, Nor Muhainiah

    Published 2009
    “…Groups, Algorithms and Programming (GAP) software has been used for the calculations. …”
    Get full text
    Monograph