Randomised local search algorithm for the clustering problem
From MaRDI portal
Publication:1606683
DOI10.1007/S100440070007zbMath0991.68656OpenAlexW2126782412MaRDI QIDQ1606683
Publication date: 25 July 2002
Published in: PAA. Pattern Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s100440070007
Related Items (7)
Iterative shrinking method for clustering problems ⋮ \(K\)-harmonic means data clustering with simulated annealing heuristic ⋮ Local search algorithms for the composite retrieval problem ⋮ Automatic clustering and boundary detection algorithm based on adaptive influence function ⋮ \(K\)-harmonic means data clustering with tabu-search method ⋮ An enhanced genetic algorithm with new mutation for cluster analysis ⋮ Improving a centroid-based clustering by using suitable centroids from another clustering
This page was built for publication: Randomised local search algorithm for the clustering problem