A survey of constrained classification

DOI10.1016/0167-9473(95)00005-4zbMath0900.62313OpenAlexW2033836270MaRDI QIDQ1351841

O. Diekmann

Publication date: 27 February 1997

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-9473(95)00005-4

zbMATH Keywords

ClassificationComputational geometryModel selectionCluster validationContiguity constraintsIndividual differences modelsMembership constraintsParsimonious trees

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Related Items

An overview of graph covering and partitioning, Comparison to two ascendant hierarchical classification criteria under a contiguity constraint. Application to image processing, Tail index partition-based rules extraction with application to tornado damage insurance, CECM: constrained evidential \(C\)-means algorithm, Summarizing numeric spatial data streams by trend cluster discovery, ClustGeo: an R package for hierarchical clustering with spatial constraints, Applicability and interpretability of Ward's hierarchical agglomerative clustering with or without contiguity constraints, A constrained \(k\)-means clustering algorithm for classifying spatial units, A fuzzy clustering model for multivariate spatial time series

Uses Software

• MAPCLUS
• Indclus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constrained classification: The use of a priori information in cluster analysis
• Some types of clustering with relational constraints
• Clique optimization: A method to construct parsimonious ultrametric trees from similarity data
• The representation of three-way proximity data by single and multiple tree structure models
• Clustering with relational constraint
• Parsimonious trees
• Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data
• The relative neighbourhood graph of a finite planar set
• Graph theoretical clustering based on limited neighbourhood sets
• On Grouping for Maximum Homogeneity
• A study of edge detection algorithms
• Conditional Clustering
• Combinatorial Solution to the Partitioning of General Graphs
• The Optimal Partitioning of Graphs
• Picture Segmentation by a Tree Traversal Algorithm
• Shape averages and their Bias
• On the History of the Minimum Spanning Tree Problem
• Spatial Clustering: Using Simple Summaries of Seismic Data to Find the Edge of an Oil-Field