Direct reading algorithm for hierarchical clustering
type: Item
instance of: scholarly article
title: Direct reading algorithm for hierarchical clustering
zbMATH Open document ID: 1404.68041
author: F. Murtagh
author: Pedro Contreras
publication date: 2017-02-09T00:00:00Z
Mathematics Subject Classification ID: 68P99
Mathematics Subject Classification ID: 62H30
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6682408
zbMATH Keywords: analytics
zbMATH Keywords: hierarchical clustering
zbMATH Keywords: ultrametric topology
zbMATH Keywords: \(p\)-adic and \(m\)-adic number representation
zbMATH Keywords: linear-time computational complexity
MaRDI profile type: Publication
full work available at URL: j.endm.2016.11.006
OpenAlex ID: W2559377253
cites work: Fast, linear time hierarchical clustering using the Baire metric
cites work: Hierarchical trees can be perfectly scaled in one dimension
cites work: Seriation and matrix reordering methods: An historical overview
cites work: Least squares quantization in PCM
cites work: Symmetry in data mining and analysis: a unifying view based on hierarchy
cites work: Hierarchical Clustering of Massive, High Dimensional Data Sets by Exploiting Ultrametric Embedding
DOI: 10.1016/J.ENDM.2016.11.006
description: scientific article; zbMATH DE number 6682408