Combinatorial optimisation and hierarchical classifications
From MaRDI portal
Publication:2480261
DOI10.1007/s10479-007-0174-4zbMath1157.90501OpenAlexW2069281014MaRDI QIDQ2480261
Jean-Pierre Barthelemy, Christophe Osswald, François Brucker
Publication date: 31 March 2008
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-007-0174-4
complexityhierarchical classificationclustering algorithmsquasi-hierarchiesrigid hypergraphssubdominant
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Quadratic programming (90C20) Combinatorial optimization (90C27)
Related Items (2)
Clustering of high throughput gene expression data ⋮ A 16-competitive algorithm for hierarchical median problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Circular representation problem on hypergraphs
- Binary clustering
- NP-hard problems in hierarchical-tree clustering
- Weak hierarchies associated with similarity measures - An additive clustering technique
- Continuous L-cluster methods
- Spatial, non-spatial and hybrid models for scaling
- Hypergraphes arbores
- Classification and dissimilarity analysis
- An order theoretic framework for overlapping clustering
- Cluster analysis and mathematical programming
- Recognition of Robinsonian dissimilarities
- NP-hard approximation problems in overlapping clustering.
- Set systems and dissimilarities
- Approximating dissimilarities by quasi-ultrametrics
- \(l_\infty\)-approximation via subdominants.
- Combinatorial optimization and hierarchical classifications
- From hypertrees to arboreal quasi-ultrametrics
- The \(k\)-weak hierarchical representations: An extension of the indexed closed weak hierarchies
- Hierarchical clustering schemes
- Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices
- Les isomorphismes HTS et HTE. (The HTS and HTE isomorphisms)
- Sub-dominant theory in numerical taxonomy
- The structure and construction of taxonomic hierarchies
- Symmetric binary B-trees: Data structure and maintenance algorithms
- Space-conserving agglomerative algorithms
- Monotone Equivariant Cluster Methods
- Construction de l'ultramétrique la plus proche d'une dissimilarité au sens des moindres carrés
- Tree structures for proximity data
- An Order Theoretic Model for Cluster Analysis
- Linear and circular unidimensional scaling for symmetric proximity matrices
- Some observations on a paper by Lance and Williams
- Sur la liaison et la division des points d'un ensemble fini
This page was built for publication: Combinatorial optimisation and hierarchical classifications
