Search Results - (( problem implementation re algorithm ) OR ( java application mining algorithm ))
Search alternatives:
- problem implementation »
- application mining »
- implementation re »
- java application »
- mining algorithm »
- re algorithm »
-
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
An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion
Published 2018“…We have chosen four neighborhood based algorithms which are commonly used in optimization problems and divided them in newly implemented and re-implemented category. …”
Get full text
Get full text
Thesis -
5
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 -
6
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 -
7
Mining Sequential Patterns using I-PrefixSpan
Published 2008Get full text
Get full text
Citation Index Journal -
8
A backward recovery mechanism in preemptive utility accrual real time scheduling algorithm
Published 2010“…Problem statement: This study proposed a robust algorithm named as Backward Recovery Preemptive Utility Accrual Scheduling (BRPUAS) algorithm that implements the Backward Recovery(BR) mechanism as a fault recovery solution under the existing utility accrual scheduling environment. …”
Get full text
Get full text
Article -
9
Design and analysis of sequence generator module using eulerian path algorithm for DNA fragment assembly / Mustaqim Mohd Subri
Published 2013“…This project is to design and analysis the sequence generator module using Eulerian Path algorithm for DNA fragment assembly. Traditionally, “overlap-layoutconsensus” technique is used for DNA fragment assembly, but this technique has a problem in assembling a long sequence of DNA which a new technique needs to be used to overcome this problem. …”
Get full text
Get full text
Student Project -
10
Vector Evaluated Gravitational Search Algorithm Assisted by Non-dominated Solutions in Solving Multiobjective Optimization Problems
Published 2016“…Previously, non-dominated solutions have been employed to improve the performance of particle swarm optimization (PSO). In this paper, we re-implement the same concept to gravitational search algorithm (GSA). …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
11
An ensemble of neural network and modified grey wolf optimizer for stock prediction
Published 2019“…The research implements stock prediction analysis as a case study for training the neural network by adopting MGWO algorithm. …”
Get full text
Get full text
Thesis -
12
Improving utility and recovery algorithms for adaptive real time system in multiprocessor environment
Published 2012“…These algorithms solved the abortion problem in the existing General Utility Scheduling (GUS). …”
Get full text
Get full text
Thesis -
13
Optimization Of Fuzzy Logic Controllers With Genetic Algorithm For Two-Part-Type And Re-Entrant Production Systems
Published 2008“…The optimized GDF and GSF can be used in real implementations. GDF and GSF controllers are evaluated for two test cases namely “two-part-type production line” and “re-entrant production system”. …”
Get full text
Get full text
Thesis -
14
Comparative Analysis of Neighborhood based Meta-heuristic Algorithms for MC/DC Test Data Generation
Published 2016“…In order to help test engineers to make informed decision on the best neighborhood based implementations, this paper investigates the size and time performance of two MC/DC test strategies re-implementation based on Simulated Annealing against two newly developed strategies based on Great Deluge and Late Acceptance Hill Climbing algorithms respectively. …”
Get full text
Get full text
Conference or Workshop Item -
15
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 -
16
Traffic management algorithms for LEO satellite networks
Published 2016“…In dealing with traffic routing problem, two algorithms, Dijkstra's Shortest Path and Genetic Algorithm (GA) are combined together and enhanced to re-strategize a better routing mechanism for a heterogeneous mix of traffic classes ranging from traditional voice calls to multimedia data services in Low Earth Orbit (LEO) satellite networks. …”
Get full text
Get full text
Get full text
Thesis -
17
Outdoor marker-less tracking and pose calculating system for mobile augmented reality
Published 2014“…This research investigates and re-designs the “speed up robust feature” (SURF) algorithm for Smartphones to enable it to recognize the real world objects. …”
Get full text
Get full text
Thesis -
18
Logistic Regression Methods with Truncated Newton Method
Published 2012“…Instead of using IRLS procedure as used by TR-KLR and TR-IRLS, the proposed algorithms implement Newton-Raphson method as the outer algorithm of Truncated Newton for KLR and RLR respectively. …”
Get full text
Get full text
Article -
19
Hybrid metaheuristic method for clustering in wireless sensor networks / Bryan Raj Peter Jabaraj
Published 2023“…The adaptive HSSOGA (aHSSOGA) is implemented in the WSN environment to mitigate the isolated node and energy hole problems. …”
Get full text
Get full text
Get full text
Thesis -
20
An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network
Published 2017“…In order to achieve this objective, each node must be connected in its shortest way as possible. We start our algorithm by designing shortest path algorithm based on Dijkstra's method. …”
Get full text
Get full text
Get full text
Article
