Search Results - (( java implementation tree algorithm ) OR ( knowledge using graph algorithm ))

Refine Results
  1. 1

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

    Optimizing boarding school schedule using graph coloring: case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri by Mohd Asri, Nur Farhana

    Published 2022
    “…Greedy Algorithm is used to solve the Vertex Coloring approach meanwhile Graph Coloring Algorithm is used to solve the Edge Coloring approach. …”
    Get full text
    Get full text
    Research Reports
  3. 3

    Optimizing boarding school schedule using graph colouring : case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri by Mohd Asri, Nur Farhana

    Published 2021
    “…Greedy Algorithm is used to solve the Vertex Coloring approach meanwhile Graph Coloring Algorithm is used to solve the Edge Coloring approach. …”
    Get full text
    Get full text
    Student Project
  4. 4

    The conceptual framework of knowledge of large scale and incomplete graphs of skyline queries optimization using machine learning by Noor, Ubair, Hassan, Raini, Dwi Handayani, Dini Oktarina

    Published 2025
    “…However, not much attention has been paid to issues related to skyline query processing over knowledge of large-scale incomplete graph databases. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  5. 5

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

    Published 2022
    “…The method was implemented using Java and the results of the simulation were evaluated using five standard performance metrics: accuracy, AUC, precision, recall, and f-Measure. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Dissimilarity algorithm on conceptual graphs to mine text outliers by Kamaruddin, Siti Sakira, Hamdan, Abdul Razak, Abu Bakar, Azuraliza, Mat Nor, Fauzias

    Published 2009
    “…The graphical text representation method such as Conceptual Graphs (CGs) attempts to capture the structure and semantics of documents.As such, they are the preferred text representation approach for a wide range of problems namely in natural language processing, information retrieval and text mining.In a number of these applications, it is necessary to measure the dissimilarity (or similarity) between knowledge represented in the CGs.In this paper, we would like to present a dissimilarity algorithm to detect outliers from a collection of text represented with Conceptual Graph Interchange Format (CGIF).In order to avoid the NP-complete problem of graph matching algorithm, we introduce the use of a standard CG in the dissimilarity computation.We evaluate our method in the context of analyzing real world financial statements for identifying outlying performance indicators.For evaluation purposes, we compare the proposed dissimilarity function with a dice-coefficient similarity function used in a related previous work.Experimental results indicate that our method outperforms the existing method and correlates better to human judgements. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7
  8. 8
  9. 9

    Optimizing schedule of boarding school using vertex and edge coloring approach / Nurhuda Ismail, Siti Sarah Raseli and Nur Farhana Mohd Asri by Ismail, Nurhuda, Raseli, Siti Sarah, Mohd Asri, Nur Farhana

    Published 2021
    “…Greedy Algorithm has been used to solve the Vertex Coloring approach while Graph Coloring Algorithm has been used to solve the Edge Coloring approach. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10
  11. 11

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    Automatic clustering of gene ontology by genetic algorithm by Othman, Razib M., Deris, Safaai, Zakaria, Zalmiyah, Illias, Rosli M., Mohamad, Saberi M.

    Published 2006
    “…Clustering the Gene Ontology is a difficult combinatorial problem and can be modeled as a graph partitioning problem. Additionally, deciding the number k of clusters to use is not easily perceived and is a hard algorithmic problem. …”
    Get full text
    Get full text
    Article
  14. 14
  15. 15

    DeMI interface tool for profit estimation and waste conversion technology recommendations in enhancing municipal solid waste management by Ali, R.A., Nik Ibrahim, N.N.L., Ghani, W.A.W.A.K., Sani, N.S., Lam, H.L.

    Published 2024
    “…This state-of-the-art tool seamlessly combines process network synthesis and machine learning, using the Process Graph (P-graph) and the Waikato Environment for Knowledge Analysis (WEKA) software tools. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16
  17. 17

    Defects identification on semiconductor wafer for yield improvement using machine learning / Pedram Tabatabaeemoshiri by Pedram , Tabatabaeemoshiri

    Published 2025
    “…This work presents a novel graph-based semi-supervised learning (GSSL) algorithm designed for wafer defect detection. …”
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    Performance analysis of bacterial genome assemblers using illumina next generation sequencing data / Nur ‘ Ain Mohd Ishak by Nur ‘ Ain , Mohd Ishak

    Published 2020
    “…In this study, the performance of four de novo assemblers (SPAdes, ABySS, Velvet and MaSuRCA) is reported, in which variants of de Brujin graph algorithms are applied, using genomic data generated by the Illumina sequencing platform. …”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19
  20. 20

    Constrained clustering approach to aid in remodularisation of object-oriented software systems / Chong Chun Yong by Chong, Chun Yong

    Published 2016
    “…Even if maintainers possess additional information that could be useful to guide and improve the clustering results, traditional clustering algorithms have no way to take advantage of this information. …”
    Get full text
    Get full text
    Thesis