Extended similarity trees
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3829059 (Why is no real title available?)
- scientific article; zbMATH DE number 3504320 (Why is no real title available?)
- scientific article; zbMATH DE number 3448387 (Why is no real title available?)
- A metric and an ordering on sets
- Analytic inversion of the five-point Poisson operator
- Free trees and bidirectional trees as representations of psychological distance
- Hierarchical clustering schemes
- MAPCLUS: A mathematical programming approach to fitting the ADCLUS model
- Spatial versus tree representations of proximity data
Cited in
(12)- Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
- A constructive algorithm for realizing a distance matrix
- Mixtures of (constrained) ultrametric trees
- Exploring the set-theoretical structure of objects by additive trees
- Pairwise partitioning: A nonmetric algorithm for identifying feature-based similarity structures
- Ordinal network representation: Representing proximities by graphs
- A user-oriented overview of multiway methods and software
- A parametric procedure for ultrametric tree estimation from conditional rank order proximity data
- TSCALE: A new multidimensional scaling procedure based on Tversky's contrast model
- A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees
- Variations on a tree
- Latent Features in Similarity Judgments: A Nonparametric Bayesian Approach
This page was built for publication: Extended similarity trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1082753)
