A TABU SEARCH APPROACH TO THE CLUSTERING PROBLEM
In this paper we consider the problem of clustering m objects into c clusters. The objects are represented by points in an n-dimensional Euclidean space, and the objective is to classify these m points into c clusters such that the distance between points within a cluster and its center (which is to...
محفوظ في:
| المؤلف الرئيسي: | AlSultan, K.S. (author) |
|---|---|
| مؤلفون آخرون: | unknown (author) |
| التنسيق: | article |
| منشور في: |
2020
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/2549/1/a_tabu_search_approach_to_the_clustering_alsultan_isi_a1995rv43600011.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
A Tabu Search-Based Algorithm For The Fuzzy Clustering Problem
حسب: AlSultan, K.S.
منشور في: (2020) -
A Hard Clustering Approach To The Part Family Formation Problem
حسب: AlSultan, K.S.
منشور في: (2020) -
Computational Experience On Four Algorithms For The Hard Clustering Problem
حسب: AlSultan, K.S.
منشور في: (2020) -
Parallelizing Tabu Search on a Cluster of HeterogeneousWorkstations
حسب: Al-Yamani, Ahmad
منشور في: (2020) -
A Genetic Algorithm For The Part Family Formation Problem
حسب: AlSultan, K.S.
منشور في: (2020)