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

  • Showing 1 - 17 results of 17
Refine Results
  1. 1

    An improved self organizing map using jaccard new measure for textual bugs data clustering by Ahmed, Attika

    Published 2018
    “…One of the commonly used algorithm for bug clustering is K-means, which is considered a simplest unsupervised learning algorithm for clustering, yet it tends to produce smaller number of cluster. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    An improved self organizing map using jaccard new measure for textual bugs data clustering by Ahmed, Attika

    Published 2018
    “…One of the commonly used algorithm for bug clustering is K-means, which is considered a simplest unsupervised learning algorithm for clustering, yet it tends to produce smaller number of cluster. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3

    An improved plant identification system by Fuzzy c-means bag of visual words model and sparse coding by Safa, Soodabeh, Khalid, Fatimah

    Published 2020
    “…Classic bag of visual words algorithm is based on k-means clustering and every SIFT features belongs to one cluster and it leads to decreasing classification results. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

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

    Published 2013
    “…In some cases, they are quite distant and sparseness. This uniqueness of Y-STR data has become problematic in partitioning the data using the existing partitional clustering algorithms. …”
    Get full text
    Get full text
    Thesis
  5. 5

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

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

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

    Taylor-Bird Swarm Optimization-Based Deep Belief Network For Medical Data Classification by Mohammed, Alhassan Afnan

    Published 2022
    “…Then, the feature selection process is performed using sparse fuzzy-c-means (FCM) for selecting significant features to classify medical data. …”
    Get full text
    Get full text
    Thesis
  9. 9

    An intelligent categorization tool for malay research articles by Mohd Norhisham Razali, Rayner Alfred, Chin, Kim On

    Published 2015
    “…Hence, by increasing the mapping percentage for the bilingual clusters, a more robust clustering algorithm can be developed for clustering bilingual documents. …”
    Get full text
    Get full text
    Research Report
  10. 10

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

    Plant identification using combination of fuzzy c-means spatial pyramid matching, gist, multi-texton histogram and multiview dictionary learning by Safa, Soodabeh

    Published 2016
    “…Beside that, classic bag of visual words algorithm (BoVW) is based on kmeans clustering and every SIFT feature belongs to one cluster and it leads to decreasing classification results. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Research on the construction of an efficient and lightweight online detection method for tiny surface defects through model compression and knowledge distillation by Chen, Qipeng, Xiong, Qiaoqiao, Huang, Haisong, Tang, Saihong, Liu, Zhenghong

    Published 2024
    “…Channel pruning and layer pruning are applied to the sparse model, and post-processing methods using knowledge distillation are used to effectively reduce the model size and forward inference time while maintaining model accuracy. …”
    Get full text
    Get full text
    Article
  14. 14

    Communication and computational cost on parallel algorithm of PDE elliptic type by Alias, Norma

    Published 2009
    “…The parallel algorithms of 2-dimensional Partial Differential Equation (PDE) elliptic type for the prediction will be executed using distributed memory of heterogeneous cluster platform on LINUX-based environment. …”
    Get full text
    Get full text
    Book Section
  15. 15

    Clustering Based Affinity Propagation In Vanets : Taxonomy And Opportunity Of Research by Talib, Mohammed Saad, Hassan, Aslinda, Abal Abas, Zuraida, Hassan, Ali Abdul Hussian, Ali, Mohanad Faeq, Al-Araji, Zaid Jasim

    Published 2019
    “…The great challenging task in routing the messages in VANETs is related to the different velocities of the moving vehicles on the streets in addition to their sparse distribution. Clustering approach is broadly used to report this challenge. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Backhaul load and performance optimality of partial joint processing schemes in LTE-A networks by Kousha, Mohammad

    Published 2014
    “…All these achieved because the proposed algorithm targets those users located at the cluster borders who more likely cause rank deficiency. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

    Published 2019
    “…Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
    Get full text
    Get full text
    Thesis