Search Results - (( java implementation path algorithm ) OR ( using case clustering algorithm ))

Refine Results
  1. 1

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
  2. 2

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

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

    Published 2021
    “…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Cluster detection for spatio-temporal dengue cases at Selangor districts using multi-EigenSpot algorithm by Nor, N.H.M., Daud, H., Ullah, S.

    Published 2022
    “…This study aims to detect the spatio-temporal clustering or hotspot regions of dengue cases for the districts of Selangor, Malaysia using a nonparametric algorithm (Multi-EigenSpot) to detect dengue clusters. …”
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    Published 2009
    “…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Detection of the spread of Covid-19 in Indonesia using K-Means Clustering Algorithm / Mohammad Yazdi Pusadan ... [et al.] by Pusadan, Mohammad Yazdi, Rabbani, Mohammad Abied, Ardiansyah, Rizka, Ngemba, Hajra Rasmita

    Published 2023
    “…The implementation of the K-Means Clustering algorithm for detecting the level of spread of COVID-19 data in Indonesia by using the parameter k=3 is quite good with areas in Indonesia that have a high the spread of COVID-19 and the results of the cluster validity test get silhouette values on O = (Total Case, Total Death) and P = (Total Case, Total Death, Total Recovered) have the same cluster value, which is 0.93 which means the cluster quality is very good.…”
    Get full text
    Get full text
    Book Section
  7. 7

    Enhanced Clustering Algorithms For Gray-Scale Image Segmentation by Siddiqui, Fasahat Ullah

    Published 2012
    “…The clustering algorithms are widely used as an unsupervised method for image segmentation in medical diagnosis, satellite imaging and biometric systems. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Optimized clustering with modified K-means algorithm by Alibuhtto, Mohamed Cassim

    Published 2021
    “…Among the techniques, the k-means algorithm is the most commonly used technique for determining optimal number of clusters (k). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10

    Density based subspace clustering: a case study on perception of the required skill by Rahmat Widia, Sembiring

    Published 2014
    “…Each dimension will be tested to investigate whether having a relationship with the data on another cluster, using proposed subspace clustering algorithms. …”
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12

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

    Published 2014
    “…This study proposes a density-based algorithm for clustering evolving data streams. The proposed method, which is called MuDi-Stream (Multi Density clustering algorithm for evolving data Stream), is an online-offline algorithm with four main components. …”
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14

    Clustering Spatial Data Using a Kernel-Based Algorithm by Awan, A. Majid, Md. Sap, Mohd. Noor

    Published 2005
    “…Finally, we present a robust weighted kernel k-means algorithm incorporating spatial constraints for clustering spatial data as a case study. …”
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15

    Density subspace clustering: a case study on perception of the required skill by Sembiring, Rahmat Widia

    Published 2014
    “…Each dimension will be tested to investigate whether having a relationship with the data on another cluster, using proposed subspace clustering algorithms. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Spatial Clustering Algorithm for Time Series Rainfall Data Using X-Means Data Splitting by Ali, Noor Rasidah, Ku Mahamud, Ku Ruhana

    Published 2017
    “…The performance of the clustering algorithm gets even worse if it relies on actual data and many clustering algorithms are often faced with conflict in handling high dimensional data. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    The implementation of z-numbers in fuzzy clustering algorithm for wellness of chronic kidney disease patients by N. J., Mohd Jamal, Ku Muhammad Naim, Ku Khalif, Mohd Sham, Mohamad

    Published 2019
    “…Thus, there are two objectives of this paper; (i) to propose a reliable fuzzy clustering algorithm using z-numbers and; (ii) to cluster the Chronic Kidney Disease (CKD) patients based on the selected indicators to identify which cluster the patients belongs to (Cluster 0, Cluster 1, Cluster 2, Cluster 3 or Cluster 4) based on the membership functions defined. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    Web-based clustering tool using fuzzy k-mean algorithm / Ahmad Zuladzlan Zulkifly by Zulkifly, Ahmad Zuladzlan

    Published 2019
    “…This project will use fuzzy k-means clustering algorithm to cluster the data because it is easy to implement and have many advantages. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Clustering network traffic utilization by Mohd Khairudin, Nazli, Muda, Zaiton, Mustapha, Aida, Nagarathinam, Yogeswaran, Salleh, Mohd. Sidek

    Published 2013
    “…The clustering experiments were conducted using three different clustering algorithms, which are K-Means, DBScan and AutoClass. …”
    Get full text
    Get full text
    Article
  20. 20

    Partitional clustering algorithms for highly similar and sparseness y-short tandem repeat data / Ali Seman by Seman, Ali

    Published 2013
    “…Six Y-STR data sets were used as a benchmark to evaluate the performances of the algorithm against the other eight partitional clustering algorithms. …”
    Get full text
    Get full text
    Thesis