Search Results - (( java implementation mining algorithm ) OR ( using problems a algorithm ))
Search alternatives:
- implementation mining »
- java implementation »
- mining algorithm »
- using problems »
- a algorithm »
- problems a »
-
1
Direct approach for mining association rules from structured XML data
Published 2012“…The thesis also provides a two different implementation of the modified FLEX algorithm using a java based parsers and XQuery implementation. …”
Get full text
Get full text
Thesis -
2
Image clustering comparison of two color segmentation techniques
Published 2010“…The clustering research is regarding the area of data mining and implementation of the clustering algorithms. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
3
Features selection for intrusion detection system using hybridize PSO-SVM
Published 2016“…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
Get full text
Get full text
Thesis -
4
Study and Implementation of Data Mining in Urban Gardening
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 -
5
Scalable approach for mining association rules from structured XML data
Published 2009“…Many techniques have been proposed to tackle the problem of mining XML data we study the various techniques to mine XML data and yet We presented a java based implementation of FLEX algorithm for mining XML data.…”
Get full text
Get full text
Conference or Workshop Item -
6
Mining association rules from structured XML data
Published 2009“…Many techniques have been proposed to tackle the problem of mining XML data. We study the various techniques to mine XML data and yet We presented a java based implementation of FLEX algorithm for mining XML data.…”
Get full text
Get full text
Conference or Workshop Item -
7
A web-based implementation of k-means algorithms
Published 2022“…This stinginess of proximity measures in data mining tools is stifling the performance of the algorithm. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
8
Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem
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 -
9
A discrete simulated kalman filter optimizer for combinatorial optimization problems
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 -
10
Enhancement of Ant System Algorithm for Course Timetabling Problem
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 -
11
Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms
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 -
12
Comparison between ant colony and genetic algorithm using traveling salesman problem
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 -
13
A Micro-Genetic Algorithm Approach for Soft Constraint Satisfaction Problem in University Course Scheduling
Published 2013“…This problem can be minimized by using a Micro Genetic Algorithm approach. …”
Get full text
Get full text
Get full text
Thesis -
14
Optimization and discretization of dragonfly algorithm for solving continuous and discrete optimization problems
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 -
15
A new cryptographic algorithm based on decomposition problem in elliptic curve cryptography / 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 -
16
Simulated Kalman Filter algorithms for solving optimization problems
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 -
17
Bats echolocation-inspired algorithms for global optimisation problems
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 -
18
-
19
Bees algorithm for Forest transportation planning optimization in Malaysia
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 -
20
Levy slime mould algorithm for solving numerical and engineering optimization problems
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
