Search Results - (( solution using random algorithm ) OR ( java application mining algorithm ))
Search alternatives:
- application mining »
- random algorithm »
- java application »
- mining algorithm »
- solution using »
-
1
Direct approach for mining association rules from structured XML data
Published 2012Get 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
Evacuation routing optimizer (EROP) / Azlinah Mohamed … [et al.]
Published 2011“…Solutions reached by analyses with CF random and inertia weight sorted in ascending order were shown to be competitive with those obtained using inertia weight with random capacity. …”
Get full text
Get full text
Research Reports -
8
The Anglerfish algorithm: a derivation of randomized incremental construction technique for solving the traveling salesman problem
Published 2019“…Benchmarking is conducted using the traveling salesman problem. The results are comparable with the results of advanced metaheuristic algorithms. …”
Get full text
Get full text
Article -
9
Combining approximation algorithm with genetic algorithm at the initial population for NP-complete problem
Published 2018“…We tested this approach by sampling the populations for some Set Covering Problems from OR Library using the randomized rounding method (AAR) and compared them with that sampled using a randomized heuristics (R) in terms of redundancy rate, diversity and closeness to the optimal solution (OPT). …”
Get full text
Get full text
Article -
10
Synchronous-asynchronous simulated kalman filter algorithm with random switching
Published 2020Get full text
Get full text
Get full text
Conference or Workshop Item -
11
Harmony search algorithm for curriculum-based course timetabling problem
Published 2013“…In this paper, harmony search algorithm is applied to curriculum-based course timetabling.The implementation, specifically the process of improvisation consists of memory consideration, random consideration and pitch adjustment.In memory consideration, the value of the course number for new solution was selected from all other course number located in the same column of the Harmony Memory.This research used the highest occurrence of the course number to be scheduled in a new harmony.The remaining courses that have not been scheduled by memory consideration will go through random consideration, i.e. will select any feasible location available to be scheduled in the new harmony solution. …”
Get full text
Get full text
Get full text
Article -
12
Harmony search algorithm for curriculum-based course timetabling problem
Published 2013“…However, the algorithm produced results that were not comparatively better than those previously known as best solution.With proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
13
A Kalman-Filter-Based Sine-Cosine Algorithm
Published 2019“…SKF is a random based optimization algorithm inspired from the Kalman Filter theory. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
14
African Buffalo Optimization and the Randomized Insertion Algorithm for the Asymmetric Travelling Salesman’s Problems
Published 2016“…Similarly, both methods employ different search techniques in attempting solutions to the ATSP: while the African Buffalo Optimization uses the modified Karp-Steele technique, the Randomized Insertion employs random insertion mechanism. …”
Get full text
Get full text
Get full text
Article -
15
A Comparative Study of African Buffalo Optimization and Randomized Insertion Algorithm for Asymmetric Travelling Salesman's Problem
Published 2015“…The Randomized Insertion and African Buffalo Optimization algorithms employ two different methods in attempting solutions to ATSP: the African Buffalo Optimization employs the modified Karp-Steele approach while the Randomized Insertion uses random insertion approach. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
16
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 -
17
Binary ant colony optimization algorithm in learning random satisfiability logic for discrete hopfield neural network
Published 2024“…It aimed to optimize the performance of G-type random high-order satisfiability logic structures embedded in Discrete Hopfield Neural Networks, thereby enhancing the efficiency of the Hopfield Neural Network learning algorithm. …”
Get full text
Get full text
Get full text
Article -
18
A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem
Published 2021“…The comparative algorithms in this study employ different techniques in their search for solutions to ATSP: the African Buffalo Optimization employs the modified Karp–Steele mechanism, Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO) employs the path construction with patching technique, Cooperative Genetic Ant System uses natural selection and ordering; Randomized Insertion Algorithm uses the random insertion approach, and the Improved Extremal Optimization uses the grid search strategy. …”
Get full text
Get full text
Get full text
Article -
19
Comparison between Genetic Algorithm and Prey-Predator Algorithm.
“…In the algorithm, randomly generated solution are assigned as a predator and preys depending on their performance on the objective function. …”
Get full text
Monograph -
20
Opposition-based Whale Optimization Algorithm
Published 2018“…The OWOA use the Opposition-based method to enhance Whale Optimization Algorithm (WOA) performance. …”
Get full text
Get full text
Get full text
Article
