Search Results - (( parametric classification based algorithm ) OR ( initial solution methods algorithm ))

Refine Results
  1. 1

    Balancing Exploitation And Exploration Search Behavior On Nature-Inspired Clustering Algorithms by Alswaitti, Mohammed Y. T.

    Published 2018
    “…In the OGC framework, the exhibited explorative search behavior of the Gravitational Clustering (GC) algorithm has been addressed by (i) eliminating the agent velocity accumulation, and (ii) integrating an initialization method of agents using variance and median to subrogate the exploration process. …”
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

    Improvement of land cover mapping using Sentinel 2 and Landsat 8 imageries via non-parametric classification by Myaser, Jwan

    Published 2020
    “…The second stage involved assessing the spatial resolution effect through utilizing Landsat 8 (30 m) and Sentinel (10 m) data on LCM accuracy using SVM, K-Nearest Neighbor (K-NN), Random Forest (RF), and Neural Network (NN) algorithms. Based on the concluding overall analysis, the classification accuracy derived from Sentinel 2 imagery utilizing SVM and RF, Landsat 8 applying SVM donated higher than other methods of classification. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Nearest neighbour group-based classification by Samsudin, Noor A., Bradley, Andrew P.

    Published 2010
    “…In this paper, we extend three variants of the nearest neighbour algorithm to develop a number of non-parametric group-based classification techniques. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    Validation on an enhanced dendrite cell algorithm using statistical analysis by Mohamad Mohsin, Mohamad Farhan, Hamdan, Abdul Razak, Abu Bakar, Azuraliza, Abd Wahab, Mohd Helmy

    Published 2017
    “…In this study, we evaluated the performance of the enhanced algorithm called dendrite cell algorithm using sensitivity, specificity, false positive rate, and accuracy and validated the result using parametric and non parametric statistical significant tests. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Clustering ensemble learning method based on incremental genetic algorithms by Ghaemi, Reza

    Published 2012
    “…In addition, experiments prove that incremental genetic-based clustering ensemble algorithm speed up to converge into an optimal clustering solution, where pattern ensemble learning method and the cluster partitions produced by the threshold fuzzy c-means clustering algorithm are employed as recombination operator and initial population, respectively.…”
    Get full text
    Get full text
    Thesis
  7. 7

    Multistage optimal homotopy asymptotic method for solving initial-value problems by Anakira, N. R., Alomari, A. K., Jameela, Ali, Hashim, Ishak

    Published 2016
    “…In this paper, a new approximate analytical algorithm namely multistage optimal homotopy asymptotic method (MOHAM) is presented for the first time to obtain approximate analytical solutions for linear, nonlinear and system of initial value problems (IVPs).This algorithm depends on the standard optimal homotopy asymptotic method (OHAM), in which it is treated as an algorithm in a sequence of subinterval. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8
  9. 9

    Combining approximation algorithm with genetic algorithm at the initial population for NP-complete problem by Razip, H., Zakaria, M.N.

    Published 2018
    “…In Genetic Algorithm (GA), the prevalent approach to population initialization are heuristics and randomization. …”
    Get full text
    Get full text
    Article
  10. 10

    Initialization Methods For Conventional Fuzzy C-Means And Its Application Towards Colour Image Segmentation by Tan , Khang Siang

    Published 2011
    “…Due to its capability in providing a particularly promising solution to clustering problems, the conventional Fuzzy C-Mean (FCM) algorithm is widely used as a segmentation method. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Comparison between Newton’s Method and a new Scaling Newton Method / Ramizah Baharuddin by Baharuddin, Ramizah

    Published 2021
    “…Newton's Method also called the Newton-Raphson method is a recursive algorithm for approximating the root of a differentiable function. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Shooting method with root finding to solve boundary value problems / Aryani Rima Matakim by Matakim, Aryani Rima

    Published 2025
    “…This method involves guessing initial conditions and iteratively adjusting them until the solution satisfies the boundary conditions at the other end of the domain. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Enhancing the RC4 algorithm by eliminating the Initiative Vector (IV) transmission by Waleed Abdelrahman Yousif Mohammed, Salmah Fattah, Khalid Mohammed Osman Saeed, Ashraf Osman Ibrahim Elsayed, Safaa Eltahier

    Published 2025
    “…This paper introduces an innovative approach to address the vulnerabilities of the RC4 encryption algorithm by employing an Initiative Vector (IV). The proposed method incorporates a lengthy random text without transmitting an initialization vector. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14
  15. 15

    Hybrid tabu search – strawberry algorithm for multidimensional knapsack problem by Wong, Jerng Foong

    Published 2022
    “…The Greedy heuristics by ratio was employed to construct an initial solution. Next, the solution was enhanced by using the hybrid TS-SBA. …”
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17
  18. 18

    Flexible job shop scheduling using priority heuristics and genetic algorithm by Farashahi, Hamid Ghaani

    Published 2010
    “…Then, the validation of proposed genetic algorithm with reinforced initial population (GA2) has been checked with random keys genetic algorithm (RKGA). …”
    Get full text
    Get full text
    Thesis
  19. 19
  20. 20

    Direct solutions of N-th order initial value problems in decomposition series by Yahaya F., Hashim I., Ismail E.S., Zulkifle A.K.

    Published 2023
    “…In this paper, a class of linear and non-linear nth-order initial value problems (IVPs) is considered. The solutions of these IVPs are obtained by adapting the modified Adomian decomposition method (MADM) as an algorithm for approximating the solutions of the equations in a sequence of time intervals (i.e. time steps). …”
    Article