Some applications of graph theory to clustering

DOI10.1007/BF02291704zbMath0317.62079OpenAlexW2066909688MaRDI QIDQ1222008

Lawrence J. Hubert

Publication date: 1974

Published in: Psychometrika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02291704

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (05C99) Applications of statistics to psychology (62P15)

Related Items (38)

Compatibility in a graph-theoretic setting ⋮ Cluster analysis and mathematical programming ⋮ Validity studies in clustering methodologies ⋮ Metaheuristics for the minimum gap graph partitioning problem ⋮ Induced \(H\)-packing \(k\)-partition number for certain nanotubes and chemical graphs ⋮ The Approximation of Arbitrary Clustering Functions by Clustering Functions which Satisfy Overlapping Criteria ⋮ Preservation of global order equivalence ⋮ Clusteranalyse - Überblick und neuere Entwicklungen ⋮ Typed topology and its application to data sets ⋮ The median procedure in cluster analysis and social choice theory ⋮ Clique optimization: A method to construct parsimonious ultrametric trees from similarity data ⋮ Ising formulations of some graph-theoretic problems in psychological research: models and methods ⋮ Some Aspects of Clustering Functions ⋮ Identifying genuine clusters in a classification ⋮ Clustering representations of group overlap† ⋮ ConPar: a method for identifying groups of concordant subject proximity matrices for subsequent multidimensional scaling analyses ⋮ Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices ⋮ Data analysis implications of some concepts related to the cuts of a graph ⋮ Nonmetric grouping: clusters and cliques ⋮ A set-theoretical approach to the problem of hierarchical clustering ⋮ Constructing blockmodels: how and why ⋮ Survey sampling in graphs ⋮ Feature definition in pattern recognition with small sample size ⋮ A constrained \(k\)-means clustering algorithm for classifying spatial units ⋮ Clique analysis of a tolerance relation ⋮ Induced \(H\)-packing \(k\)-partition problem in certain carbon based nanostructures ⋮ Validity of clusters formed by graph-theoretic cluster methods ⋮ Classification and specification of flat cluster methods ⋮ Attribute hierarchy models in cognitive diagnosis: identifiability of the latent attribute space and conditions for completeness of the Q-matrix ⋮ A Learning Algorithm for the Optimum-Path Forest Classifier ⋮ COBLOC: A hierarchical method for blocking network data ⋮ GENERALIZED INFORMATION THEORY AND DECOMPOSABILITY OF SYSTEMS ⋮ Some aspects of qualitative data analysis ⋮ Structural models with qualitative values ⋮ A stratificational overlapping cluster scheme ⋮ Fixed points approach to clustering ⋮ Constructing optimal ultrametrics ⋮ Consistency in ordinal data analysis. I.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Metrics on spaces of finite trees
• A metric and an ordering on sets
• Data analysis and the connectivity of random graphs
• Hierarchical clustering schemes
• A graph theoretic approach to similarity relations
• Some extensions of Johnson's hierarchical clustering algorithms
• Monotone invariant clustering procedures
• Min and max hierarchical clustering using asymmetric similarity measures
• On the determination of redundancies in sociometric chains
• Identification of the Liaison Persons of an Organization Using the Structure Matrix
• Approximate Evaluation Techniques for the Single-Link and Complete-Link Hierarchical Clustering Procedures
• A Probability Theory of Cluster Analysis
• SPANNING TREES AND ASPECTS OF CLUSTERING
• The Classification of a Set of Elements with Respect to a Set of Properties
• A correction to: On the algebraic theory of graph colorings
• The Construction of Hierarchic and Non-Hierarchic Classifications
• An improved algorithm for the Jardine-Sibson method of generating overlapping clusters
• An Analysis of Some Graph Theoretical Cluster Techniques
• Some observations on a paper by Lance and Williams
• Classification of a set of elements
• Controversy concerning the criteria for taxonometric strategies
• k-Components, Clusters and Slicings in Graphs
• Corrections to Bierstone's Algorithm for Generating Cliques
• On the theory and construction of k-clusters
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
• On Some Clustering Techniques
• Two Decomposition Theorems for a Class of Finite Oriented Graphs
• Networks Satisfying Minimality Conditions

This page was built for publication: Some applications of graph theory to clustering