Search Results - (( its implementation clustering algorithm ) OR ( problem implementation developing 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

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

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

    Published 2009
    “…In order to develop a new algorithm for the course scheduling problem, this research follows the experimental research methodology that consist of problem analysis, designing algorithm, implementing algorithm as a computer program in order to examine the results, analyzing the results, and if necessary improving the algorithm by doing all those activities over and over again. …”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

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

    Published 2014
    “…A simulator for desktop grid environment has been developed using Java as the implementation language due to its wide popularity. …”
    Get full text
    Get full text
    Final Year Project
  5. 5

    An ensemble of neural network and modified grey wolf optimizer for stock prediction by Das, Debashish

    Published 2019
    “…Grey Wolf Optimizer (GWO) is a recently developed meta-heuristic algorithm which is appealing to researcher owing to its demonstrated performance as cited in the scientific literature. …”
    Get full text
    Get full text
    Thesis
  6. 6

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

    Data transmission in wireless sensor network with greedy function and particle swarm optimization by Hamzarul Alif Hamzah, Norah Tuah, Kit Guan Lim, Min Keng Tan, Lei Zhu, Kenneth Tze Kin Teo

    Published 2019
    “…As distances affect greatly on the energy consumption, Particle Swarm Optimization (PSO) is developed to replace greedy algorithm in PEGASIS to reduce the distances of data transmission. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceedings
  8. 8

    Two-stage Heuristic for Primary School Timetabling Problem with Combined Classes Consideration by Sze, San Nah, Tan, See Yan, Chiew, Kang Leng, Tiong, Wei King

    Published 2020
    “…Most of the primary school timetables are manually developed, which is extremely time-consuming. According to the new policy announced on 12th Dec 2017by the Ministry of Education (MoE) Malaysia, due to the shortage of teachers, combined-classes should be implemented in lowenrolment schools with fewer than 30 students. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    A soft hierarchical algorithm for the clustering of multiple bioactive chemical compounds by Salim, Naomie, Shah, J. Z.

    Published 2007
    “…The algorithm divides each and every cluster, if its size is larger than a pre-determined threshold, into two sub clusters based on the membership values of each structure. …”
    Get full text
    Get full text
    Get full text
    Book Section
  10. 10

    The implementation of z-numbers in fuzzy clustering algorithm for wellness of chronic kidney disease patients by N. J., Mohd Jamal, Ku Muhammad Naim, Ku Khalif, Mohd Sham, Mohamad

    Published 2019
    “…Thus, there are two objectives of this paper; (i) to propose a reliable fuzzy clustering algorithm using z-numbers and; (ii) to cluster the Chronic Kidney Disease (CKD) patients based on the selected indicators to identify which cluster the patients belongs to (Cluster 0, Cluster 1, Cluster 2, Cluster 3 or Cluster 4) based on the membership functions defined. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Image segmentation based on normalised cuts with clustering algorithm by Choong, Mei Yeen

    Published 2013
    “…As the clusters initialisation gives influence to the segmentation result, optimisation of the clustering algorithm is implemented to achieve a better segmentation. …”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    Parallelization of noise reduction algorithm for seismic data on a beowulf cluster by Aziz, I. A., Sandran, T., Haron, N. S., Hasan, M. H, Mehat, M.

    Published 2010
    “…The proposed algorithm has been implemented on an experimental Beowulf cluster which consists of 12 nodes operating on Linux Ubuntu platform. …”
    Get full text
    Get full text
    Citation Index Journal
  13. 13

    MGR: An Information Theory Based Hierarchical Divisive Clustering Algorithm for Categorical Data by Hongwu, Qin, Ma, Xiuqin, Herawan, Tutut, Jasni, Mohamad Zain

    Published 2014
    “…This research proposes mean gain ratio (MGR), a new information theory based hierarchical divisive clustering algorithm for categorical data. MGR implements clustering from the attributes viewpoint which includes selecting a clustering attribute using mean gain ratio and selecting an equivalence class on the clustering attribute using entropy of clusters. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    A Comparative Study Of Fuzzy C-Means And K-Means Clustering Techniques by Sharifah Sakinah, Syed Ahmad

    Published 2014
    “…First we present an overview of both methods with emphasis on the implementation of the algorithm. Then, we apply six datasets to measure the quality of clustering result based on the similarity measure used in the algorithm and its representation of clustering result. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15

    An improved machine learning model of massive Floating Car Data (FCD) based on Fuzzy-MDL and LSTM-C for traffic speed estimation and prediction by Ahanin, Fatemeh

    Published 2023
    “…In today’s world, traffic congestion is a major problem in almost all metropolitans. There has been much previous research developing new methods to improve accuracy of Traffic State Prediction (TSP) which are designed according to its advantage for static sensors such as video cameras, inductive loop detectors and other static sensors. …”
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

    An Efficient Clustering Technique for Mobile Wireless Sensor Networks by Azman, Nurul Syafiqah

    Published 2014
    “…LEACH clustering algorithm will be implemented on random mobility network. …”
    Get full text
    Get full text
    Final Year Project
  17. 17

    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
    “…However, similar to other clustering algorithms, this algorithm requires sufficient data for its unsupervised learning process. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18
  19. 19
  20. 20

    The Parallel Fuzzy C-Median Clustering Algorithm Using Spark for the Big Data by Mallik, Moksud Alam, Zulkurnain, Nurul Fariza, Siddiqui, Sumrana, Sarkar, Rashel

    Published 2024
    “…The experimental results show that c=5, which is consistent for cost function with the ideal silhouette coefficient of 1, is the optimal number of clusters for this dataset. A comparative study is done to validate the proposed algorithm by implementing the other contemporary algorithms for the same dataset. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article