A set-theoretical approach to the problem of hierarchical clustering

DOI10.1016/0022-2496(77)90041-4zbMath0358.62042OpenAlexW2027459913MaRDI QIDQ1238382

Lawrence J. Hubert

Publication date: 1977

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-2496(77)90041-4

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Applications of statistics to psychology (62P15)

Related Items (10)

An order theoretic framework for overlapping clustering ⋮ Triadic distance models: axiomatization and least squares representation ⋮ The Approximation of Arbitrary Clustering Functions by Clustering Functions which Satisfy Overlapping Criteria ⋮ Preservation of global order equivalence ⋮ Ordinal and percentile clustering ⋮ Some Aspects of Clustering Functions ⋮ Unnamed Item ⋮ Dissimilarity coefficients which are independent of a special set of data ⋮ Some aspects of qualitative data analysis ⋮ Consistency in ordinal data analysis. I.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some applications of graph theory to clustering
• Nonmetric grouping: clusters and cliques
• Parallel concepts in graph theory
• Hierarchical clustering schemes
• Multi-Terminal Network Flows
• Graphs Implied by the Jardine-Sibson Overlapping Clustering Methods, B k
• Printer graphics for clustering
• A Probability Theory of Cluster Analysis
• An improved algorithm for the Jardine-Sibson method of generating overlapping clusters
• Some observations on a paper by Lance and Williams
• k-Components, Clusters and Slicings in Graphs

This page was built for publication: A set-theoretical approach to the problem of hierarchical clustering