End-to-end similarity learning and hierarchical clustering for unfixed size datasets

DOI10.1007/978-3-030-80209-7_64zbMATH Open1485.94036OpenAlexW3168758093MaRDI QIDQ2117909FDOQ2117909

Santiago Velasco-Forero, Leonardo Gigli, Beatriz Marcotegui

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-80209-7_64

Recommendations

• Hierarchical clustering. Objective functions and algorithms
• An improved cost function for hierarchical cluster trees
• Hierarchical clustering: objective functions and algorithms
• A cost function for similarity-based hierarchical clustering
• Learning hierarchical clustering from examples — application to the adaptive construction of dissimilarity indices

zbMATH Keywords

Dasgupta's cost functionhyperbolic hierarchical clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Artificial neural networks and deep learning (68T07) Informational aspects of data analysis and big data (94A16)

Cites Work

• A cost function for similarity-based hierarchical clustering
• Ultrametric fitting by gradient descent ^*

This page was built for publication: End-to-end similarity learning and hierarchical clustering for unfixed size datasets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117909)