Pages that link to "Item:Q1222008"
From MaRDI portal
The following pages link to Some applications of graph theory to clustering (Q1222008):
Displayed 38 items.
- Validity studies in clustering methodologies (Q600195) (← links)
- Clique optimization: A method to construct parsimonious ultrametric trees from similarity data (Q923556) (← links)
- A constrained \(k\)-means clustering algorithm for classifying spatial units (Q998906) (← links)
- A stratificational overlapping cluster scheme (Q1063980) (← links)
- Preservation of global order equivalence (Q1137969) (← links)
- Clusteranalyse - Überblick und neuere Entwicklungen (Q1144342) (← links)
- The median procedure in cluster analysis and social choice theory (Q1164937) (← links)
- Data analysis implications of some concepts related to the cuts of a graph (Q1237024) (← links)
- Nonmetric grouping: clusters and cliques (Q1237490) (← links)
- A set-theoretical approach to the problem of hierarchical clustering (Q1238382) (← links)
- Constructing blockmodels: how and why (Q1245783) (← links)
- Survey sampling in graphs (Q1247131) (← links)
- Feature definition in pattern recognition with small sample size (Q1247178) (← links)
- Validity of clusters formed by graph-theoretic cluster methods (Q1251676) (← links)
- Classification and specification of flat cluster methods (Q1255281) (← links)
- Some aspects of qualitative data analysis (Q1310604) (← links)
- Fixed points approach to clustering (Q1314827) (← links)
- Constructing optimal ultrametrics (Q1314829) (← links)
- Cluster analysis and mathematical programming (Q1365055) (← links)
- Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices (Q1775813) (← links)
- Consistency in ordinal data analysis. I. (Q1867802) (← links)
- Induced \(H\)-packing \(k\)-partition problem in certain carbon based nanostructures (Q2038934) (← links)
- Induced \(H\)-packing \(k\)-partition number for certain nanotubes and chemical graphs (Q2184362) (← links)
- Ising formulations of some graph-theoretic problems in psychological research: models and methods (Q2244634) (← links)
- Attribute hierarchy models in cognitive diagnosis: identifiability of the latent attribute space and conditions for completeness of the Q-matrix (Q2304089) (← links)
- Compatibility in a graph-theoretic setting (Q2367164) (← links)
- ConPar: a method for identifying groups of concordant subject proximity matrices for subsequent multidimensional scaling analyses (Q2483823) (← links)
- Metaheuristics for the minimum gap graph partitioning problem (Q2668747) (← links)
- The Approximation of Arbitrary Clustering Functions by Clustering Functions which Satisfy Overlapping Criteria (Q3223718) (← links)
- Some Aspects of Clustering Functions (Q3317918) (← links)
- A Learning Algorithm for the Optimum-Path Forest Classifier (Q3637701) (← links)
- COBLOC: A hierarchical method for blocking network data (Q3920488) (← links)
- Structural models with qualitative values (Q3946204) (← links)
- Clustering representations of group overlap† (Q4120401) (← links)
- Clique analysis of a tolerance relation (Q4168940) (← links)
- GENERALIZED INFORMATION THEORY AND DECOMPOSABILITY OF SYSTEMS (Q4740472) (← links)
- Identifying genuine clusters in a classification (Q5917672) (← links)
- Typed topology and its application to data sets (Q6142708) (← links)