Hierarchical clustering: objective functions and algorithms

zbMATH Open1403.68345arXiv1704.02147MaRDI QIDQ4607904FDOQ4607904

Authors: Vincent Cohen-Addad, Varun Kanade, Frederik Mallmann-Trenn, Claire Mathieu 

Publication date: 15 March 2018

Full work available at URL: https://arxiv.org/abs/1704.02147

Recommendations

• Hierarchical clustering. Objective functions and algorithms
• Hierarchical clustering better than average-linkage
• A cost function for similarity-based hierarchical clustering
• An improved cost function for hierarchical cluster trees
• Hierarchical clustering via spreading metrics

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Approximation algorithms (68W25)

Cited In (18)

• Hierarchical clustering with topology databases
• Wide gaps and Kleinberg's clustering axioms for \(k\)-means
• End-to-end similarity learning and hierarchical clustering for unfixed size datasets
• Hierarchical clustering via spreading metrics
• Approximate hierarchical clustering via sparsest cut and spreading metrics
• Title not available (Why is that?)
• Ultrametric fitting by gradient descent ^*
• A comprehensive study of clustering a class of 2D shapes
• Optimal hierarchical clustering on a graph
• Tangles and Hierarchical Clustering
• Expanding the class of global objective functions for dissimilarity-based hierarchical clustering
• Aggregation of Markov flows I: theory
• An improved cost function for hierarchical cluster trees
• Hierarchical clustering better than average-linkage
• Hierarchical clustering. Objective functions and algorithms
• Algorithm of Hierarchical Matrix Clusterization and Its Applications
• A flexible ILP formulation for hierarchical clustering
• A cost function for similarity-based hierarchical clustering

This page was built for publication: Hierarchical clustering: objective functions and algorithms

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