On the public citation graph

Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data

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/bf00227594openalex-snapshot
Additive-tree representations of incomplete dissimilarity data
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/bf01890124openalex-snapshot
Ultrametric tree representations of incomplete dissimilarity data
inferredcites →https://doi.org/10.1007/bf01908074openalex-snapshot
Optimal variable weighting for hierarchical clustering: An alternating least-squares algorithm
inferredcites →https://doi.org/10.1007/bf02293706openalex-snapshot
Clustering with Relational Constraint
inferredcites →https://doi.org/10.1007/bf02293878openalex-snapshot
Some Types of Clustering with Relational Constraints
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/bf02294172openalex-snapshot
Constrained Classification: The use of a Priori Information in Cluster Analysis
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/0010-0285(80)90020-1openalex-snapshot
Organization revealed by recall orders and confirmed by pauses
inferredcites →https://doi.org/10.1016/0022-2496(81)90060-2openalex-snapshot
A heuristic method for the comparison of related structures
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.1038/233604a0openalex-snapshot
Molecular Evolution in the Descent of Man
inferredcites →https://doi.org/10.1051/ro/1980140201571openalex-snapshot
Construction de l'ultramétrique la plus proche d'une dissimilarité au sens des moindres carrés
inferredcites →https://doi.org/10.1093/comjnl/12.3.207-aopenalex-snapshot
Nonlinear Programming--Sequential Unconstrained Minimization Techniques
inferredcites →https://doi.org/10.1093/comjnl/9.4.373openalex-snapshot
A General Theory of Classificatory Sorting Strategies: 1. Hierarchical Systems
inferredcites →https://doi.org/10.1111/j.1365-2389.1972.tb01654.xopenalex-snapshot
COMPUTER‐BASED SOIL MAPPING OF SMALL AREAS FROM SAMPLE DATA
inferredcites →https://doi.org/10.1111/j.1365-2389.1972.tb01655.xopenalex-snapshot
COMPUTER‐BASED SOIL MAPPING OF SMALL AREAS FROM SAMPLE DATA
inferredcites →https://doi.org/10.1136/bmj.282.6269.1077-copenalex-snapshot
Health services research
inferredcites →https://doi.org/10.1137/1.9781611971217openalex-snapshot
Solving Least Squares Problems
inferredcites →https://doi.org/10.1145/361532.361543openalex-snapshot
Political redistricting by computer
inferredcites →https://doi.org/10.1177/002224377801500303openalex-snapshot
An Approach to Normative Segmentation
inferredcites →https://doi.org/10.1525/aa.1964.66.3.02a00870openalex-snapshot
Cognitive Aspects of English Kin Terms
inferredcites →https://doi.org/10.2307/2005340openalex-snapshot
Solving Least Squares Problems
inferredcites →https://doi.org/10.2307/2529148openalex-snapshot
359. Note: Classification in the Presence of Constraints
inferredcites →https://doi.org/10.2307/2530494openalex-snapshot
Conditional Clustering

What points at this work

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

inferred← citeshttps://doi.org/10.1002/asm.3150040306openalex-snapshot
A new stochastic ultrametric tree unfolding methodology for assessing competitive market structure and deriving market segments
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-70880-0_7openalex-snapshot
Constrained Clustering
inferred← citeshttps://doi.org/10.1007/978-3-642-79999-0_1openalex-snapshot
Advances in Cluster Analysis Relevant to Marketing Research
inferred← citeshttps://doi.org/10.1007/978-4-431-65950-1_2openalex-snapshot
Cluster Validation
inferred← citeshttps://doi.org/10.1007/bf01202270openalex-snapshot
An efficient algorithm for supertrees
inferred← citeshttps://doi.org/10.1007/bf01202585openalex-snapshot
A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance
inferred← citeshttps://doi.org/10.1007/bf01889702openalex-snapshot
Clique optimization: A method to construct parsimonious ultrametric trees from similarity data
inferred← citeshttps://doi.org/10.1007/bf02294429openalex-snapshot
A Parametric Procedure for Ultrametric Tree Estimation from Conditional Rank Order Proximity Data
inferred← citeshttps://doi.org/10.1007/bf02294491openalex-snapshot
Was Euclid an Unnecessarily Sophisticated Psychologist?
inferred← citeshttps://doi.org/10.1007/s00357-012-9117-0openalex-snapshot
J. Douglas Carroll 1939–2011
inferred← citeshttps://doi.org/10.1007/s00357-017-9245-7openalex-snapshot
Editorial
inferred← citeshttps://doi.org/10.1007/s10651-006-0017-5openalex-snapshot
Spatially constrained clustering and upper level set scan hotspot detection in surveillance geoinformatics
inferred← citeshttps://doi.org/10.1007/s10994-021-06125-0openalex-snapshot
Order preserving hierarchical agglomerative clustering
inferred← citeshttps://doi.org/10.1007/s11336-012-9289-xopenalex-snapshot
In memoriam, J. Douglas Carroll
inferred← citeshttps://doi.org/10.1016/0167-9473(95)00005-4openalex-snapshot
A survey of constrained classification
inferred← citeshttps://doi.org/10.1016/0167-9473(96)88919-5openalex-snapshot
Probabilistic models in cluster analysis
inferred← citeshttps://doi.org/10.1016/b978-0-444-53868-0.50018-6openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80028-3openalex-snapshot
Chapter 5 Non-spatial tree models for the assessment of competitive market structure: An integrated review of the marketing and psychometric literature
inferred← citeshttps://doi.org/10.1080/00049539408259468openalex-snapshot
The effect of change of context in Coombs' unfolding theory
inferred← citeshttps://doi.org/10.1177/002224379002700404openalex-snapshot
Sculptre: A New Methodology for Deriving and Analyzing Hierarchical Product-Market Structures from Panel Data
inferred← citeshttps://doi.org/10.18637/jss.v103.i07openalex-snapshot
Hierarchical Clustering with Contiguity Constraint in R
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.