Search Results - (( java implementation mining algorithm ) OR ( using interactive process algorithm ))
Search alternatives:
- implementation mining »
- java implementation »
- interactive process »
- process algorithm »
- mining algorithm »
-
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
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 -
3
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 -
4
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 -
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
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 -
7
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 -
8
A comparative study on testing optimization techniques with combinatorial interaction testing for optimizing software product line testing
Published 2025“…By using the best optimization algorithm with the optimum number of interaction strengths, the complexity of the SPL testing process could be reduced without prejudicing the quality of the software system itself.…”
Get full text
Get full text
Get full text
Article -
9
Effects of Different Superpixel Algorithms on Interactive Segmentations
Published 2022“…Though employed as pre-processing step in many interactive segmentation algorithms, to date, no study has been conducted to assess the effects of such incorporations on the segmentation algorithms. …”
Get full text
Get full text
Get full text
Article -
10
Effects of Different Superpixel Algorithms on Interactive Segmentations
Published 2022“…Though employed as pre-processing step in many interactive segmentation algorithms, to date, no study has been conducted to assess the effects of such incorporations on the segmentation algorithms. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
11
Sizes of Superpixels and their Effect on Interactive Segmentation
Published 2021“…Despite the fact that it is used as a pre-processing step in many interactive segmentation algorithms, less studies had been conducted to assess the effects of the size of superpixels required by interactive segmentation algorithms to achieve an optimal result. …”
Get full text
Get full text
Get full text
Get full text
Proceedings -
12
Sizes of Superpixels and their Effect on Interactive Segmentation
Published 2021“…Despite the fact that it is used as a pre-processing step in many interactive segmentation algorithms, less studies had been conducted to assess the effects of the size of superpixels required by interactive segmentation algorithms to achieve an optimal result. …”
Get full text
Get full text
Get full text
Proceeding -
13
Efficient prime-based method for interactive mining of frequent patterns.
Published 2011“…During the mining process, the mining algorithm reduces the number of candidate patterns and comparisons by using a new candidate set called candidate head set and several efficient pruning techniques. …”
Get full text
Get full text
Article -
14
VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS.
Published 2012“…Visualization techniques help in understanding the searching behaviour of Genetic Algorithm. lt also makes possible the user interactions during the searching process. …”
Get full text
Get full text
Thesis -
15
On Adopting Parameter Free Optimization Algorithms for Combinatorial Interaction Testing
Published 2015“…Although useful, strategies based on the aforementioned optimization algorithms are not without limitation. …”
Get full text
Get full text
Get full text
Article -
16
SYSTEM IDENTIFICATION AND MODEL PREDICTIVE CONTROL FOR INTERACTING SERIES PROCESS WITH NONLINEAR DYNAMICS
Published 2009“…The study is carried out by experimental works using the gaseous pilot plant as the process. The gaseous pilot plant exhibits the typical dynamic of an interacting series process, where the strong interaction between upstream and downstream properties occurs in both ways. …”
Get full text
Get full text
Thesis -
17
-
18
Superpixel Sizes using Topology Preserved Regular Superpixel Algorithm and their Impacts on Interactive Segmentation
Published 2022“…It is possible to speed up and improve the end result of segmentation by using pre-processing steps. The use of superpixels is an example of a pre-processing step. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
19
Enhancing Harmony Search Metaheuristic Algorithm for Coverage Efficiency, Test Suite Reduction, and Running Time in Combinatorial Interaction Testing
Published 2025“…By systematically covering combinations of input values, CIT can uncover faults that arise from complex interactions. One key aspect of CIT is coverage efficiency, which ensures that the desired interaction coverage is achieved with the fewest possible test cases, optimizing the testing process. …”
Get full text
Get full text
Article -
20
Superpixel Sizes using Topology Preserved Regular Superpixel Algorithm and their Impacts on Interactive Segmentation
Published 2022“…It is possible to speed up and improve the end result of segmentation by using pre-processing steps. The use of superpixels is an example of a pre-processing step. …”
Get full text
Get full text
Get full text
Article
