Search Results - (( problem implementation clustering algorithm ) OR ( parallel optimization modified algorithm ))
Search alternatives:
- implementation clustering »
- problem implementation »
- parallel optimization »
- optimization modified »
-
1
-
2
A new variant of black hole algorithm based on multi population and levy flight for clustering problem
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
Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim
Published 2012“…The objectives of this project to set-up Beowulf cluster computer to apply the Travelling Salesman Problem in parallel by using Genetic Algorithms and evaluate sequential algorithms and parallel algorithms by Genetic Algorithms. …”
Get full text
Get full text
Thesis -
4
Enhanced Clustering Algorithms For Gray-Scale Image Segmentation
Published 2012“…However, in some cases the conventional clustering algorithms introduce over-segmentation problems and unable to preserve the region of interest (i.e. objects).…”
Get full text
Get full text
Thesis -
5
An improved pheromone-based kohonen self-organising map in clustering and visualising balanced and imbalanced datasets
Published 2021“…The Kohonen Self-Organising Map (KSOM) is one of the well-known clustering algorithms that can solve various problems without a pre-defined number of clusters. …”
Get full text
Get full text
Get full text
Article -
6
An Improved Pheromone-Based Kohonen Self- Organising Map in Clustering and Visualising Balanced and Imbalanced Datasets
Published 2021“…The Kohonen Self-Organising Map (KSOM) is one of the well-known clustering algorithms that can solve various problems without a pre- defined number of clusters. …”
Get full text
Get full text
Get full text
Get full text
Article -
7
Solving traveling salesman problem on cluster compute nodes
Published 2009“…In this paper, we present a parallel implementation of a solution for the Traveling Salesman Problem (TSP). …”
Get full text
Get full text
Article -
8
Parallel multiple tabu search for multiobjective Urban Transit Scheduling Problem
Published 2020“…A set covering model was then adopted to minimize the number of buses and drivers simultaneously. A parallel tabu search algorithm was proposed to solve the problem by modifying the initialization process and incorporating intensification and diversification approaches to guide the search effectively from the different feasible domain in finding optimal solutions with lesser computational effort. …”
Get full text
Get full text
Article -
9
Development of optimization Alghorithm for uncertain non-linear dynamical system
Published 2004“…An algorithm that definitely can satisfy the objectives is the Dynamic Integrated Systems Optimization and Parameter Estimation (DISOPE) algorithm. …”
Get full text
Get full text
Monograph -
10
Web-based clustering tool using fuzzy k-mean algorithm / Ahmad Zuladzlan Zulkifly
Published 2019“…This project will use fuzzy k-means clustering algorithm to cluster the data because it is easy to implement and have many advantages. …”
Get full text
Get full text
Thesis -
11
Efficient genetic partitioning-around-medoid algorithm for clustering
Published 2019“…Throughout the years, considerable efforts made to tackle the clustering problem. Yet, because of the nature of the clustering problem, finding an efficient clustering optimization algorithm with reasonable performance is still an open challenge. …”
Get full text
Get full text
Thesis -
12
Modeling and Analysis of New Hybrid Clustering Technique for Vehicular Ad Hoc Network
Published 2023“…The problems with the K-Means algorithm concern the selection of a suitable number of clusters, the creation of a highly reliable cluster, and achieving high similarity within a cluster. …”
Article -
13
Image clustering comparison of two color segmentation techniques
Published 2010“…The clustering research is regarding the area of data mining and implementation of the clustering algorithms. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
14
Review of the grey wolf optimization algorithm: variants and applications
Published 2023“…The paper begins with a concise introduction to the GWO, providing insight into its natural establishment and conceptual framework for optimization. It then lays out the theoretical foundation and key procedures involved in the GWO, following which it comprehensively examines the most recent iterations of the algorithm and categorizes them into parallel, modified, and hybridized variations. …”
Get full text
Get full text
Article -
15
Distance based sweep nearest algorithm to solve capacitated vehicle routing problem
Published 2016“…On the other hand, Sweep Nearest (SN) algorithm, an extension of Sweep, also considers smallest polar angle customer to initialize a cluster but inserted other customer based on the nearest neighbor approach. …”
Get full text
Get full text
Get full text
Proceeding Paper -
16
-
17
Modified Kohonen network algorithm for selection of the initial centres of Gustafson-Kessel algorithm in credit scoring
Published 2017“…A good clustering analysis implemented by good Initial Centres of clusters should be selected. …”
Get full text
Get full text
Get full text
Article -
18
A modified artificial neural network (ANN) algorithm to control shunt active power filter (SAPF) for current harmonics reduction
Published 2013“…The novelty control design is an artificial neural network (ANN) adopting a modified mathematical algorithm (a modified delta rule weight-updating W-H) and a suitable alpha value (learning rate value) which determines the filters optimal operation. …”
Get full text
Get full text
Conference or Workshop Item -
19
Modeling of vehicle trajectory using K-means and fuzzy C-means clustering
Published 2019“…As these clustering algorithms require the number of clusters as input parameter of the algorithms, the study of number of clusters for the clustering is served as focus in this paper. …”
Get full text
Get full text
Get full text
Get full text
Proceedings -
20
Improving the efficiency of clustering algorithm for duplicates detection
Published 2023“…In the proposed method, high-rank attributes are selected and then preparators are applied to the selected traits. A compensation algorithm is implemented to reduce the problem of missing and distorted sort keys. …”
Get full text
Get full text
Get full text
Get full text
Article
