Název:	LVCluster: Bounded Clustering using Laguerre Voronoi Diagram
Autoři:	Ohi, Abu Quwsar Gavrilova, Marina
Citace zdrojového dokumentu:	WSCG 2024: full papers proceedings: 32. International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision, p. 255-262.
Datum vydání:	2024
Nakladatel:	Václav Skala - UNION Agency
Typ dokumentu:	konferenční příspěvek conferenceObject
URI:	http://hdl.handle.net/11025/57397
ISSN:	2464–4625 (online) 2464–4617 (print)
Klíčová slova:	Laguerrova geometrie;Voronoiův diagram;shlukování;KMeans;klesající gradient
Klíčová slova v dalším jazyce:	Laguerre Geometry;Voronoi Diagram;clustering;KMeans;gradient descending
Abstrakt v dalším jazyce:	Clustering, a fundamental technique in unsupervised learning, identifies similar groups within a dataset. However, clustering algorithms encounter limitations when requiring a predetermined number of clusters/centroids/labels. This paper proposes a novel approach of clustering by integrating concepts from Voronoi diagrams in Laguerre geometry, namely, Laguerre Voronoi Clustering (LVCluster). Laguerre geometry introduces circles by adding radius weight metric to centroids, enabling dynamic exclusion from clustering criteria. Consequently, this approach offers flexibility by necessitating only one hyperparameter, an upper-bound value for the number of circles. LVCluster can be optimized using gradient descent and can be jointly optimized with deep neural network architectures. The experimental results indicated that LVCluster outperforms clustering algorithms when trained individually and jointly with deep neural networks on increased cluster centroids.
Práva:	© Václav Skala - UNION Agency
Vyskytuje se v kolekcích:	WSCG 2024: Full Papers Proceedings

Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.