Clustering aims to split a set of objects into k groups (called clusters), in such a way each cluster contains similar objects and dissimilar objects find place in different clusters. The silhouette coefficient is a metric which is widely used to evaluate the goodness of a clustering. In this thesis are presented some methods to solve the clustering problem by optimizing the silhouette. The optimization is done by means of local search techniques. The proposed algorithms underwent an exhaustive phase of testing, in comparison with the standard ones, on both real and synthetic datasets. From the results we can see how one of the proposed algorithms can be competitive with Lloyd’s algorithm for k-means and also overcame other standard algorithms such as PAM for k-medoids.

A local search approach to silhouette-based clustering

PERESSONI, DAVIDE
2021/2022

Abstract

Clustering aims to split a set of objects into k groups (called clusters), in such a way each cluster contains similar objects and dissimilar objects find place in different clusters. The silhouette coefficient is a metric which is widely used to evaluate the goodness of a clustering. In this thesis are presented some methods to solve the clustering problem by optimizing the silhouette. The optimization is done by means of local search techniques. The proposed algorithms underwent an exhaustive phase of testing, in comparison with the standard ones, on both real and synthetic datasets. From the results we can see how one of the proposed algorithms can be competitive with Lloyd’s algorithm for k-means and also overcame other standard algorithms such as PAM for k-medoids.
2021
A local search approach to silhouette-based clustering
clustering
optimization
coreset
silhouette
local search
File in questo prodotto:
File Dimensione Formato  
Peressoni_Davide.pdf

accesso aperto

Dimensione 893.92 kB
Formato Adobe PDF
893.92 kB Adobe PDF Visualizza/Apri

The text of this website © Università degli studi di Padova. Full Text are published under a non-exclusive license. Metadata are under a CC0 License

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.12608/40252