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

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

“…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

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

“…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

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

“…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

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

“…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

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

Get full text
Get full text

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

“…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

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.

“…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

Application of genetic algorithm methods to optimize flowshop sequencing problem by Mohd Fadil, Md Sairi

“…This project will focusing on the method used to solve an optimization problem, the limitation of the method used and the results of solving flow shop sequencing problem using genetic algorithm method. …”
Get full text
Get full text

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

“…Background and Objective: The process of solving the Maximum Clique (MC) problem through approximation algorithms is harder, however, the Maximum Vertex Cover (MVC) problem can easily be solved using approximation algorithms. …”
Get full text
Get full text
Get full text
Get full text

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

“…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

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

“…As the requirement of the Ant System Algorithm, the problem is modeled as a graph that can be used by the ant to deliver its pheromone. …”
Get full text
Get full text
Get full text

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

“…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

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

“…In ant colony algorithm each individual ant constructs a part of the solution using an artificial pheromone which reflects its experience accumulated while solving the problem and heuristic information dependent on the problem. …”
Get full text
Get full text
Get full text

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

“…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

Recent Evolutionary Algorithm Variants for Combinatorial Optimization Problem by Anniza, Hamdan, San Nah, Sze, Say Leng, Goh, Kang Leng, Chiew, Wei King, Tiong

“…The evolutionary algorithm has been extensively used to solve a range of combinatorial optimization problems. …”
Get full text
Get full text
Get full text
Get full text

Task scheduling in cloud computing environment using hybrid genetic algorithm and bat algorithm by Muhammad Syahril Mohamad Sainal

“…Meta-heuristic algorithms are mostly used to solve this problem. For example, Genetic Algorithm with Particle Swarm Optimization, Genetic Algorithm with Artificial Bee Colony Algorithms (ABC) and Genetic Algorithm with Ant Colony Optimization Algorithms. …”
Get full text
Get full text
Get full text

Hybrid multiobjective genetic algorithm for integrated dynamic scheduling and routing of jobs and automated guided vehicles in flexible manufacturing systems by Umar, Umar Ali

“…The comparison of the result of the developed integrated algorithm using two benchmark FMS scheduling algorithms datasets is conducted. …”
Get full text
Get full text

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

“…Algorithm is widely used in various areas due to its ability to solve classes of problems. …”
Get full text
Get full text

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

“…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

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

“…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