Search Results - (( pre processing parallel algorithm ) OR ( java application mining algorithm ))
Search alternatives:
- application mining »
- java application »
- mining algorithm »
- pre processing »
-
1
Direct approach for mining association rules from structured XML data
Published 2012Get full text
Get full text
Thesis -
2
-
3
Enhancement of parallel thinning algorithm for handwritten characters using neural network
Published 2005“…This project aims to improve a parallel thinning algorithm that satisfies two fundamental requirements of thinning, namely the processing speed and the quality of skeletons. …”
Get full text
Get full text
Thesis -
4
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 -
5
Image based autonomous indoor parallel parking assist on omni-directional vehicle (ODV)
Published 2016“…The image processing algorithm is first developed using Visual Studio C++ and OpenCV. …”
Get full text
Get full text
Undergraduates Project Papers -
6
Image classification using two dimensional wavelet coefficients with parallel computing
Published 2020“…Parallel processing and matrix convolution inside wavelet transform process is the most prominent study in this research. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
7
Local search approaches for patient scheduling problem in parallel operating theatre
Published 2020“…In the first phase, pre-processing stage, combination of pre-processing stage with low-level heuristic and genetic algorithm are used.The different types of LS are applied in the second phase of scheduling. …”
Get full text
Get full text
Thesis -
8
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 -
9
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 -
10
Mining Sequential Patterns using I-PrefixSpan
Published 2008Get full text
Get full text
Citation Index Journal -
11
Thermal Properties And Ground-State Structures Of Pure And Alloy Nanoclusters Via Molecular Dynamics Simulation
Published 2018“…However, the methods of post-processing and determining the pre-melting and melting range of nanoclusters at specific composition differ in every research. …”
Get full text
Get full text
Thesis -
12
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 -
13
Projecting named entity tags from a resource rich language to a resource poor language
Published 2012“…Named Entity Recognition (NER) is the identification of words in text that correspond to a pre-defined taxonomy such as person, organization, location, date, time, etc.This article focuses on the person (PER), organization (ORG) and location (LOC) entities for a Malay journalistic corpus of terrorism.A projection algorithm, using the Dice Coefficient function and bigram scoring method with domain-specific rules, is suggested to map the NE information from the English corpus to the Malay corpus of terrorism.The English corpus is the translated version of the Malay corpus.Hence, these two corpora are treated as parallel corpora. …”
Get full text
Get full text
Get full text
Article -
14
Projecting named entity tags from a resource rich language to a resource poor language
Published 2013“…Hence, these two corpora are treated as parallel corpora. The method computes the string similarity between the English words and the list of available lexemes in a pre-built lexicon that approximates the best NE mapping. …”
Get full text
Get full text
Article -
15
Projecting named entity tags from a resource rich language to a resource poor language
Published 2013“…Hence, these two corpora are treated as parallel corpora. The method computes the string similarity between the English words and the list of available lexemes in a pre-built lexicon that approximates the best NE mapping. …”
Get full text
Get full text
Article -
16
Projecting named entity tags from a resource rich language to a resource poor language
Published 2013“…Hence, these two corpora are treated as parallel corpora. The method computes the string similarity between the English words and the list of available lexemes in a pre-built lexicon that approximates the best NE mapping. …”
Get full text
Get full text
Article -
17
Studies on flat CORDIC implementation in field programmable gate arrays (FPGA) / Meera Subramaniam
Published 2004“…The successive replacement of the basic CORDIC equations to generate the parallelized Flat CORDIC ones requires that the direction of all the rotations be pre-computed. …”
Get full text
Get full text
Thesis -
18
A novel association rule mining approach using TID intermediate itemset
Published 2018“…Itemset list is intersected to obtain the actual support). Moreover, the algorithm supports to extract many frequent itemsets according to a pre-determined minimum support with an independent purpose. …”
Get full text
Get full text
Article -
19
Magnetic resonance imaging sense reconstruction system using FPGA / Muhammad Faisal Siddiqui
Published 2016“…Under-sampled data is acquired in parallel imaging to expedite the MRI scan process, which leads to aliased images. …”
Get full text
Get full text
Get full text
Thesis -
20
A novel association rule mining approach using TID intermediate itemset
Published 2018“…Itemset list is intersected to obtain the actual support). Moreover, the algorithm supports to extract many frequent itemsets according to a pre-determined minimum support with an independent purpose. …”
Get full text
Get full text
Get full text
Article
