Search Results - (( java simulation optimization algorithm ) OR ( quality solution clustering algorithm ))

Refine Results
  1. 1

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

    Published 2012
    “…Moreover, experiments demonstrate that final clustering solution generated by the proposed incremental genetic-based clustering ensemble algorithm using the pattern ensemble learning method possess comparative or better clustering accuracy than clustering solutions generated by the incremental genetic-based clustering ensemble algorithms using other recombination operators. …”
    Get full text
    Get full text
    Thesis
  2. 2

    A new variant of black hole algorithm based on multi population and levy flight for clustering problem by Haneen Abdul Wahab, Abdul Raheem

    Published 2020
    “…Meta-heuristic algorithm has been successfully implemented on data clustering problems seeking a near optimal solution in terms of quality of the resultant clusters. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Ringed seal search for global optimization via a sensitive search model / Younes Saadi by Younes, Saadi

    Published 2018
    “…The quality of the algorithm is comprehensively evaluated on various standard benchmark test functions using variety of quality metrics and using three baseline algorithms for comparison. …”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    A modified π rough k-means algorithm for web page recommendation system by Zidane, Khaled Ali Othman

    Published 2018
    “…The experimental results revealed that the modified πRKM algorithm significantly affected the partitions quality of the cluster obtained. …”
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5
  6. 6

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

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

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

    Published 2018
    “…The latter drawbacks are consequences of the difficulty in balancing the exploration and exploitation processes which directly affect the final quality of the clustering solutions. Hence, this research has proposed three enhanced frameworks, namely, Optimized Gravitational-based (OGC), Density-Based Particle Swarm Optimization (DPSO), and Variance-based Differential Evolution with an Optional Crossover (VDEO) frameworks for data clustering. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph
  11. 11

    A cluster analysis of population based cancer registry in Brunei Darussalam : an exploratory study by Lai, Daphne Teck Ching, Owais A. Malik

    Published 2022
    “…Six distinct demographic subgroups were consistently found by three algorithms while model-based clustering solution were not considered for deeper analysis as highly imbalanced clusters were produced. …”
    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
    “…In general, genetic based clustering algorithms showed the ability to reach near global optimal solution. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Seed disperser ant algorithm for optimization / Chang Wen Liang by Chang , Wen Liang

    Published 2018
    “…The optimal results obtained for constrained engineering problems as well as data clustering are very promising in terms of quality of solutions and convergence speed of the algorithm.…”
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14

    Data dissemination in VANETs using clustering and probabilistic forwarding based on adaptive jumping multi-objective firefly optimization by Hamdi, Mustafa Maad, Audah, Lukman, Rashid, Sami Abduljabbar

    Published 2022
    “…The solution space design in CFM combined two variables: the first is the probability of forwarding and the second is the maximum number of nodes within one cluster. …”
    Get full text
    Get full text
    Article
  15. 15

    Video abstraction using density-based clustering algorithm by Chamasemani, Fereshteh Falah, Affendey, Lilly Suriani, Mustapha, Norwati, Khalid, Fatimah

    Published 2017
    “…The novelty of DbSva is (a) to integrate the advantages of both the global and local features of video contents by fusion and (b) to employ the DENsity-based CLUstEring algorithm (DENCLUE) to significantly improve the quality of abstract videos. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
    Review
  17. 17
  18. 18

    Minimizing the number of stunting prevalence using the euclid algorithm clustering approach by Zarlis, Muhammad, Oktavia, Tanty, Buaton, Relita, Ernawan, Ferda, Andrian, Kevin

    Published 2023
    “…The algorithm used is Euclid. The Euclid algorithm can cluster stunting prevalence data into 4 clusters with the very little category at 79%, the little category at 67%, the many categories at 51%, and the very much category at 21%. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
    Get full text
    Get full text
    Thesis
  20. 20