Mostra i principali dati dell'item

dc.contributor.authorPacheco Bonrostro, Joaquín 
dc.contributor.authorValencia García, Olga 
dc.date.accessioned2024-01-25T12:13:05Z
dc.date.available2024-01-25T12:13:05Z
dc.date.issued2003-06
dc.identifier.issn0167-9473
dc.identifier.urihttp://hdl.handle.net/10259/8477
dc.description.abstractA series of metaheuristic algorithms is proposed and analyzed for the non-hierarchical clustering problem under the criterion of minimum sum-of-squares clustering. These algorithms incorporate genetic operators and local search and tabu search procedures. The aim is to obtain quality solutions with short computation times. A series of computational experiments has been performed. The proposed algorithms obtain better results than previously reported methods, especially with a small number of clusters.en
dc.format.mimetypeapplication/pdf
dc.language.isoenges
dc.publisherElsevieres
dc.relation.ispartofComputational Statistics & Data Analysis. 2003, V. 43, n. 2, p. 235-248en
dc.subjectClusterizationen
dc.subjectMetaheuristicsen
dc.subjectTabu searchen
dc.subjectGenetic algorithmsen
dc.subjectMemetic algorithmsen
dc.subjectHybrid algorithmsen
dc.subject.otherEstadística matemáticaes
dc.subject.otherMathematical statisticsen
dc.titleDesign of hybrids for the minimum sum-of-squares clustering problemen
dc.typeinfo:eu-repo/semantics/articlees
dc.rights.accessRightsinfo:eu-repo/semantics/closedAccesses
dc.relation.publisherversionhttps://doi.org/10.1016/S0167-9473(02)00224-4es
dc.identifier.doi10.1016/S0167-9473(02)00224-4
dc.journal.titleComputational Statistics & Data Analysises
dc.volume.number43es
dc.issue.number2es
dc.page.initial235es
dc.page.final248es
dc.type.hasVersioninfo:eu-repo/semantics/publishedVersiones


Files in questo item

Questo item appare nelle seguenti collezioni

Mostra i principali dati dell'item