Search Results - (( loan application ((new algorithm) OR (_ algorithm)) ) OR ( based optimization means algorithm ))

Refine Results
  1. 1

    Clustering Based on Customers’ Behaviour in Accepting Personal Loan using Unsupervised Machine Learning by Lim, Wai Ping, Goh, Ching Pang

    Published 2023
    “…Focusing on clustering algorithms, the study employs popular methods like K-Means Clustering, Density-Based Spatial Clustering of Applications with Noise (DBSCAN), Agglomerative Hierarchical Clustering, and Mean Shift Clustering to understand customer characteristics and behaviors. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10

    A Requirement Model For Online Web-Based Car Loan Management System For UUM Bursary by Alkhaldi, Ayman Nader Abdellatif

    Published 2008
    “…The staffs have to come personally to the bursary to apply for car loan. And they are facing many difficulties when they intend to fill the application form for car loan. …”
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12

    Optimized clustering with modified K-means algorithm by Alibuhtto, Mohamed Cassim

    Published 2021
    “…Among the techniques, the k-means algorithm is the most commonly used technique for determining optimal number of clusters (k). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14

    Impact of evolutionary algorithm on optimization of nonconventional machining process parameters by B V, Raghavendra, R Annigiri, Anandkumar, Srikatamurthy, JS

    Published 2025
    “…This paper presents the optimization of laser beam machining in additive manufacturing of polymer-based material parameters, specifically focusing on cutting speed, gas pressure of nitrogen, and focal point locations, to achieve optimal mean surface roughness. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Document clustering based on firefly algorithm by Mohammed, Athraa Jasim, Yusof, Yuhanis, Husni, Husniza

    Published 2015
    “…Document clustering is widely used in Information Retrieval however, existing clustering techniques suffer from local optima problem in determining the k number of clusters.Various efforts have been put to address such drawback and this includes the utilization of swarm-based algorithms such as particle swarm optimization and Ant Colony Optimization.This study explores the adaptation of another swarm algorithm which is the Firefly Algorithm (FA) in text clustering.We present two variants of FA; Weight- based Firefly Algorithm (WFA) and Weight-based Firefly Algorithm II (WFAII).The difference between the two algorithms is that the WFAII, includes a more restricted condition in determining members of a cluster.The proposed FA methods are later evaluated using the 20Newsgroups dataset.Experimental results on the quality of clustering between the two FA variants are presented and are later compared against the one produced by particle swarm optimization, K-means and the hybrid of FA and -K-means. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Fuzzy C-Mean And Genetic Algorithms Based Scheduling For Independent Jobs In Computational Grid by Lorpunmanee, Siriluck, Md Sap, Mohd Noor, Abdullah, Abdul Hanan

    Published 2006
    “…Our model presents the method of the jobs classifications based mainly on Fuzzy C-Mean algorithm and mapping the jobs to the appropriate resources based mainly on Genetic algorithm. …”
    Get full text
    Get full text
    Article
  17. 17

    Modified archive update mechanism of multi-objective particle swarm optimization in fuzzy classification and clustering by Rashed, Alwatben Batoul

    Published 2022
    “…Among multi-objective evolutionary algorithms proposed in the literature, particle swarm optimization (PSO)-based multi-objective (MOPSO) algorithm has been cited to be the most representative. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Cluster optimization in VANET using MFO algorithm and K-Means clustering by Ramlee, Sham Rizal, Hasan, Sazlinah, K. Subramaniam, Shamala

    Published 2023
    “…Proven to be an effective and efficient method for solving optimization problem. To design K-Means algorithm that portion nodes based on their proximities by optimize the distance between nodes within same cluster by assigning them to the closet cluster center. …”
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

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