Search Results - (( problem using three algorithm ) OR ( java application tree algorithm ))

Search alternatives:

Refine Results
  1. 1
    Adoption of machine learning algorithm for analysing supporters and non supporters feedback on political posts / Ogunfolajin Maruff Tunde

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

    Published 2022
    “…This work employed the use of machine learning approach. Four conventional classification algorithms: naïve bayes (NB), support vector machines (SVM), nearest neighbor (k-NN), and decision trees (J48) classifiers are implemented in identifying and categorizing tweet data of three political figures in Malaysia: Dato Seri Anwar, Dato Hadi Awang, and Lim Guang Eng, as either positive, negative, or neutral perceptions. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection

    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
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Study and Implementation of Data Mining in Urban Gardening

    Study and Implementation of Data Mining in Urban Gardening by Mohana, Muniandy, Lee, Eu Vern

    Published 2019
    “…Using the J48 tree algorithm implemented through WEKA API on a Java Servlet, data provided is processed to derive a health index of the plant, with the possible outcomes set to “Good,” “Okay”, or “Bad”. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Mining Sequential Patterns using I-PrefixSpan

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

    Published 2008
    Get full text
    Get full text
    Citation Index Journal
    Save to List
    Saved in:
  5. 5
    Mining Sequential Patterns Using I-PrefixSpan

    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
    Save to List
    Saved in:
  6. 6
    Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem

    Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem by Fayaz, Muhammad, Arshad,, Shakeel, Shah,, Abdul Salam, Shah, Asadullah

    Published 2018
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    A new cryptographic algorithm based on decomposition problem in elliptic curve cryptography / Hilyati Hanina Zazali

    A new cryptographic algorithm based on decomposition problem in elliptic curve cryptography / Hilyati Hanina Zazali by Hilyati Hanina, Zazali

    Published 2012
    “…The first algorithm determines an approach of performing key exchanges between two subgroups for Decomposition Problem and three subgroups for Triple Decomposition Problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    AI powered asthma prediction towards treatment formulation: an android app approach

    AI powered asthma prediction towards treatment formulation: an android app approach by Murad, Saydul Akbar, Adhikary, Apurba, Md Muzahid, Abu Jafar, Sarker, Md Murad Hossain, Khan, Md. Ashikur Rahman, Hossain, Md. Bipul, Bairagi, Anupam Kumar, Masud, Mehedi, Kowsher, Md

    Published 2022
    “…We utilized eight robust machine learning algorithms to analyze this dataset. We found that the Decision tree classifier had the best performance, out of the eight algorithms, with an accuracy of 87%. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    A discrete simulated kalman filter optimizer for combinatorial optimization problems

    A discrete simulated kalman filter optimizer for combinatorial optimization problems by Suhazri Amrin, Rahmad

    Published 2022
    “…In this research, three combinatorial problems namely the travelling salesman problem (TSP), assembly sequence planning (ASP), and the hole drilling proble are used to evaluate the proposed algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Hybrid flow shop scheduling problem with energy utilization using non-dominated sorting genetic algorithm-III (NSGA-III) optimization

    Hybrid flow shop scheduling problem with energy utilization using non-dominated sorting genetic algorithm-III (NSGA-III) optimization by Muhammad Ammar, Nik Mu’tasim, Mohd Fadzil Faisae, Ab Rashid

    Published 2023
    “…This paper presents the existing multi-objective approach for solving energy utilization and makespan problems in HFS scheduling using Non-Dominated Sorting Genetic Algorithm-III (NSGA-III), and a comparison to other optimization models was subjected for analysis. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Path Optimization For Cooperative Multi-Head 3d Printing

    Path Optimization For Cooperative Multi-Head 3d Printing by Cheong, Kah Jun

    Published 2020
    “…Two well-known algorithms for solving a closely related graph theory problem known as the Travelling Salesman Problem (TSP) are the Ant System (AS) and Ant Colony System (ACS) algorithms. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  12. 12
    Classification of breast cancer disease using bagging fuzzy-id3 algorithm based on fuzzydbd

    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
    Save to List
    Saved in:
  13. 13
    Three-term backpropagation algorithm for classification problem

    Three-term backpropagation algorithm for classification problem by Saman, Fadhlina Izzah

    Published 2006
    “…Standard Backpropagation Algorithm (BP) is a widely used algorithm in training Neural Network that is proven to be very successful in many diverse application. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Comparison between ant colony and genetic algorithm using traveling salesman problem

    Comparison between ant colony and genetic algorithm using traveling salesman problem by Abduljabbar, Zaid Ammen, Khalefa, Mustafa S., A. Jabar, Marzanah

    Published 2013
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Enhancing three variants of harmony search algorithm for continuous optimization problems

    Enhancing three variants of harmony search algorithm for continuous optimization problems by Alomoush, Alaa A., Alsewari, Abdulrahman A., Kamal Z., Zamli, Alrosan, Ayat, Alomoush, Waleed, Alissa, Khalid

    Published 2021
    “…A convergence rate graph is also used to show the overall performance of the new algorithms.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    AI powered asthma prediction towards treatment formulation : An android app approach

    AI powered asthma prediction towards treatment formulation : An android app approach by Murad, Saydul Akbar, Adhikary, Apurba, Muzahid, Abu Jafar Md, Sarker, Md. Murad Hossain, Khan, Md. Ashikur Rahman, Hossain, Md. Bipul, Bairagi, Anupam Kumar, Masud, Mehedi, Kowsher, Md.

    Published 2022
    “…We utilized eight robust machine learning algorithms to analyze this dataset. We found that the Decision tree classifier had the best performance, out of the eight algorithms, with an accuracy of 87%. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems

    Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems by Rahimi, Amir Masoud, Ramezani-Khansari, Ehsan

    Published 2021
    “…This study seeks to solve this problem using Artificial Bee Colony (ABC) Algorithm along with the proposed Discrete Nearest Neighborhood Algorithm (DNNA). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Optimisation of vehicle routing problem with time windows using Harris Hawks optimiser

    Optimisation of vehicle routing problem with time windows using Harris Hawks optimiser by Chai, S. W., Kamaluddin, M. R., Ab Rashid, M. F. F.

    Published 2022
    “…This problem has been widely studied and optimised using different methods. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    A Comparative Study on three Component Selection Mechanisms for Hyper-Heuristics in Expensive Optimization

    A Comparative Study on three Component Selection Mechanisms for Hyper-Heuristics in Expensive Optimization by Jia Hui Ong, Jason Teo

    Published 2018
    “…Numerous studies in optimization problems often lead to tailoring a specific algorithm to adapt to the problem instances, especially in expensive optimization problems. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Solving university examination timetabling problem using intelligent water drops algorithm

    Solving university examination timetabling problem using intelligent water drops algorithm by Aldeeb B.A., Norwawi N.M., Al-Betar M.A., Jali M.Z.B.

    Published 2024
    Conference Paper
    Save to List
    Saved in:

Search Tools: