Compatibility in a graph-theoretic setting

DOI10.1016/0165-4896(93)90030-MzbMath0786.92028OpenAlexW2081981428MaRDI QIDQ2367164

Ralph Stinebrickner, Melvin F. Janowitz

Publication date: 11 August 1993

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0165-4896(93)90030-m

zbMATH Keywords

classificationpartitiontransformationdissimilaritiesmonotone equivalent cluster methodnested sequence of undirected graphs

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Clustering in the social and behavioral sciences (91C20) Applications of graph theory (05C90)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clique optimization: A method to construct parsimonious ultrametric trees from similarity data
• Order theoretic classification of monotone equivariant cluster methods
• Preservation of global order equivalence
• Classification of normalized cluster methods in an order theoretic model
• Some applications of graph theory to clustering
• Validity of clusters formed by graph-theoretic cluster methods
• Monotone Equivariant Cluster Methods
• Graphs Implied by the Jardine-Sibson Overlapping Clustering Methods, B k
• An Order Theoretic Model for Cluster Analysis
• On the theory and construction of k-clusters

This page was built for publication: Compatibility in a graph-theoretic setting