Search Results - (( java implementation mining algorithm ) OR ( using computer clustering algorithm ))

Refine Results
  1. 1

    A web-based implementation of k-means algorithms by Lee, Quan

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

    Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

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

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

    Scalable approach for mining association rules from structured XML data by Abazeed, Ashraf Riad, Mamat, Ali, Sulaiman, Md. Nasir, Ibrahim, Hamidah

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

    Mining association rules from structured XML data by Abazeed, Ashraf Riad, Mamat, Ali, Sulaiman, Md. Nasir, Ibrahim, Hamidah

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

    Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim by Che Ibrahim, Mohd Erman Safawie

    Published 2012
    “…The objectives of this project to set-up Beowulf cluster computer to apply the Travelling Salesman Problem in parallel by using Genetic Algorithms and evaluate sequential algorithms and parallel algorithms by Genetic Algorithms. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Towards lowering computational power in IoT systems: Clustering algorithm for high-dimensional data stream using entropy window reduction by Alkawsi G., Al-amri R., Baashar Y., Ghorashi S., Alabdulkreem E., Kiong Tiong S.

    Published 2024
    “…The findings of the experiments are compared to the outcomes of BOCEDS, CEDAS, and MuDi-Stream algorithms. The outcomes indicate that the EWR algorithm outperformed the baseline clustering algorithms. …”
    Article
  8. 8
  9. 9
  10. 10

    Autonomous and deterministic supervised fuzzy clustering by Lim, K.M., Loo, C.K., Lim, W.S.

    Published 2010
    “…The results obtained show that the model that uses the global k-means clustering algorithm 1 has higher accuracy when compared to a model that uses the k-means clustering algorithm. …”
    Get full text
    Get full text
    Article
  11. 11

    An adaptive density-based method for clustering evolving data streams / Amineh Amini by Amini, Amineh

    Published 2014
    “…However, existing density-based data stream clustering algorithms are not without problems. The first problem refers to the high computation time required for the clustering process. …”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13
  14. 14

    Biological-based semi-supervised clustering algorithm to improve gene function prediction by Kasim, Shahreen, Deris, Safaai, M. Othman, Razib, Hashim, Rathiah

    Published 2011
    “…However, commonclustering algorithms do not provide a comprehensive approach that look into the three categories of annotations; biologicalprocess, molecular function, and cellular component, and were not tested with different functional annotation database formats.Furthermore, the traditional clustering algorithms use random initialization which causes inconsistent cluster generation and areunable to determine the number of clusters involved. …”
    Get full text
    Get full text
    Article
  15. 15
  16. 16
  17. 17
  18. 18

    Efficient genetic partitioning-around-medoid algorithm for clustering by Garib, Sarmad Makki Mohammed

    Published 2019
    “…These algorithms mostly built upon the partitioning k-means clustering algorithm. …”
    Get full text
    Get full text
    Thesis
  19. 19
  20. 20