Search Results - (( developing interactive tree algorithm ) OR ( java optimization new algorithm ))

Refine Results
  1. 1

    Prime-based method for interactive mining of frequent patterns by Nadimi-Shahraki, Mohammad-Hossein

    Published 2010
    “…Since rerunning the mining algorithms from scratch can be very time consuming, researchers have introduced interactive mining to find proper patterns by using the current mining model with various minsup. …”
    Get full text
    Get full text
    Thesis
  2. 2

    A heuristics approach for classroom scheduling using genetic algorithm technique by Ahmad, Izah R., Sufahani, Suliadi, Ali, Maselan, Mohd Razali, Siti Noor Asyikin

    Published 2017
    “…While trying to enhance the efficiency in classroom planning, this paper proposes a heuristic approach for timetabling optimization. A new algorithm was produced to take care of the timetabling problem in a university. …”
    Get full text
    Get full text
    Article
  3. 3

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

    Optimize class time tabling by using genetic algorithm technique in UTHM by Ahmad, Izah Rafidah

    Published 2019
    “…This research used genetic algorithm (GA) that was applied to java programming languages with a goal of reducing conflict and optimizing the fitness. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5
  6. 6

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

    Published 2011
    “…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
  7. 7

    A study of graduate on time (GOT) for Ph.D students using decision tree model by Chin, Wan Yung, Ch’ng, Chee Keong, Mohd Jamil, Jastini

    Published 2019
    “…Therefore, this study aims to classify the Ph.D students into the group of “GOT achiever” and “non-GOT achiever” by using decision tree models. Historical data that related to all Ph.D students in a public university in Malaysia has been obtained directly from the database of Graduate Academic Information System (GAIS) in order to develop and compare the performance of decision tree models (Chi-square algorithm, Gini index algorithm, Entropy algorithm and an interactive decision tree). …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    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
  9. 9
  10. 10

    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
  11. 11
  12. 12

    Enhance efficiency of answering XML keyword query using incompact structure of MCCTree by Sazaly, Ummu Sulaim

    Published 2012
    “…If the result cannot be used directly by the ranking method, the algorithm has an ineffective process. Moreover, if the ineffective process requires re-examining the original tree, the efficiency of the process of the algorithm will be reduced. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Sales prediction of religious product and services of Mutawwif Haramain Travel & Tours using predictive analytics by Mohd Sabri, Nurul Ainin Qistina

    Published 2025
    “…Sales prediction in the religious services sector is challenging due to seasonal, cultural, and economic factors, which make traditional methods less reliable. This research develops a predictive model for sales prediction at Mutawwif Haramain Travel & Tours, utilizing machine learning algorithms, specifically Decision Tree, Random Forest, and Naive Bayes, to uncover patterns in customer behavior and seasonal demand. …”
    Get full text
    Get full text
    Student Project
  14. 14

    An ensemble learning method for spam email detection system based on metaheuristic algorithms by Behjat, Amir Rajabi

    Published 2015
    “…Feature subset selection and classifier ensemble learning are familiar techniques with high ability to optimize above problems. Recently, various techniques based on different algorithms have been developed. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Landslide susceptibility mapping using decision-tree based chi-squared automatic interaction detection (CHAID) and logistic regression (LR) integration by Althuwaynee, Omar F., Pradhan, Biswajeet, Ahmad, Noordin

    Published 2014
    “…This new algorithm was developed to overcome the subjectivity of the manual categorization of scale data of landslide conditioning factors, and to predict rainfall-induced susceptibility map in Kuala Lumpur city and surrounding areas using geographic information system (GIS). …”
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16

    Robotic path planning using rapidly-exploring random trees by Sherwani, Fahad

    Published 2013
    “…This study concerns the implementation of Rapidly-Exploring Random Trees (RRTs) algorithm for an autonomous robot path planning. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17
  18. 18

    Modelling complex features from histone modification signatures using genetic algorithm for the prediction of enhancer region by Lee, Nung Kion, Fong, Pui Kwan, Mohd Tajuddin, Abdullah

    Published 2014
    “…Current histone signature is mostly represented using k-mers content features incapable of representing all the possible complex interactions of various DNA segments. The main contributions are, among others: (a) demonstrating that there are complex interactions among sequence segments in the histone regions; (b) developing a parse tree representation of the logical complex features. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19
  20. 20

    Analysis of daytime and nighttime ground level ozone concentrations using boosted regression tree technique by Yahaya, Noor Zaitun, Ghazali, Nurul Adyani, Ahmad, Sabri, Mohammad Asri, Mohammad Akmal, Ibrahim, Zul Fahdli, Ramli, Nor Azman

    Published 2017
    “…Sensitivity testing of the BRT model was conducted to determine the best parameters and good explanatory variables. Using the number of trees between 2,500-3,500, learning rate of 0.01, and interaction depth of 5 were found to be the best setting for developing the ozone boosting model. …”
    Get full text
    Get full text
    Get full text
    Article