Search Results - (( problem implementation clustering algorithm ) OR ( parameter optimisation based algorithm ))

Refine Results
  1. 1

    Optimization Of Pid Controller Using Grey Wolf Optimzer And Dragonfly Algorithm by Nik Mohamed Hazli, Nik Muhammad Aiman

    Published 2018
    “…Optimisation is difficult to optimise as there are three parameters that need to be tuned, Kp, Integral parameter, Ki, and derivative parameter, Kd. …”
    Get full text
    Get full text
    Monograph
  2. 2

    Improved TLBO-JAYA Algorithm for Subset Feature Selection and Parameter Optimisation in Intrusion Detection System by Aljanabi, Mohammad, Mohd Arfian, Ismail, Mezhuyev, Vitaliy

    Published 2020
    “…Many optimisation-based intrusion detection algorithms have been developed and are widely used for intrusion identification. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    Mixed-variable ant colony optimisation algorithm for feature subset selection and tuning support vector machine parameter by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

    Published 2017
    “…This paper presents a hybrid classification algorithm, ACOMV-SVM which is based on ant colony and support vector machine.A new direction for ant colony optimisation is to optimise mixed (discrete and continuous) variables.The optimised variables are then feed into selecting feature subset and tuning its parameters are two main problems of SVM.Most approaches related to tuning support vector machine parameters will discretise the continuous value of the parameters which will give a negative effect on the performance. …”
    Get full text
    Get full text
    Article
  4. 4
  5. 5

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

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

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

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

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

    Single-Solution Simulated Kalman Filter Algorithm for Global Optimisation Problems by Nor Hidayati, Abdul Aziz, Zuwairie, Ibrahim, Nor Azlina, Ab. Aziz, Mohd Saberi, Mohamad, Watada, Junzo

    Published 2016
    “…In comparison, the proposed ssSKF algorithm supersedes the original population-based Simulated Kalman Filter (SKF) algorithm by operating with only a single agent, and having less parameters to be tuned. …”
    Get full text
    Get full text
    Article
  11. 11

    Single-solution Simulated Kalman Filter algorithm for global optimisation problems by Abdul Aziz, N.H., Ibrahim, Z., Ab Aziz, N.A., Mohamad, M.S., Watada, J.

    Published 2018
    “…In comparison, the proposed ssSKF algorithm supersedes the original population-based Simulated Kalman Filter (SKF) algorithm by operating with only a single agent, and having less parameters to be tuned. …”
    Get full text
    Get full text
    Article
  12. 12

    Single-solution Simulated Kalman Filter algorithm for global optimisation problems by Abdul Aziz, N.H., Ibrahim, Z., Ab Aziz, N.A., Mohamad, M.S., Watada, J.

    Published 2018
    “…In comparison, the proposed ssSKF algorithm supersedes the original population-based Simulated Kalman Filter (SKF) algorithm by operating with only a single agent, and having less parameters to be tuned. …”
    Get full text
    Get full text
    Article
  13. 13

    Sustainable Management Of River Water Quality Using Artificial Intelligence Optimisation Algorithms by Chia, See Leng

    Published 2021
    “…Least Square Support Vector Machine (LSSVM) base models with linear kernel, polynomial kernel and Radial Basis Function (RBF) kernel and its hybrid models with integration of Hybrid of Particle Swarm Optimisation and Genetic Algorithm (HPSOGA), Whale Optimisation Algorithm based on Self-adapting Parameter Adjustment and Mix Mutation Strategy (SMWOA) and Ameliorative Moth Flame Optimisation (AMFO) were developed and used to predict the WQI at stations 1K06, 1K07 and 1K08 of the Klang River in Selangor, Malaysia. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  14. 14

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

    Aco-based feature selection algorithm for classification by Al-mazini, Hassan Fouad Abbas

    Published 2022
    “…The modified graph clustering ant colony optimisation (MGCACO) algorithm is an effective FS method that was developed based on grouping the highly correlated features. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    Augmented model based double iterative loop techniques for integrated system optimisation and parameter estimation of large scale industrial processes by Normah Abdullah, Brdys, M.A., Roberts, P.D.

    Published 1993
    “…The double iterative loop structures of the proposed algorithms use the real process measurement within the outer loops while the inner loops involve model based computation only. …”
    Get full text
    Get full text
    Article
  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

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

    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