Search Results - (( java implementation path algorithm ) OR ( using random 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

    Comparison of expectation maximization and K-means clustering algorithms with ensemble classifier model by Sulaiman, Md. Nasir, Mohamed, Raihani, Mustapha, Norwati, Zainudin, Muhammad Noorazlan Shah

    Published 2018
    “…EM and K-means clustering algorithms are used to cluster the multi-class classification attribute according to its relevance criteria and afterward, the clustered attributes are classified using an ensemble random forest classifier model. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

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

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

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

    Balancing exploration and exploitation in ACS algorithms for data clustering by Jabbar, Ayad Mohammed, Sagban, Rafid, Ku-Mahamud, Ku Ruhana

    Published 2019
    “…The performance of the proposed algorithm is compared with that of several common clustering algorithms using real-world datasets. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Determining the preprocessing clustering algorithm in radial basis function neural network by S.L. Ang, H.C. Ong, H.C. Law

    Published 2008
    “…Three types of method used in this study to find the centres include random selections, K-means clustering algorithm and also K-median clustering algorithm. …”
    Get full text
    Get full text
    Article
  11. 11
  12. 12
  13. 13

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

    Identifying clusters structure of rare events using random forest clustering by Zaturrawiah A Omar, Chin, Su Na, Siti Rahayu Mohd. Hashim, Norhafiza Hamzah

    Published 2021
    “…To identify the intrinsic structures in the minority class (the stroke group), Random Forest Clustering was used to produce the proximity matrix and fed to Partition around Medoid (PAM) clustering method to identify the optimal number of clusters. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceedings
  15. 15

    Reducing false alarm using hybrid Intrusion Detection based on X-Means clustering and Random Forest classification by Juma, Sundus, Muda, Zaiton, Yassin, Warusia

    Published 2014
    “…X-Means clustering is utilized to gather whole data into congruent cluster based on their behaviour whereas Random Forest classifier is utilized to rearrange the misclassified clustered data to apropos group. …”
    Get full text
    Get full text
    Article
  16. 16

    Local-based stereo matching algorithm using multi-cost pyramid fusion, hybrid random aggregation and hierarchical cluster-edge refinement by Kadmin, Ahmad Fauzan

    Published 2023
    “…In this thesis, the accuracy of the proposed algorithm was evaluated using two standard online benchmarking database systems. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    A Hybrid K-Means Hierarchical Algorithm for Natural Disaster Mitigation Clustering by Prasetyadi, Abdurrakhman, Nugroho, Budi, Tohari, Adrin

    Published 2022
    “…Nevertheless, it is difficult to obtain a homogeneous clustering result of the k-means method because this method is sensitive to a random selection of the centers of the cluster. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    An energy based cluster head selection unequal clustering algorithm with dual sink (ECH-DUAL) for continuous monitoring applications in wireless sensor networks by Alagirisamy, Mukil, Chow, Chee Onn

    Published 2018
    “…In this work, an energy based cluster head selection unequal clustering algorithm (ECH-DUAL) using dual (static and mobile) sink is proposed. …”
    Get full text
    Get full text
    Article
  19. 19

    Exploring clusters of rare events using unsupervised random forests by Z A Omar, Chin, Su Na, Siti Rahayu Mohd. Hashim, N Hamzah

    Published 2022
    “…To identify the intrinsic structures in the minority class (the stroke group), Random Forest Clustering was used to produce the proximity matrix and fed to Partition around Medoid (PAM) clustering method to identify the optimal number of clusters. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20

    A novel clustering based genetic algorithm for route optimization by Aibinu, Abiodun Musa, Salau, Habeeb Bello, Najeeb, Athaur Rahman, Nwohu, Mark Ndubuka, Akachukwu, Chichebe

    Published 2016
    “…It was also observed that the introduction of clustering based selection algorithm guaranteed the selection of cluster with the optimal solution in every generation. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article