Some applications of graph theory to clustering
From MaRDI portal
(Redirected from Publication:1222008)
Cites work
- k-Components, Clusters and Slicings in Graphs
- A correction to: On the algebraic theory of graph colorings
- A graph theoretic approach to similarity relations
- A metric and an ordering on sets
- A Probability Theory of Cluster Analysis
- An Analysis of Some Graph Theoretical Cluster Techniques
- An improved algorithm for the Jardine-Sibson method of generating overlapping clusters
- Approximate Evaluation Techniques for the Single-Link and Complete-Link Hierarchical Clustering Procedures
- Classification of a set of elements
- Controversy concerning the criteria for taxonometric strategies
- Corrections to Bierstone's Algorithm for Generating Cliques
- Data analysis and the connectivity of random graphs
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
- Hierarchical clustering schemes
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3795195 (Why is no real title available?)
- scientific article; zbMATH DE number 3226832 (Why is no real title available?)
- scientific article; zbMATH DE number 3235858 (Why is no real title available?)
- scientific article; zbMATH DE number 3318279 (Why is no real title available?)
- scientific article; zbMATH DE number 3351630 (Why is no real title available?)
- scientific article; zbMATH DE number 3358495 (Why is no real title available?)
- scientific article; zbMATH DE number 3404264 (Why is no real title available?)
- scientific article; zbMATH DE number 3198644 (Why is no real title available?)
- Identification of the liaison persons of an organization using the structure matrix
- Metrics on spaces of finite trees
- Min and max hierarchical clustering using asymmetric similarity measures
- Monotone invariant clustering procedures
- Networks Satisfying Minimality Conditions
- On Some Clustering Techniques
- On the determination of redundancies in sociometric chains
- On the shortest spanning subtree of a graph and the traveling salesman problem
- On the theory and construction of k-clusters
- Some extensions of Johnson's hierarchical clustering algorithms
- Some observations on a paper by Lance and Williams
- SPANNING TREES AND ASPECTS OF CLUSTERING
- The Classification of a Set of Elements with Respect to a Set of Properties
- The Construction of Hierarchic and Non-Hierarchic Classifications
- Two Decomposition Theorems for a Class of Finite Oriented Graphs
Cited in
(40)- A stratificational overlapping cluster scheme
- Preservation of global order equivalence
- Clusteranalyse - Überblick und neuere Entwicklungen
- The median procedure in cluster analysis and social choice theory
- 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
- Validity of clusters formed by graph-theoretic cluster methods
- Classification and specification of flat cluster methods
- Some aspects of qualitative data analysis
- Fixed points approach to clustering
- Constructing optimal ultrametrics
- Cluster analysis and mathematical programming
- Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices
- Consistency in ordinal data analysis. I.
- Induced \(H\)-packing \(k\)-partition problem in certain carbon based nanostructures
- Induced \(H\)-packing \(k\)-partition number for certain nanotubes and chemical graphs
- Ising formulations of some graph-theoretic problems in psychological research: models and methods
- Attribute hierarchy models in cognitive diagnosis: identifiability of the latent attribute space and conditions for completeness of the Q-matrix
- Compatibility in a graph-theoretic setting
- ConPar: a method for identifying groups of concordant subject proximity matrices for subsequent multidimensional scaling analyses
- Metaheuristics for the minimum gap graph partitioning problem
- The Approximation of Arbitrary Clustering Functions by Clustering Functions which Satisfy Overlapping Criteria
- Some Aspects of Clustering Functions
- A Learning Algorithm for the Optimum-Path Forest Classifier
- COBLOC: A hierarchical method for blocking network data
- Structural models with qualitative values
- Clustering representations of group overlap†
- Clique analysis of a tolerance relation
- GENERALIZED INFORMATION THEORY AND DECOMPOSABILITY OF SYSTEMS
- Identifying genuine clusters in a classification
- Validity studies in clustering methodologies
- Typed topology and its application to data sets
- Integer programming in psychology: a review and directions for future research
- Generalized graph energies of a regular graph under vertex duplication operation
- Clique optimization: A method to construct parsimonious ultrametric trees from similarity data
- A constrained \(k\)-means clustering algorithm for classifying spatial units
This page was built for publication: Some applications of graph theory to clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1222008)
