Search Results - (( pre processing parallel algorithm ) OR ( java application tree algorithm ))

Refine Results
  1. 1

    Enhancement of parallel thinning algorithm for handwritten characters using neural network by Engkamat, Adeline

    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
  2. 2
  3. 3

    Image based autonomous indoor parallel parking assist on omni-directional vehicle (ODV) by Edwind, Liaw Yee Kang

    Published 2016
    “…The image processing algorithm is first developed using Visual Studio C++ and OpenCV. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  4. 4

    Image classification using two dimensional wavelet coefficients with parallel computing by Ong, Yew Fai

    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
  5. 5

    Local search approaches for patient scheduling problem in parallel operating theatre by Alimin, Nur Neesha

    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
  6. 6

    Study and Implementation of Data Mining in Urban Gardening by Mohana, Muniandy, Lee, Eu Vern

    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
  7. 7
  8. 8

    Thermal Properties And Ground-State Structures Of Pure And Alloy Nanoclusters Via Molecular Dynamics Simulation by Ong, Yee Pin

    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
  9. 9

    Adoption of machine learning algorithm for analysing supporters and non supporters feedback on political posts / Ogunfolajin Maruff Tunde by Ogunfolajin Maruff , Tunde

    Published 2022
    “…This thesis is based on the application of sentiment classification algorithm to tweet data with the goal of classifying messages based on the polarity of sentiment towards a particular topic (or subject matter). …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    Projecting named entity tags from a resource rich language to a resource poor language by Zamin, Norshuhani, Oxley, Alan, Abu Bakar, Zainab

    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
  11. 11

    Projecting named entity tags from a resource rich language to a resource poor language by Zamin, N., Oxley, A., Bakar, Z.A.

    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
  12. 12

    Projecting named entity tags from a resource rich language to a resource poor language by Zamin, N., Oxley, A., Bakar, Z.A.

    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
  13. 13

    Projecting named entity tags from a resource rich language to a resource poor language by Zamin, N., Oxley, A., Bakar, Z.A.

    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
  14. 14

    Studies on flat CORDIC implementation in field programmable gate arrays (FPGA) / Meera Subramaniam by 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
  15. 15

    A novel association rule mining approach using TID intermediate itemset by Aqra, Iyad, Herawan, Tutut, Ghani, Norjihan Abdul, Akhunzada, Adnan, Ali, Akhtar, Bin Razali, Ramdan, Ilahi, Manzoor, Raymond Choo, Kim-Kwang

    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
  16. 16

    Mining Sequential Patterns Using I-PrefixSpan by Dhany , Saputra, Rambli Dayang, R.A., Foong, Oi Mean

    Published 2007
    “…In this paper, we propose an improvement of pattern growth-based PrefixSpan algorithm, called I-PrefixSpan. The general idea of I-PrefixSpan is to use the efficient data structure for general tree-like framework and separator database to reduce the execution time and memory usage. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17

    Magnetic resonance imaging sense reconstruction system using FPGA / Muhammad Faisal Siddiqui by 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
  18. 18

    A novel association rule mining approach using TID intermediate itemset by Aqra, Iyad, Herawan, Tutut, Norjihan, Abdul Ghani, Akhunzada, Adnan, Ali, Akhtar, Ramdan, Razali, Ilahi, Manzoor, Choo, Kim-Kwang Raymond

    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
  19. 19

    AI powered asthma prediction towards treatment formulation: an android app approach by Murad, Saydul Akbar, Adhikary, Apurba, Md Muzahid, Abu Jafar, Sarker, Md Murad Hossain, Khan, Md. Ashikur Rahman, Hossain, Md. Bipul, Bairagi, Anupam Kumar, Masud, Mehedi, Kowsher, Md

    Published 2022
    “…We utilized eight robust machine learning algorithms to analyze this dataset. We found that the Decision tree classifier had the best performance, out of the eight algorithms, with an accuracy of 87%. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    K Nearest Neighbor Joins And Mapreduce Process Enforcement For The Cluster Of Data Sets In Bigdata by Md Shah, Wahidah, Othman, Mohd Fairuz Iskandar, Hussian Hassan, Ali Abdul, Talib, Mohammed Saad, Mohammed, Ali Abdul Jabbar

    Published 2018
    “…K Nearest Neighbor Joins (KNN join) are regarded as highly primitive and expensive operations in the data mining.The efficient use of KNN join has proven good results in finding the objects from two data sets prevailed in the huge databases.This has been achieved with the combination of K-Nearest Neighbor query and join operation to find the distinct objects from different data sets.MapReduce is a newly introduced program with the combination of Map Procedure method and Reduce Method widely used in BigData.MapReduce is enriched with parallel distributed algorithm to find the results on a cluster of data sets in BigData.In this paper,the combination of KNN join and MapReduce methods are utilized on the cluster of data sets in BigData for knowledge discovery.Exploring the pinpoint data from huge data sets stored in Big Data demands the distributed large scale data processing.The present research paper is focusing on generic steps for KNN joins exploration operations on MapReduce.The operations of KNN Join are targeted to perform the data partitioning and data pre-processing and necessary calculations.By utilizing the combination of KNN joins with MapReduce methods on BigData data sets will demonstrate a solution for complex computational analysis. …”
    Get full text
    Get full text
    Get full text
    Article