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

Search alternatives:

Refine Results
  1. 1
    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
    “…Sequential pattern mining is a new branch of data, mining science that solves inter-transaction pattern mining problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    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 thesis is based on the application of sentiment classification algorithm to tweet data with the goal of classifying messages based on the polarity of sentiment towards a particular topic (or subject matter). …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Mining Sequential Patterns Using I-PrefixSpan

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

    Published 2007
    “…Sequential pattern mining is a relatively new data-mining problem with many areas of application. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  4. 4
    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:
  5. 5
    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:
  6. 6
    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:
  7. 7
    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:
  8. 8
    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
    “…The proposed method provides a platform to efficiently solve the MC problem by using approximation algorithm of Minimum Vertex Cover (MVC).…”
    Get full text
    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
    “…Two types of analysis are used to evaluate the proposed algorithm. First, the DSKFO algorithm is used to solve the travelling salesman problem (TSP), and then the algorithm's execution time is measured. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Enhancement of Ant System Algorithm for Course Timetabling Problem

    Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

    Published 2009
    “…As a member of the NP Problem, an exact algorithm to solve the course scheduling problem is not available to date. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms

    Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms by Alomoush, Alaa A., Alsewari, Abdulrahman A., Alamri, Hammoudeh S., Kamal Z., Zamli

    Published 2018
    “…In this research, a new hybrid algorithm of Harmony search and Jaya search algorithms applied on 0/1 Knapsack problem to find a near optimal results. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    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
    “…The aim of this study is compare the effect of using two distributed algorithm which are ant colony as a Swarm intelligence algorithm and genetic algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    A Micro-Genetic Algorithm Approach for Soft Constraint Satisfaction Problem in University Course Scheduling

    A Micro-Genetic Algorithm Approach for Soft Constraint Satisfaction Problem in University Course Scheduling by Abd. Halim, Bohadean @ Bohari

    Published 2013
    “…This problem can be minimized by using a Micro Genetic Algorithm approach. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Optimization and discretization of dragonfly algorithm for solving continuous and discrete optimization problems

    Optimization and discretization of dragonfly algorithm for solving continuous and discrete optimization problems by Bibi Amirah Shafaa, Emambocus

    Published 2024
    “…Furthermore, the original DA is only suitable for solving continuous optimization problems. Although there is a binary version of the algorithm, it cannot be directly used for solving discrete optimization problems like the Traveling Salesman Problem (TSP). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    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
    “…This approach presents better platform in finite field E as compared to the original works using the braid groups. The second algorithm deals with the use of Decomposition Problem in encryption scheme for ECC. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Simulated Kalman Filter algorithms for solving optimization problems

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…Applications and improvements to the HKA algorithm suggest that optimization algorithm based on estimation principle has a huge potential in solving a wide variety of optimization problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Bats echolocation-inspired algorithms for global optimisation problems

    Bats echolocation-inspired algorithms for global optimisation problems by Nafrizuan, Mat Yahya

    Published 2016
    “…The algorithm is a hybrid algorithm that operates using dual level search strategy that takes merits of a particle swarm optimisation algorithm and a modified adaptive bats sonar algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Using Metaheuristics Algorithms (MHAs) to Optimize Water Supply Operation in Reservoirs: a Review

    Using Metaheuristics Algorithms (MHAs) to Optimize Water Supply Operation in Reservoirs: a Review by Almubaidin M.A.A., Ahmed A.N., Sidek L.B.M., Elshafie A.

    Published 2023
    Review
    Save to List
    Saved in:
  19. 19
    Bees algorithm for Forest transportation planning optimization in Malaysia

    Bees algorithm for Forest transportation planning optimization in Malaysia by Jamaluddin, Jamhuri, Kamarudin, Norizah, Ismail, Mohd Hasmadi, Ahmad, Siti Azfanizam

    Published 2021
    “…Algorithm is widely used in various areas due to its ability to solve classes of problems. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Levy slime mould algorithm for solving numerical and engineering optimization problems

    Levy slime mould algorithm for solving numerical and engineering optimization problems by J. J., Jui, M. A., Ahmad, M. I. M., Rashid

    Published 2022
    “…The proposed Levy Slime Mould Algorithm (LSMA) is a novel metaheuristic algorithm that integrates the Levy distribution into a new metaheuristic called Slime Mould Algorithm (SMA) for solving numerical and engineering problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: