Search Results - (( using mean problem algorithm ) OR ( java application learning algorithm ))

Refine Results
  1. 1

    Web-based clustering tool using fuzzy k-mean algorithm / Ahmad Zuladzlan Zulkifly by Zulkifly, Ahmad Zuladzlan

    Published 2019
    “…On the Construction phase, the development of the prototype has been started. All the algorithm for the engine has been developed by using Java script language. …”
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3
  4. 4

    An Educational Tool Aimed at Learning Metaheuristics by Kader, Md. Abdul, Jamaluddin, Jamal A., Kamal Z., Zamli

    Published 2020
    “…In this paper, we introduce an education tool for learning metaheuristic algorithms that allows displaying the convergence speed of the corresponding metaheuristic upon setting/changing the dependable parameters. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5

    A Feature Ranking Algorithm in Pragmatic Quality Factor Model for Software Quality Assessment by Ruzita, Ahmad

    Published 2013
    “…The methodology used consists of theoretical study, design of formal framework on intelligent software quality, identification of Feature Ranking Technique (FRT), construction and evaluation of FRA algorithm. The assessment of quality attributes has been improved using FRA algorithm enriched with a formula to calculate the priority of attributes and followed by learning adaptation through Java Library for Multi Label Learning (MULAN) application. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Statistical data preprocessing methods in distance functions to enhance k-means clustering algorithm by Dalatu, Paul Inuwa

    Published 2018
    “…It is attained successfully by combining the mean in K-Means algorithm, minimum and maximum in K-Midranges algorithm and compute their average as mean cluster of Hybrid mean. …”
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

    Improved clustering using robust and classical principal component by Hassn, Ahmed Kadom

    Published 2017
    “…To remedy this problem, we propose to integrate Principal Component analysis (PCA) which is useful for dimensionality reduction of a dataset with the k-means clustering algorithm. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim by Hashim, Siti Zuraifah

    Published 2007
    “…It makes use of three basic operations in order to optimize this problem. …”
    Get full text
    Get full text
    Thesis
  9. 9

    An improvement of stochastic gradient descent approach for mean-variance portfolio optimization problem by S. W. Su, Stephanie, Kek, Sie Long

    Published 2021
    “…Furthermore, the applicability of SGD, Adam, AdaMax, Nadam, AMSGrad, and AdamSE algorithms in solving the mean-variance portfolio optimization problem is validated.…”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Adoption of machine learning algorithm for analysing supporters and non supporters feedback on political posts / Ogunfolajin Maruff Tunde by Ogunfolajin Maruff , Tunde

    Published 2022
    “…This thesis is based on the application of sentiment classification algorithm to tweet data with the goal of classifying messages based on the polarity of sentiment towards a particular topic (or subject matter). …”
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11

    Improved stochastic gradient descent algorithm with mean-gradient adaptive stepsize for solving large-scale optimization problems by Zulkifli, Munierah, Abd Rahmin, Nor Aliza, Wah, June Leong

    Published 2023
    “…Stochastic gradient descent (SGD) is one of the most common algorithms used in solving large unconstrained optimization problems. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

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

    Published 2019
    “…These algorithms mostly built upon the partitioning k-means clustering algorithm. …”
    Get full text
    Get full text
    Thesis
  13. 13

    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
    “…To address these problems, a novel method combining a covering rough set and a K-Means clustering algorithm (RK-Means) was proposed in this paper. …”
    Article
  14. 14

    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
    “…In this paper, we combine Fuzzy C-Mean and Genetic Algorithms which are popular algorithms, the Grid can be used for scheduling. …”
    Get full text
    Get full text
    Article
  15. 15

    Effect of adopting different dispatching rules on the mean flow time in a two machine batch-shop problem by Abdelraheem Elhaj, Hazir Farouk

    Published 2005
    “…This means that it is highly unlikely to find a polynomial algorithm to solve the problem. …”
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

    Hybrid multiobjective genetic algorithm for integrated dynamic scheduling and routing of jobs and automated guided vehicles in flexible manufacturing systems by Umar, Umar Ali

    Published 2014
    “…Genetic algorithm has recorded of huge success in solving NP-Complete optimization problems with similar nature to this problem. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Comparison of expectation maximization and K-means clustering algorithms with ensemble classifier model by Sulaiman, Md. Nasir, Mohamed, Raihani, Mustapha, Norwati, Zainudin, Muhammad Noorazlan Shah

    Published 2018
    “…EM and K-means clustering algorithms are used to cluster the multi-class classification attribute according to its relevance criteria and afterward, the clustered attributes are classified using an ensemble random forest classifier model. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18
  19. 19

    Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem by Fayaz, Muhammad, Arshad,, Shakeel, Shah,, Abdul Salam, Shah, Asadullah

    Published 2018
    “…Background and Objective: The process of solving the Maximum Clique (MC) problem through approximation algorithms is harder, however, the Maximum Vertex Cover (MVC) problem can easily be solved using approximation algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  20. 20

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

    Published 2021
    “…Clustering technique is able to find hidden patterns and to extract useful information from huge data. 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