Search Results - (( data optimization means algorithm ) OR ( parameter optimization window algorithm ))

Refine Results
  1. 1

    Efficient management of Top-k queries over Uncertain Data Streams with dynamic Sliding Window Model by Raja Wahab, Raja Azhan Syah

    Published 2024
    “…The experiment was conducted in triplicate and recorded the mean value of these iterations. As the data set size increases, SWMTop-kDelta consistently performs well, regardless of the data set size and the measurement of the number parameter k. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    Optimization of Microbial Electrolysis Cell for Sago Mill Wastewater Derived Biohydrogen via Modeling and Artificial Neural Network by Mohamad Afiq, Mohd Asrul

    Published 2023
    “…The model reliability describes the second sub-objective, which is to determine the feasible operating window of the MEC using multiple-objective optimization based on the nonlinear convex method using gradient descent algorithm as the objective function in maximizing the percentage efficiency of the MEC after validating the mathematical model. …”
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3

    Analysis and decentralised optimal flow control of heterogeneous computer communication network models by Ku-Mahamud, Ku Ruhana

    Published 1993
    “…The direct dependence of the maximum throughput on the mean time delay is also determined. The optimal local flow control with global objectives results in a team decision that does not favour any individual user, and depends only on the relative order of their packet generation rates. …”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    An optimized aggregate marker algorithm for bandwidth fairness improvement in classifying traffic networks by Al-Kharasani, Ameen Mohammed Abdulkarem, Othman, Mohamed, Abdullah, Azizol, Kweh, Yeah Lun

    Published 2016
    “…This article analyses and evaluates a new time sliding window traffic marker algorithm called the Optimized time sliding window Three Colour Marker (OtswTCM). …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    Fair bandwidth distribution marking and scheduling algorithm in network traffic classification by Al-Kharasani, Ameen Mohammed Abdulkarem

    Published 2019
    “…Second, an Optimized time sliding window packet marker (OTSWTCM) algorithm. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Taguchi-Grey Relational Analysis Method for Parameter Tuning of Multi-objective Pareto Ant Colony System Algorithm by Muthana, Shatha Abdulhadi, Ku Mahamud, Ku Ruhana

    Published 2023
    “…This research aims to find the optimal parameter values for the Pareto Ant Colony System (PACS) algorithm, which is used to obtain solutions for the generator maintenance scheduling problem. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Context enrichment framework for sentiment analysis in handling word ambiguity resolution by Yusof, Nor Nadiah

    Published 2024
    “…For classification performances, optimization of machine learning parameters and exploration of deep learning approaches can be applied for further enhancement.…”
    Get full text
    Get full text
    Thesis
  8. 8

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

    A near-optimal centroids initialization in K-means algorithm using bees algorithm by Mahmuddin, Massudi, Yusof, Yuhanis

    Published 2009
    “…This creates problem for novice users especially to those who have no or little knowledge on the data.Trial-error attempt might be one of the possible preference to deal with this issue.In this paper, an optimization algorithm inspired from the bees foraging activities is used to locate near-optimal centroid of a given data set.Result shows that propose approached prove it robustness and competence in finding a near optimal centroid on both synthetic and real data sets.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

    Design of intelligent Qira’at identification algorithm by Kamarudin, Noraziahtulhidayu

    Published 2017
    “…The process of the SPAP Algorithm is to extend parameters of the Affine Projection Block with two different selections of windowing length that affect the final accuracy on pattern classification. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Development of an education simulator for particle swarm optimization in solving economic dispatch problems: article / Mohd Hafiz Mat Hussain by Mat Hussain, Mohd Hafiz

    Published 2009
    “…In the developed simulator, users are able to set the parameters that have influences on particle swarm optimization performance. …”
    Get full text
    Get full text
    Article
  12. 12

    Development of an education simulator for particle swarm optimization in solving economic dispatch problems / Mohd Hafiz Mat Hussain by Mat Hussain, Mohd Hafiz

    Published 2009
    “…In the developed simulator, users are able to set the parameters that have influences on particle swarm optimization performance. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Data clustering using the bees algorithm by Pham, D.T, Otri, S., Afify, A., Mahmuddin, Massudi, Al-Jabbouli, H.

    Published 2007
    “…K-means clustering involves search and optimization. …”
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14

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

    Optimization of the hidden layer of a multilayer perceptron with backpropagation (bp) network using hybrid k-means-greedy algorithm (kga) for time series prediction by Tan, James Yiaw Beng

    Published 2012
    “…The proposed KGA model combines greedy algorithm withk-means++ clustering in this research to assist users in automating the finding of the optimal number of new-ons inside the hidden layer of the BP network. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    Clustering chemical data set using particle swarm optimization based algorithm by Triyono, Triyono

    Published 2008
    “…In this study, Particle Swarm Optimization (PSO) based clustering algorithm is exploited to optimize the results of other clustering algorithm such as K-means. …”
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    An improved data classification framework based on fractional particle swarm optimization by Sherwani, Fahad

    Published 2019
    “…The proposed algorithm is tested and verified for optimization performance comparison on ten benchmark functions against six existing established algorithms in terms of Mean of Error and Standard Deviation values. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

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

    Discovering optimal clusters using firefly algorithm by Mohammed, Athraa Jasim, Yusof, Yuhanis, Husni, Husniza

    Published 2016
    “…Existing conventional clustering techniques require a pre-determined number of clusters, unluckily; missing information about real world problem makes it a hard challenge.A new orientation in data clustering is to automatically cluster a given set of items by identifying the appropriate number of clusters and the optimal centre for each cluster.In this paper, we present the WFA_selection algorithm that originates from weight-based firefly algorithm.The newly proposed WFA_selection merges selected clusters in order to produce a better quality of clusters.Experiments utilising the WFA and WFA_selection algorithms were conducted on the 20Newsgroups and Reuters-21578 benchmark dataset and the output were compared against bisect K-means and general stochastic clustering method (GSCM).Results demonstrate that the WFA_selection generates a more robust and compact clusters as compared to the WFA, bisect K-means and GSCM.…”
    Get full text
    Get full text
    Article