Search Results - (( problem implementation clustering algorithm ) OR ( based optimization method algorithm ))
Search alternatives:
- implementation clustering »
- problem implementation »
- method algorithm »
-
1
Distance based sweep nearest algorithm to solve capacitated vehicle routing problem
Published 2016“…This study investigates a different way of clustering based on nearest neighbor approach. The proposed Distance based Sweep Nearest (DSN) method starts clustering from the farthest customer point and continue for a cluster based on nearest neighbor concept. …”
Get full text
Get full text
Get full text
Proceeding Paper -
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
Efficient genetic partitioning-around-medoid algorithm for clustering
Published 2019“…In general, genetic based clustering algorithms showed the ability to reach near global optimal solution. …”
Get full text
Get full text
Thesis -
4
Hybrid metaheuristic method for clustering in wireless sensor networks / Bryan Raj Peter Jabaraj
Published 2023“…As such, this thesis proposes a hybrid metaheuristic method that consists of Sperm Swarm Optimization (SSO) algorithm and Genetic Algorithm (GA), which is termed HSSOGA. …”
Get full text
Get full text
Get full text
Thesis -
5
Modeling and Analysis of New Hybrid Clustering Technique for Vehicular Ad Hoc Network
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 -
6
-
7
A new hybrid deep neural networks (DNN) algorithm for Lorenz chaotic system parameter estimation in image encryption
Published 2023“…Lastly, a new hybrid technique suggests tackling the current image encryption application problem by using the estimated parameters of chaotic systems with an optimization algorithm, the SKF algorithm. …”
Get full text
Get full text
Thesis -
8
Survey on Clustered Routing Protocols Adaptivity for Fire Incidents: Architecture Challenges, Data Losing, and Recommended Solutions
Published 2025“…Many clustered routing algorithms have been developed to address various issues like energy efficiency, network lifetime, and hotspot problems. …”
Article -
9
Development of compound clustering techniques using hybrid soft-computing algorithms
Published 2006“…The hierarchical fuzzy clustering method developed here is far better than a similar implementation of the hard k-means method. …”
Get full text
Get full text
Monograph -
10
A Framework for Green Energy Resources Identification and Integration Supported by Real-Time Monitoring, Control, and Automation Applications
Published 2025“…Validation against conventional methods and state-of-the-art algorithms confirmed the superior performance of the proposed approach. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
11
Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling
Published 2022“…Particle Swarm Optimization (PSO) is a population-based metaheuristic that possesses many advantages compared to other metaheuristics in solving scheduling problems. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
12
Analytical framework for predicting online purchasing behavior in Malaysia using a machine learning approach
Published 2025“…The descriptive analysis examines purchasing behavior through correlation and regression analyses, while the predictive model uses decision trees (J48, Random Tree, REPTree), rule-based algorithms (JRip, OneR, PART), and clustering (K-Means) to identify patterns and predict trends. …”
Get full text
Get full text
Thesis -
13
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 -
14
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 -
15
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 -
16
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 -
17
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 -
18
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 -
19
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 -
20
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
