Search Results - (( problems among process algorithm ) OR ( java application mining algorithm ))
Search alternatives:
- application mining »
- process algorithm »
- java application »
- mining algorithm »
- among process »
- problems »
-
1
Direct approach for mining association rules from structured XML data
Published 2012“…Even though it makes use of the existing technology, this approach is often time consuming and involves manual intervention because of the mapping process. The focus of this study is to propose an enhancement on memory consumption by reducing the number of candidates generated for the existing FLEX algorithm which will reduce the amount of memory needed to execute the algorithm. …”
Get full text
Get full text
Thesis -
2
-
3
Study and Implementation of Data Mining in Urban Gardening
Published 2019“…Attached sensors generate data and send these data to the Java Servlet application through a WIFI module. These data are processed and stored in appropriate formats in a MySQL server database. …”
Get full text
Get full text
Get full text
Article -
4
Mining Sequential Patterns Using I-PrefixSpan
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 -
5
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 -
6
Mining Sequential Patterns using I-PrefixSpan
Published 2008Get full text
Get full text
Citation Index Journal -
7
Features selection for intrusion detection system using hybridize PSO-SVM
Published 2016“…The simulation will be carried on WEKA tool, which allows us to call some data mining methods under JAVA environment. The proposed model will be tested and evaluated on both NSL-KDD and KDD-CUP 99 using several performance metrics.…”
Get full text
Get full text
Thesis -
8
Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim
Published 2012“…This project focuses on step-up cluster computing and a parallel Genetic Algorithm. The objectives of this project to set-up Beowulf cluster computer to apply the Travelling Salesman Problem in parallel by using Genetic Algorithms and evaluate sequential algorithms and parallel algorithms by Genetic Algorithms. …”
Get full text
Get full text
Thesis -
9
Enhanced gravitational search algorithm for nano-process parameter optimization problem / Norlina Mohd Sabri
Published 2020“…Based on the capabilities of the metaheuristic algorithms, this research is proposing the enhanced Gravitational Search Algorithm (eGSA) to solve the nano-process parameter optimization problem. …”
Get full text
Get full text
Thesis -
10
A refined differential evolution algorithm for improving the performance of optimization process
Published 2011“…Various Artificial Intelligent (AI) algorithms can be applied in solving optimization problems. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
11
Task allocation in production systems using firefly algorithm / Nurhani Zawani Zulkifli
Published 2020“…However, there exists a problem in the assembly line process by which the management always deal with unbalancing of the assembly work among the workstations. …”
Get full text
Get full text
Thesis -
12
Genetic Algorithm for vehicle routing problem / W.Nurfahizul Ifwah W.Alias, Mohd Shaiful Sharipudin and Shamsunarnie Mohamed Zukri.
Published 2012“…Goldberg gives an interesting survey of some of the practical work carried out in this era. Among these early applications of GA were those developed by Bagley for a game-playing program, by Rosenberg in simulating biological processes, and by Cavicchio for solving pattern-recognition problems. …”
Get full text
Get full text
Research Reports -
13
A GPU accelerated parallel genetic algorithm for the traveling salesman problem
Published 2024“…The problem was classified as NP-Hard. Several different algorithms were developed to solve the problem; among them, the Genetic Algorithm was used to deal with it. …”
Get full text
Get full text
Get full text
Article -
14
A genetic algorithm on single machine family scheduling problem to minimise total weighted completion time
Published 2009“…The proposed algorithm finds the best offspring solution among an exponentially large number of potential offspring. …”
Get full text
Get full text
Article -
15
Angle Modulated Simulated Kalman Filter Algorithm for Combinatorial Optimization Problems
Published 2016“…Agents communicate among them to update and improve the solution during the search process. …”
Get full text
Get full text
Get full text
Get full text
Article -
16
-
17
The Evolutionary Convergent Algorithm: A Guiding Path of Neural Network Advancement
Published 2025“…Among these algorithms, metaheuristics are an appropriate tool to solve these real problems. …”
Article -
18
Metric's thresholds for encoding evolutionary computing representation in software engineering problem
Published 2015“…Algorithm was tested to metric selection problem using Genetic Algorithm and the results obtained are promising.…”
Get full text
Get full text
Get full text
Article -
19
Gravitational Search Algorithm for Assembly Sequence Planning
Published 2014“…A better assembly sequence can contribute to reduce the cost and time of the manufacturing process, that is, among NP-hard problems. Thus, it is needed to find the optimal sequence from the feasible assembly sequences. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
20
Optimised Crossover Genetic Algorithms for Combinatorial Optimisation Problems
Published 2010“…Most of the current methods of crossover determine o®spring by using a stochastic approach and without reference to the objective function with the result being that a potentially optimal solution could be lost through incorrect choices being made in the randomisation process. This thesis focuses on the development of a new stream of crossover within genetic algorithms, called Optimised Crossover Genetic Algorithm (OCGA) for solving combinatorial optimisation problems, which takes into account the objective function in finding the best ofspring solution among an exponentially large number of potential ofspring. …”
Get full text
Get full text
Thesis
