Search Results - (( based evaluation means algorithm ) OR ( y generation based algorithm ))*

Refine Results
  1. 1

    Analysis of toothbrush rig parameter estimation using different model orders in Real-Coded Genetic Algorithm (RCGA) by Ainul, H. M. Y., Salleh, S. M., Halib, N., Taib, H., Fathi, M. S.

    Published 2018
    “…The statistical analysis was used to evaluate the performance of the model based on the objective function which is the Mean Square Error (MSE). …”
    Get full text
    Article
  2. 2

    Analysis of Toothbrush Rig Parameter Estimation Using Different Model Orders in Real Coded Genetic Algorithm (RCGA) by Ainul, H. M. Y., Salleh, S. M., Halib, N., Taib, H., Fathi, M. S.

    Published 2024
    “…The statisti-cal analysis was used to evaluate the performance of the model based on the objective function which is the Mean Square Error (MSE). …”
    Article
  3. 3

    Quaternion-based dynamic algorithm for random generation of solid 4D cylindrical curves in RVE modeling by Hamat, Sanusi, Ishak, Mohamad Ridzwan, Kelly, Piaras, Salit, Mohd Sapuan, Yidris, Noorfaizal, Ali, Syamir Alihan Showkat, Hussin, Mohd Sabri, Mohd Dawi, Mohd Syedi Imran

    Published 2025
    “…A quaternion‐based dynamic algorithm is developed to populate Representative Volume Elements (RVEs) with solid 4D cylindrical fibers, combining spatial centerline coordinates (x,y,z) and quaternion‐encoded orientation. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4
  5. 5

    Correlation-based subset evaluation of feature selection for dynamic Malaysian sign language by Sutarman, .

    Published 2016
    “…Pre-processing in this study was based on tracking the joints on a skeleton feature for generating 3D coordinates X, Y, Z. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Zero distortion-based steganography for handwritten signature by Iranmanesh, Vahab

    Published 2018
    “…Thus, the generated stego signature (s) is used to make stego key (k) based on the zero-distortion approach to represent the secret message (m) in a binary format. …”
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

    Improving the synthetic coefficient of variation chart by incorporating side sensitivity by Lee, PingYin

    Published 2024
    “…Based on the results obtained which had been validated using simulations, the proposed side-sensitive synthetic-y chart outperformed the Shewhart-y chart, the EWMA-y2 chart and the existing synthetic-y chart without the side sensitivity feature for most cases and displayed a significant improvement. …”
    Get full text
    Get full text
    Thesis
  8. 8

    An enhanced opposition-based firefly algorithm for solving complex optimization problems by Ling, Ai Wong, Hussain Shareef, Azah Mohamed, Ahmad Asrul Ibrahim

    Published 2014
    “…Firefl y algorithm is one of the heuristic optimization algorithms which mainly based on the light intensity and the attractiveness of fi refl y. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

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

    Published 2019
    “…Adopting the medoid instead of the mean can enhance the efficiency. However, the complexity of the kmedoid based algorithms in general is more than the complexity of the k-means based algorithms. …”
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20

    An observation of different clustering algorithms and clustering evaluation criteria for a feature selection based on linear discriminant analysis by Tie, K. H., A., Senawi, Chuan, Z. L.

    Published 2022
    “…The objective of this paper is to investigate how the parameters behave with a measurement criterion for feature selection, that is, the total error reduction ratio (TERR). The k-means and the Gaussian mixture distribution were adopted as the clustering algorithms and each algorithm was tested on four datasets with four distinct clustering evaluation criteria: Calinski-Harabasz, Davies-Bouldin, Gap and Silhouette. …”
    Get full text
    Get full text
    Get full text
    Book Chapter