-
1
-
2
Correlation Clustering via s-Club Cluster Edge Deletion
Published 2023Subjects: “…Cluster analysis -- Data processing…”
Get full text
Get full text
Get full text
masterThesis -
3
Eye-Clustering: An Enhanced Centroids Prediction for K-means Algorithm
Published 2024“…Among these, K-means is widely used for efficiently solving clustering problems. …”
Get full text
Get full text
Get full text
masterThesis -
4
A Survey of Data Clustering Techniques
Published 2023Subjects: “…Cluster analysis -- Data processing…”
Get full text
Get full text
Get full text
masterThesis -
5
Clustering/partitioning algorithms and comparative analysis
Published 1989Subjects: Get full text
Get full text
masterThesis -
6
A Novel Iterative non-Deterministic Algorithm for the Data Clustering Problem
Published 2020Get full text
masterThesis -
7
An enhanced k-means clustering algorithm for pattern discovery in healthcare data
Published 2015“…This paper studies data mining applications in healthcare. Mainly, we study k-means clustering algorithms on large datasets and present an enhancement to k-means clustering, which requires k or a lesser number of passes to a dataset. …”
Get full text
Get full text
Get full text
Get full text
article -
8
DG-Means – A Superior Greedy Algorithm for Clustering Distributed Data
Published 2022Subjects: Get full text
Get full text
Get full text
masterThesis -
9
An algorithm for solving bond pricing problem
Published 2002Get full text
Get full text
Get full text
Get full text
article -
10
Improved search-tree algorithms for the cluster edit problem. (c2011)
Published 2011Get full text
Get full text
masterThesis -
11
A Parallel Neural Networks Algorithm for the Clique Partitioning Problem
Published 2002“…In this paper we present a parallel algorithm to solve the above problem for arbitrary graphs using a Hopfield Neural Network model of computation. …”
Get full text
Get full text
article -
12
Genetic Algorithm Analysis using the Graph Coloring Method for Solving the University Timetable Problem
Published 2018“…Genetic algorithms were successfully useful to solve many optimization problems including the university Timetable Problem. …”
Get full text
Get full text
Get full text
Get full text
article -
13
-
14
Augmented arithmetic optimization algorithm using opposite-based learning and lévy flight distribution for global optimization and data clustering
Published 2022Subjects: “…Data clustering…”
-
15
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 -
16
NEW ALGORITHMS FOR SOLVING THE FUZZY CLUSTERING PROBLEM
Published 2020“…Two new algorithms for fuzzy clustering are presented. Convergence of the proposed algorithms is proved. …”
Get full text
article -
17
An evolutionary algorithm for solving the geometrically constrained site layout problem
Published 2017“…This paper presents an investigation of applying an evolutionary approach to optimally solve the aforementioned layout problem. The proposed algorithm is two-phases: an initialization phase that generates an initial population of layouts through a sequence of mutation operations, and a reproduction phase that evolve the layouts generated in phase one through a sequence of genetic operations aiming at finding an optimal layout. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
18
-
19
(k, l)-Clustering for Transactional Data Streams Anonymization
Published 2018“…We evaluate our algorithm in terms of utility by considering two different (k, l)-clustering approaches.…”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
20
Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem
Published 1998“…This paper describes a hybrid algorithm that combines an adaptive-type neural network algorithm and a nondeterministic iterative algorithm to solve the Euclidean traveling salesman problem (E-TSP). …”
Get full text
Get full text
article