Search alternatives:
processing algorithm » processing algorithms (Expand Search)
local clustering » data clustering (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
element » elements (Expand Search)
processing algorithm » processing algorithms (Expand Search)
local clustering » data clustering (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
element » elements (Expand Search)
-
1
Efficient Dynamic Cost Scheduling Algorithm for Data Batch Processing
Published 2016“…A Master of Science thesis in Engineering Systems Management by Alia Al Sadawi entitled, "Efficient Dynamic Cost Scheduling Algorithm for Data Batch Process," submitted in May 2016. …”
Get full text
doctoralThesis -
2
Correlation Clustering with Overlaps
Published 2020“…Moreover, we allow the new vertex splitting operation, which allows the resulting clusters to overlap. In other words, data elements (or vertices) will be allowed to be members in more than one cluster instead of limiting them to only one single cluster, as in classical clustering methods. …”
Get full text
Get full text
Get full text
masterThesis -
3
Efficient Dynamic Cost Scheduling Algorithm for Financial Data Supply Chain
Published 2021“…An iterative dynamic scheduling algorithm (DCSDBP) was developed to address the data batching process. …”
Get full text
article -
4
Genetic and heuristic algorithms for regrouping service sites. (c2000)
Published 2000Subjects: “…Genetic algorithms -- Data processing…”
Get full text
Get full text
masterThesis -
5
On the steiner walk problem. (c2009)
Published 2009Subjects: “…Euclidean algorithm -- Data processing…”
Get full text
Get full text
masterThesis -
6
-
7
A genetic algorithm for corrective retesting. (c1995)
Published 1995Subjects: Get full text
Get full text
masterThesis -
8
Multi Self-Organizing Map (SOM) Pipeline Architecture for Multi-View Clustering
Published 2024“…A self-organizing map is one of the well-known unsupervised neural network algorithms used for preserving typologies during mapping from the input space (high-dimensional) to the display (low-dimensional).An algorithm called Local Adaptive Receptive Field Dimension Selective Self-Organizing Map 2 is a modified form of a self-organizing Map to cater different data types in the dataset. …”
-
9
DG-Means – A Superior Greedy Algorithm for Clustering Distributed Data
Published 2022Subjects: Get full text
Get full text
Get full text
masterThesis -
10
A GLOBAL ALGORITHM FOR THE FUZZY CLUSTERING PROBLEM
Published 2020“…The Fuzzy clustering (FC) problem is a non-convex mathematical program which usually possesses several local minima. …”
Get full text
article -
11
A SIMULATED ANNEALING ALGORITHM FOR THE CLUSTERING PROBLEM
Published 2020“…In this paper we discuss the solution of the clustering problem usually solved by the K-means algorithm. …”
Get full text
article -
12
Three-phase approach for curriculum-based course timetabling problem. (c2012)
Published 2012Subjects: “…Scheduling -- Data processing…”
Get full text
Get full text
masterThesis -
13
-
14
Clustering/partitioning algorithms and comparative analysis
Published 1989Subjects: Get full text
Get full text
masterThesis -
15
Computational Experience On Four Algorithms For The Hard Clustering Problem
Published 2020“…The problem is a difficult optimization problem due to the fact that: it posseses many local minima. Several algorithms have been developed to solve this problem which include the k-means algorithm, the simulated annealing algorithm, the tabu search algorithm, and the genetic algorithm. …”
Get full text
article -
16
Improved search-tree algorithms for the cluster edit problem. (c2011)
Published 2011Get full text
Get full text
masterThesis -
17
A Survey of Data Clustering Techniques
Published 2023Subjects: “…Cluster analysis -- Data processing…”
Get full text
Get full text
Get full text
masterThesis -
18
-
19
A Tabu Search-Based Algorithm For The Fuzzy Clustering Problem
Published 2020“…The Fuzzy Clustering Problem (FCP) is a mathematical program which is difficult to solve since it is nonconvex, which implies possession of many local minima. …”
Get full text
article -
20
A decentralized load balancing strategy for parallel search-three optimization. (c2010)
Published 2010Subjects: “…Trees (Graph theory) -- Data processing…”
Get full text
Get full text
masterThesis