Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Randomised local search algorithm for the clustering problem

From MaRDI portal
Publication:1606683
Jump to:navigation, search

DOI10.1007/S100440070007zbMath0991.68656OpenAlexW2126782412MaRDI QIDQ1606683

Pasi Fränti, Juha Kivijärvi

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


zbMATH Keywords

ClusteringImage processingLocal searchCompressionCombinatorial optimisationVector quantisation


Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99)


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1606683&oldid=13905736"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 02:52.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki