A set-theoretical approach to the problem of hierarchical clustering
type: Item
instance of: scholarly article
title: A set-theoretical approach to the problem of hierarchical clustering
zbMATH Open document ID: 0358.62042
DOI: 10.1016/0022-2496(77)90041-4
author: Lawrence Hubert
published in: Journal of Mathematical Psychology
publication date: 1977-01-01T00:00:00Z
Mathematics Subject Classification ID: 62H25
Mathematics Subject Classification ID: 62P15
zbMATH DE Number: 3558745
MaRDI profile type: Publication
full work available at URL: 0022-2496(77)90041-4
OpenAlex ID: W2027459913
cites work: Q3941433
cites work: An improved algorithm for the Jardine-Sibson method of generating overlapping clusters
cites work: Multi-Terminal Network Flows
cites work: Parallel concepts in graph theory
cites work: Printer graphics for clustering
cites work: Some applications of graph theory to clustering
cites work: Q4085109
cites work: Hierarchical clustering schemes
cites work: A Probability Theory of Cluster Analysis
cites work: k-Components, Clusters and Slicings in Graphs
cites work: Nonmetric grouping: clusters and cliques
cites work: Graphs Implied by the Jardine-Sibson Overlapping Clustering Methods, B k
cites work: Some observations on a paper by Lance and Williams
cites work: Q4773020
description: scientific article; zbMATH DE number 3558745