On the public citation graph

Ultrametric tree representations of incomplete dissimilarity data

https://doi.org/10.1007/bf01890124
0 signed · 49 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01593790openalex-snapshot
Restart procedures for the conjugate gradient method
inferredcites →https://doi.org/10.1007/bf01890116openalex-snapshot
The representation of three-way proximity data by single and multiple tree structure models
inferredcites →https://doi.org/10.1007/bf02289588openalex-snapshot
Hierarchical Clustering Schemes
inferredcites →https://doi.org/10.1007/bf02293884openalex-snapshot
A Least Squares Algorithm for Fitting Additive Trees to Proximity Data
inferredcites →https://doi.org/10.1007/bf02294012openalex-snapshot
Indclus: An Individual differences Generalization of the Adclus Model and the Mapclus Algorithm
inferredcites →https://doi.org/10.1007/bf02294077openalex-snapshot
MACPLUS: A Mathematical Programming Approach to Fitting the ADCLUS Model
inferredcites →https://doi.org/10.1007/bf02306021openalex-snapshot
The Estimation of Ultrametric and Path Length Trees from Rectangular Proximity Data
inferredcites →https://doi.org/10.1016/0025-5564(67)90032-6openalex-snapshot
The structure and construction of taxonomic hierarchies
inferredcites →https://doi.org/10.1016/0167-8655(84)90036-9openalex-snapshot
A least squares algorithm for fitting an ultrametric tree to a dissimilarity matrix
inferredcites →https://doi.org/10.1080/00401706.1978.10489684openalex-snapshot
Applications of Statistics
inferredcites →https://doi.org/10.1080/01621459.1967.10500922openalex-snapshot
Representation of Similarity Matrices by Trees
inferredcites →https://doi.org/10.2307/2346526openalex-snapshot
Clustering Algorithms.
inferredcites →https://doi.org/10.2307/3151168openalex-snapshot
Mathematical Taxonomy

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780470977811.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/3-540-26981-9_8openalex-snapshot
An Exchange Algorithm for Two-Mode Cluster Analysis
inferred← citeshttps://doi.org/10.1007/3-540-28397-8_17openalex-snapshot
On the Performance of Algorithms for Two-Mode Hierarchical Cluster Analysis — Results from a Monte Carlo Simulation Study
inferred← citeshttps://doi.org/10.1007/978-1-4020-2330-9_5openalex-snapshot
Everything You always wanted to Know about the Average Consensus, and More
inferred← citeshttps://doi.org/10.1007/978-3-642-46757-8_12openalex-snapshot
The MVL (Missing Values Linkage) Approach for Hierarchical Classification when Data are Incomplete
inferred← citeshttps://doi.org/10.1007/978-3-642-55991-4_43openalex-snapshot
Goodness-of-Fit Measures for Two-mode Cluster Analyses
inferred← citeshttps://doi.org/10.1007/978-3-642-58250-9_11openalex-snapshot
Least-Squares Ultrametric Tree Representations of Three- Way One-Mode Proximity Data
inferred← citeshttps://doi.org/10.1007/978-3-642-59051-1_63openalex-snapshot
Two-Mode Classification in Advertising Research
inferred← citeshttps://doi.org/10.1007/978-3-642-59789-3_23openalex-snapshot
Estimating Missing Values in a Tree Distance
inferred← citeshttps://doi.org/10.1007/978-3-642-71161-9_68openalex-snapshot
Minimal Verformte Hierarchische Clusterformationen
inferred← citeshttps://doi.org/10.1007/978-3-642-80098-6_2openalex-snapshot
A New Algorithm for Two-Mode Clustering
inferred← citeshttps://doi.org/10.1007/bf01195677openalex-snapshot
Pyramidal classification based on incomplete dissimilarity data
inferred← citeshttps://doi.org/10.1007/bf01896984openalex-snapshot
Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data
inferred← citeshttps://doi.org/10.1007/bf01908074openalex-snapshot
Optimal variable weighting for hierarchical clustering: An alternating least-squares algorithm
inferred← citeshttps://doi.org/10.1007/bf02614317openalex-snapshot
Cluster analysis and mathematical programming
inferred← citeshttps://doi.org/10.1007/bf02616238openalex-snapshot
The generation of random ultrametric matrices representing dendrograms
inferred← citeshttps://doi.org/10.1007/bf02626093openalex-snapshot
Constructing optimal ultrametrics
inferred← citeshttps://doi.org/10.1007/s00357-017-9245-7openalex-snapshot
Editorial
inferred← citeshttps://doi.org/10.1007/s11538-013-9815-8openalex-snapshot
Lassoing and Corralling Rooted Phylogenetic Trees
inferred← citeshttps://doi.org/10.1016/0167-9473(96)88919-5openalex-snapshot
Probabilistic models in cluster analysis
inferred← citeshttps://doi.org/10.1016/s0167-8655(01)00115-5openalex-snapshot
Clustering incomplete relational data using the non-Euclidean relational fuzzy c-means algorithm
inferred← citeshttps://doi.org/10.1016/s1055-7903(02)00415-3openalex-snapshot
Incomplete distance matrices, supertrees and bat phylogeny
inferred← citeshttps://doi.org/10.1038/s41598-021-98550-3openalex-snapshot
Environment and culture shape both the colour lexicon and the genetics of colour perception
inferred← citeshttps://doi.org/10.1093/bioinformatics/btp015openalex-snapshot
A hierarchical model for incomplete alignments in phylogenetic inference
inferred← citeshttps://doi.org/10.1093/molbev/msv027openalex-snapshot
Reconstructing (Super)Trees from Data Sets with Missing Distances: Not All Is Lost
inferred← citeshttps://doi.org/10.1101/2024.11.29.625936openalex-snapshot
Bayesian Least-Squares Supertrees (BLeSS): Flexible Inference of Large Time-Calibrated Phylogenies
inferred← citeshttps://doi.org/10.1109/icdm.2011.130openalex-snapshot
Semi-supervised Hierarchical Clustering
inferred← citeshttps://doi.org/10.1137/130927644openalex-snapshot
Distinguished Minimal Topological Lassos
inferred← citeshttps://doi.org/10.1177/002224379703400201openalex-snapshot
Psychometric Methods in Marketing Research: Part II, Multidimensional Scaling
inferred← citeshttps://doi.org/10.1186/1471-2105-9-166openalex-snapshot
Fast NJ-like algorithms to deal with incomplete distance matrices
inferred← citeshttps://doi.org/10.1186/1471-2148-8-95openalex-snapshot
Using ESTs for phylogenomics: can one accurately infer a phylogenetic tree from a gappy alignment?
inferred← citeshttps://doi.org/10.1186/1748-7188-8-7openalex-snapshot
Ultrametric networks: a new tool for phylogenetic analysis
inferred← citeshttps://doi.org/10.25148/etd.fi14071146openalex-snapshot
Towards Next Generation Vertical Search Engines
inferred← citeshttps://doi.org/10.32614/cran.package.clueopenalex-snapshot
clue: Cluster Ensembles
inferred← citeshttps://doi.org/10.3758/bf03200842openalex-snapshot
Computer programs for fitting ultrametric and additive trees to proximity data by least squares methods
inferred← citeshttps://doi.org/10.4000/msh.2790openalex-snapshot
Approximation par arbres d'une distance partielle
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.