Search Results - (( problem solving proposed algorithm ) OR ( java application mining 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

“…Sequential pattern mining is a new branch of data, mining science that solves inter-transaction pattern mining problems. …”
Get full text
Get full text

Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

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

“…The proposed algorithm has efficiently solved the MC problem within the reduced time limit. …”
Get full text
Get full text
Get full text
Get full text

Iterative methods for solving split common fixed point problems in Hilbert spaces by Mohammed, Lawan Bulama

“…Our interest here is to apply these mappings to propose some algorithms for solving split common fixed point problems and its variant forms, in the end, we prove the convergence results of these algorithms. …”
Get full text
Get full text
Get full text

Application of adaptive bats sonar algorithm for solving a single objective of practical business optimisation problem PROBLEM by Nafrizuan, Mat Yahya, M. Nafis, O. Z.

“…The proposed algorithm is applied to solve two practical business optimisation problems. …”
Get full text
Get full text
Get full text

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

“…An adaptive bats sonar algorithm is proposed for solving single objective optimisation problems. …”
Get full text
Get full text

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

“…Due to the practical significance of this problem in real-world issues, numerous algorithms have been proposed to solve it. …”
Get full text
Get full text

The Evolutionary Convergent Algorithm: A Guiding Path of Neural Network Advancement by Hosseini E., Al-Ghaili A.M., Kadir D.H., Daneshfar F., Gunasekaran S.S., Deveci M.

“…Finally, SGA is proposed to solve very extensive test problems including IoT optimization problems. …”

Optimal power flow based on fuzzy linear programming and modified Jaya algorithms by Alzihaymee, Warid Sayel Warid

“…Two versions of the Jaya algorithm namely, the basic Jaya algorithm and novel quasi-oppositional Jaya (QOJaya) algorithm are proposed to solve different single objective OPF problems. …”
Get full text
Get full text

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

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

An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP by Bibi Aamirah Shafaa Emambocus, Muhammed Basheer Jasser, Muzaffar Hamzah, Aida Mustapha, Angela Amphawan

“…Several variants of PSO have been proposed for solving discrete optimization problems like TSP. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Artificial bee colony algorithm for solving optimal power flow problem by Le Dinh, L., Vo Ngoc, D., Vasant, P.

“…This paper proposes an artificial bee colony (ABC) algorithm for solving optimal power flow (OPF) problem. …”
Get full text
Get full text

Shuffled frog leaping algorithm for solving economic load dispatch problem / Mohammad Ariffin Aizat Ezanee by Ezanee, Mohammad Ariffin Aizat

“…Shuffled Frog Leaping Algorithm (SFLA) is proposed to solve Economic Load Dispatch (ELD) problem. …”
Get full text
Get full text

Formulating new enhanced pattern classification algorithms based on ACO-SVM by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…ACO originally deals with discrete optimization problem.In applying ACO for solving SVM model selection problem which are continuous variables, there is a need to discretize the continuously value into discrete values.This discretization process would result in loss of some information and hence affects the classification accuracy and seeking time.In this algorithm we propose to solve SVM model selection problem using IACOR without the need to discretize continuous value for SVM.The second algorithm aims to simultaneously solve SVM model selection problem and selects a small number of features.SVM model selection and selection of suitable and small number of feature subsets must occur simultaneously because error produced from the feature subset selection phase will affect the values of SVM model selection and result in low classification accuracy.In this second algorithm we propose the use of IACOMV to simultaneously solve SVM model selection problem and features subset selection.Ten benchmark datasets were used to evaluate the proposed algorithms.Results showed that the proposed algorithms can enhance the classification accuracy with small size of features subset.…”
Get full text
Get full text
Get full text

Levy tunicate swarm algorithm for solving numerical and real-world optimization problems by J. J., Jui, M. A., Ahmad, M. I. M., Rashid

“…The proposed Levy Tunicate Swarm Algorithm (LTSA) is a novel metaheuristic algorithm that integrates the Levy distribution into a new metaheuristic algorithm called Tunicate Swarm Algorithm (TSA) to solve numerical and real-world optimization problems. …”
Get full text
Get full text
Get full text

Gravitational search – bat algorithm for solving single and bi-objective of non-linear functions by Abbas, Iraq Tareq

“…Later, this algorithm was used to solve bi-objective Production Planning (PP) and Scheduling Problem (Sch.P). …”
Get full text
Get full text

Simulated annealing algorithm for solving chambering student-case assignment problem by Ghazali, Saadiah, Abdul Rahman, Syariza

“…The challenge of solving the problem raise whenever the complexity related to preferences, the existence of real-world constraints and problem size increased.This study focuses on solving a chambering student-case assignment problem by using a simulated annealing algorithm where this problem is classified under project assignment problem.The project assignment problem is considered as hard combinatorial optimization problem and solving it using a metaheuristic approach is an advantage because it could return a good solution in a reasonable time. …”
Get full text
Get full text
Get full text

Modification of the ant colony optimization algorithm for solving multi-agent task allocation problem in agricultural application by Hardhienata, Medria Kusuma Dewi, Priandana, Karlisa, Putra, Daffa Rangga, Sriatun, Mamiek, Wulandari, Buono, Agus, Mohamed, Raihani

“…Simulation results showed that the proposed ACO algorithm with the modified efficiency factor improved the performance of basic ACO algorithm for solving task allocation problem in terms of the average total travel cost for each agent. …”
Get full text
Get full text
Get full text

A Modified Bats Echolocation-Based Algorithm for Solving Constrained Optimisation Problems by N. M., Yahya, Tokhi, M. O.

“…The proposed algorithm is applied to solve the constrained optimisation problems coupled with penalty function method as constraint handling technique. …”
Get full text
Get full text
Get full text

An improved tabu search for solving symmetric traveling salesman problems by Lim, Yai Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan

“…In this paper, we proposed and improved TS approach for solving symmetric traveling salesman problems (TSP). …”
Get full text
Get full text
Get full text