Search Results - (( using function methods algorithm ) OR ( problem implementation clustering algorithm ))

Refine Results
  1. 1

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

    Published 2019
    “…Throughout the years, considerable efforts made to tackle the clustering problem. Yet, because of the nature of the clustering problem, finding an efficient clustering optimization algorithm with reasonable performance is still an open challenge. …”
    Get full text
    Get full text
    Thesis
  2. 2

    A new variant of black hole algorithm based on multi population and levy flight for clustering problem by Haneen Abdul Wahab, Abdul Raheem

    Published 2020
    “…Meta-heuristic algorithm has been successfully implemented on data clustering problems seeking a near optimal solution in terms of quality of the resultant clusters. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Image clustering comparison of two color segmentation techniques by Subramaniam, Kavitha Pichaiyan

    Published 2010
    “…There are many algorithm for analysing clustering each having its own method to do clustering. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    Hybrid metaheuristic method for clustering in wireless sensor networks / Bryan Raj Peter Jabaraj by Bryan Raj , Peter Jabaraj

    Published 2023
    “…As such, this thesis proposes a hybrid metaheuristic method that consists of Sperm Swarm Optimization (SSO) algorithm and Genetic Algorithm (GA), which is termed HSSOGA. …”
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

    Published 2009
    “…As the requirement of the Ant System Algorithm, the problem is modeled as a graph that can be used by the ant to deliver its pheromone. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    A new hybrid deep neural networks (DNN) algorithm for Lorenz chaotic system parameter estimation in image encryption by Nurnajmin Qasrina Ann, Ayop Azmi

    Published 2023
    “…The fitness function used is the correlation function in the SKF algorithm to optimize the cipher image produced using the Lorenz system. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Intelligent transmission line fault diagnosis using the Apriori associated rule algorithm under cloud computing environment by Al-Jumaili A.H.A., Muniyandi R.C., Hasan M.K., Singh M.J., Paw J.K.S.

    Published 2024
    “…Hadoop distributed architecture is used to design and implement the power private cloud computing cluster. …”
    Article
  8. 8

    Development of compound clustering techniques using hybrid soft-computing algorithms by Salim, Naomie, Shamsuddin, Siti Mariyam, Salleh @ Sallehuddin, Roselina, Alwee, Razana

    Published 2006
    “…The hierarchical fuzzy clustering method developed here is far better than a similar implementation of the hard k-means method. …”
    Get full text
    Get full text
    Monograph
  9. 9
  10. 10

    Survey on Clustered Routing Protocols Adaptivity for Fire Incidents: Architecture Challenges, Data Losing, and Recommended Solutions by Abbas O.K., Abdullah F., Radzi N.A.M., Salman A.D., Abdulkadir S.J.

    Published 2025
    “…Many clustered routing algorithms have been developed to address various issues like energy efficiency, network lifetime, and hotspot problems. …”
    Article
  11. 11

    Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling by Anuar, Nurul Izah

    Published 2022
    “…Besides, since PSO operates in the continuous domain, it cannot be applied directly to solve a discrete problem like the JSP efficiently. This research first proposes an improved continuous MOPSO to address the rapid clustering problem that exists in the basic PSO algorithm using three improvement strategies: re-initialization of particles, systematic switch of best solutions and mutation on global best selection. …”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

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

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

    Published 2012
    “…However, in some cases the conventional clustering algorithms introduce over-segmentation problems and unable to preserve the region of interest (i.e. objects).…”
    Get full text
    Get full text
    Thesis
  14. 14

    An improved pheromone-based kohonen self-organising map in clustering and visualising balanced and imbalanced datasets by Azlin, Ahmad, Rubiyah, Yusof, Nor Saradatul Akmar, Zulkifli, Mohd Najib, Ismail

    Published 2021
    “…The Kohonen Self-Organising Map (KSOM) is one of the well-known clustering algorithms that can solve various problems without a pre-defined number of clusters. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    An Improved Pheromone-Based Kohonen Self- Organising Map in Clustering and Visualising Balanced and Imbalanced Datasets by Ahmad, Azlin, Yusof, Rubiyah, Zulkifli, Nor Saradatul Akma, Ismail, Mohd Najib

    Published 2021
    “…The Kohonen Self-Organising Map (KSOM) is one of the well-known clustering algorithms that can solve various problems without a pre- defined number of clusters. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Solving traveling salesman problem on cluster compute nodes by I.A., Aziz, Haron, N., Mehat, M., Jung, L.T., Mustapa, A.N., Akir, E.A.P.

    Published 2009
    “…In this paper, we present a parallel implementation of a solution for the Traveling Salesman Problem (TSP). …”
    Get full text
    Get full text
    Article
  17. 17

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

    Modeling and Analysis of New Hybrid Clustering Technique for Vehicular Ad Hoc Network by Abdulrazzak H.N., Hock G.C., Mohamed Radzi N.A., Tan N.M.L., Kwong C.F.

    Published 2023
    “…The problems with the K-Means algorithm concern the selection of a suitable number of clusters, the creation of a highly reliable cluster, and achieving high similarity within a cluster. …”
    Article
  19. 19

    Distance based sweep nearest algorithm to solve capacitated vehicle routing problem by Akhand, M. A. H, Sultana, Tanzima, Peya, Zahrul Jannat, Rahman, M.M. Hafizur

    Published 2016
    “…On the other hand, Sweep Nearest (SN) algorithm, an extension of Sweep, also considers smallest polar angle customer to initialize a cluster but inserted other customer based on the nearest neighbor approach. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  20. 20