Constructing hierarchical set systems
type: Item
instance of: scholarly article
title: Constructing hierarchical set systems
zbMATH Open document ID: 1058.05061
author: Claudine Devauchelle
author: Andreas W. M. Dress
author: Alexander Grossmann
author: Stefan Grünewald
author: Alain Hénaut
published in: Annals of Combinatorics
publication date: 2005-02-25T00:00:00Z
review text: This paper introduces a new algorithm to achieve data clusters. The procedure works with dissimilarity data. It starts with the so-called Apresjan hierarchy and while the needed calculations are easy and fast, the resulting nested clusters give a very good understanding of the data.
reviewed by: Péter L. Erdős
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 92B10
Mathematics Subject Classification ID: 92D15
Mathematics Subject Classification ID: 62G30
Mathematics Subject Classification ID: 62-07
zbMATH DE Number: 2138554
zbMATH Keywords: set systems
zbMATH Keywords: hierarchies
zbMATH Keywords: Farris transform
zbMATH Keywords: ranking procedure
zbMATH Keywords: ranking statistics
zbMATH Keywords: diversity optimization
MaRDI profile type: Publication
full work available at URL: s00026-004-0231-5
OpenAlex ID: W2121058991
Wikidata QID: Q94696471
DOI: 10.1007/S00026-004-0231-5
description: scientific article; zbMATH DE number 2138554