Search Results - (( using function based 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
    “…In general, genetic based clustering algorithms showed the ability to reach near global optimal solution. …”
    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
    “…The clustering research is regarding the area of data mining and implementation of the clustering algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

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

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

    Published 2023
    “…However, it faced issues such as isolated node problems and energy hole problems because of the inefficiency in Cluster Head (CH) selection. …”
    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

    Cauchy density-based algorithm for VANETs clustering in 3D road environments by Jubair, Mohammed Ahmed, Ahmad, Mohd Riduan, Abdul Aziz, Izzatdin, Al-Obaidi, Ahmed Salih, Al-Tickriti, Abdullah Talaat, Hassan, Mustafa Hamid, Mostafa, Salama A., Mahdin, Hairulnizam

    Published 2022
    “…This paper attempts to solve the problem of VANETs in 3D road environments using a centralized clustering technique to develop a Cauchy density model. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

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

    A Toolkit for Simulation of Desktop Grid Environment by FOROUSHAN, PAYAM CHINI

    Published 2014
    “…Core functionality of the simulator are job generation, volunteer generation, simulating algorithms, generating graphical charts and generating reports. …”
    Get full text
    Get full text
    Final Year Project
  10. 10
  11. 11

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

    An evaluation of Monte Carlo-based hyper-heuristic for interaction testing of industrial embedded software applications. by S. Ahmed, Bestoun, Enoiu, Eduard, Afzal, Wasif, Kamal Z., Zamli

    Published 2020
    “…Hyper-heuristic is a new methodology for the adaptive hybridization of meta-heuristic algorithms to derive a general algorithm for solving optimization problems. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

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

    Published 2006
    “…Previously, there is limited work on the clustering and classification of biologically active compounds into their activity based classes using fuzzy and neural network. …”
    Get full text
    Get full text
    Monograph
  14. 14

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

    Reassembly and clustering bifragmented intertwined jpeg images using genetic algorithm and extreme learning machine by Raad Ali, Rabei

    Published 2019
    “…The RX_myKarve is an extended framework from X_myKarve, which consists of the following key components: (i) an Extreme Learning Machine (ELM) neural network for clusters classification using three existing content-based features extraction (Entropy, Byte Frequency Distribution (BFD) and Rate of Change (RoC)) to improve the identification of JPEG images content and support the reassembling process; (ii) a genetic algorithm with Coherence Euclidean Distance (CED) matric and cost function to reconstruct a JPEG image from a set of deformed and fragmented clusters in the scan area. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

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

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

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

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

    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