Search Results - (( problems using ((tree algorithm) OR (max algorithm)) ) OR ( java application using algorithm ))

Refine Results
  1. 1

    Batch mode heuristic approaches for efficient task scheduling in grid computing system by Maipan-Uku, Jamilu Yahaya

    Published 2016
    “…We simulate our proposed algorithms using a Java based simulator that is purposedly built for Grid computing simulations. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Saputra , Dhany, Rambli, Dayang R.A., Foong, Oi Mean

    Published 2008
    “…A comprehensive performance study has been reported that PrefixSpan, one of the sequential pattern mining algorithms, outperforms GSP, SPADE, as well as FreeSpan in most cases, and PrefixSpan integrated with pseudoprojection technique is the fastest among those tested algorithms. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Building customer churn prediction models in Indonesian telecommunication company using decision tree algorithm by Ramadhanti,, Darin, Larasati, Aisyah, Muid, Abdul, Mohamad, Effendi

    Published 2023
    “…This study uses data mining techniques with decision tree algorithms to predict customer churn in one of Indonesian Telecommunication companies. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  4. 4

    Adoption of machine learning algorithm for analysing supporters and non supporters feedback on political posts / Ogunfolajin Maruff Tunde by Ogunfolajin Maruff , Tunde

    Published 2022
    “…The method was implemented using Java and the results of the simulation were evaluated using five standard performance metrics: accuracy, AUC, precision, recall, and f-Measure. …”
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    Mining Sequential Patterns Using I-PrefixSpan by Dhany , Saputra, Rambli Dayang, R.A., Foong, Oi Mean

    Published 2007
    “…In this paper, we propose an improvement of pattern growth-based PrefixSpan algorithm, called I-PrefixSpan. The general idea of I-PrefixSpan is to use the efficient data structure for general tree-like framework and separator database to reduce the execution time and memory usage. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6

    Reactive max-min ant system: An experimental analysis of the combination with K-OPT local searches by Sagban, Rafid, Ku-Mahamud, Ku Ruhana, Abu Bakar, Muhamad Shahbani

    Published 2015
    “…Ant colony optimization (ACO) is a stochastic search method for solving NP-hard problems. The exploration versus exploitation dilemma rises in ACO search.Reactive max-min ant system algorithm is a recent proposition to automate the exploration and exploitation.It memorizes the search regions in terms of reactive heuristics to be harnessed after restart, which is to avoid the arbitrary exploration later.This paper examined the assumption that local heuristics are useless when combined with local search especially when it applied for combinatorial optimization problems with rugged fitness landscape.Results showed that coupling reactive heuristics with k-Opt local search algorithms produces higher quality solutions and more robust search than max-min ant system algorithm.Well-known combinatorial optimization problems are used in experiments, i.e. traveling salesman and quadratic assignment problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7
  8. 8

    A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem by Odili, Julius Beneoluchi, Noraziah, Ahmad, Zarina, M.

    Published 2021
    “…This paper presents a comparative performance analysis of some metaheuristics such as the African Buffalo Optimization algorithm (ABO), Improved Extremal Optimization (IEO), Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO), Max-Min Ant System (MMAS), Cooperative Genetic Ant System (CGAS), and the heuristic, Randomized Insertion Algorithm (RAI) to solve the asymmetric Travelling Salesman Problem (ATSP). …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    An improvement of stochastic gradient descent approach for mean-variance portfolio optimization problem by S. W. Su, Stephanie, Kek, Sie Long

    Published 2021
    “…Furthermore, the applicability of SGD, Adam, AdaMax, Nadam, AMSGrad, and AdamSE algorithms in solving the mean-variance portfolio optimization problem is validated.…”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Modern fuzzy min max neural networks for pattern classification by Al Sayaydeh, Osama Nayel Ahmad

    Published 2019
    “…To build an efficient classifier model, researchers have introduced hybrid models that combine both fuzzy logic and artificial neural networks. Among these algorithms, Fuzzy Min Max (FMM) neural network algorithm has been proven to be one of the premier neural networks for undertaking the pattern classification problems. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Classification of breast cancer disease using bagging fuzzy-id3 algorithm based on fuzzydbd by Nur Farahaina, Idris

    Published 2022
    “…One of the most powerful machine learning methods to handle classification problems is the decision tree. There are various decision tree algorithms, but the most commonly used are Iterative Dichotomiser 3 (ID3), CART, and C4.5. …”
    Get full text
    Get full text
    Thesis
  12. 12

    A new minimum pheromone threshold strategy (MPTS) for max-min ant system by Wong, Kuan Yew, See, Phen Chiak

    Published 2009
    “…Thereafter, various suggestions have been made to improve the performance of the ACO algorithm. One of them is through the development of the max–min ant system (MMAS) algorithm. …”
    Get full text
    Get full text
    Article
  13. 13

    Statistical data preprocessing methods in distance functions to enhance k-means clustering algorithm by Dalatu, Paul Inuwa

    Published 2018
    “…We introduced two new approaches to normalization techniques to enhance the K-Means algorithms. This is to remedy the problem of using the existing Min-Max (MM) and Decimal Scaling (DS) techniques, which have overflow weakness. …”
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14

    RSA Encryption & Decryption using JAVA by Ramli, Marliyana

    Published 2006
    “…References and theories to support the research of 'RSA Encryption/Decryption using Java' have been disclosed in Literature Review section. …”
    Get full text
    Get full text
    Final Year Project
  15. 15

    A modified fuzzy min-max neural network with a genetic-algorithm-based rule extractor for pattern classification by Quteishat, A., Lim, C.P., Tan, K.S.

    Published 2010
    “…The first stage consists of a modified fuzzy min-max (FMM) neural-network-based pattern classifier, while the second stage consists of a genetic-algorithm (GA)-based rule extractor. …”
    Get full text
    Article
  16. 16

    Attribute related methods for improvement of ID3 Algorithm in classification of data: A review by Nur Farahaina, Idris, Mohd Arfian, Ismail

    Published 2020
    “…There are several learning algorithms to implement the decision tree but the most commonly-used is ID3 algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17
  18. 18

    Quality of service management algorithms in WiMAX networks by Saidu, Ibrahim

    Published 2015
    “…Simulation have been extensively used to evaluate the proposed algorithm. Finally, Discrete Event Simulator (DES) is designed and developed in order to evaluate the performance of the proposed algorithms. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem by Wamiliana, Wamiliana, Elfaki, Faiz Ahmed Mohamed, Usman, Mustofa, Azram, Mohammad

    Published 2015
    “…We implemented our algorithms on 300 generated problems with vertex order ranging from 10 to 100, and compared them with those that were already in the literature. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20