On the public citation graph

Graph-Theoretic Representations for Proximity Matrices Through Strongly-Anti-Robinson or Circular Strongly-Anti-Robinson Matrices

0 signed · 38 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/978-1-4612-2686-4_2openalex-snapshot

The partial order by inclusion of the principal classes of dissimilarity on a finite set, and some of their basic properties

inferredcites →https://doi.org/10.1007/978-1-4612-2686-4_7openalex-snapshot

On exchangeability-based equivalence relations induced by strongly Robinson and, in particular, by quadripolar Robinson dissimilarity matrices

inferredcites →https://doi.org/10.1007/978-1-4613-0457-9openalex-snapshot

Mathematical Classification and Clustering

inferredcites →https://doi.org/10.1007/bf01908715openalex-snapshot

A sequential fitting procedure for linear data analysis models

inferredcites →https://doi.org/10.1007/bf02296969openalex-snapshot

Spatial, Non-Spatial and Hybrid Models for Scaling

inferredcites →https://doi.org/10.1007/bf02477861openalex-snapshot

Mathematical thinking in the social sciences

inferredcites →https://doi.org/10.1016/0010-0285(75)90006-7openalex-snapshot

The internal representation of numbers

inferredcites →https://doi.org/10.1016/0377-2217(89)90016-7openalex-snapshot

Classification and related methods of data analysis

inferredcites →https://doi.org/10.1016/b978-0-12-215485-0.50017-xopenalex-snapshot

TECHNIQUES OF APPROXIMATION FOR BUILDING TWO TREE STRUCTURES

inferredcites →https://doi.org/10.1038/sj.jors.2600836openalex-snapshot

Mathematical Classification and Clustering

inferredcites →https://doi.org/10.1080/01621459.1983.10477029openalex-snapshot

An Algorithm for Restricted Least Squares Regression

inferredcites →https://doi.org/10.1111/j.2044-8317.1994.tb01023.xopenalex-snapshot

The analysis of proximity matrices through sums of matrices having (anti‐)Robinson forms

inferredcites →https://doi.org/10.1111/j.2044-8317.1995.tb01065.xopenalex-snapshot

Iterative projection strategies for the least‐squares fitting of tree structures to proximity data

inferredcites →https://doi.org/10.1111/j.2044-8317.1997.tb01145.xopenalex-snapshot

Linear and circular unidimensional scaling for symmetric proximity matrices

inferredcites →https://doi.org/10.2307/2287021openalex-snapshot

Classification and Clustering.

inferredcites →https://doi.org/10.2307/2532766openalex-snapshot

Trees and Proximity Representations.

inferredcites →https://doi.org/10.2307/276978openalex-snapshot

A Method for Chronologically Ordering Archaeological Deposits

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470583333.ch3openalex-snapshot

Order‐Constrained Proximity Matrix Representations: Ultrametric Generalizations and Constructions with MATLAB

inferred← citeshttps://doi.org/10.1007/978-0-387-28692-1_4openalex-snapshot

Multidimensional Scaling and Clustering in Marketing: Paul Green’s Role

inferred← citeshttps://doi.org/10.1007/bf02294996openalex-snapshot

A Branch-and-Bound Algorithm for Fitting Anti-Robinson Structures to Symmetric Dissimilarity Matrices

inferred← citeshttps://doi.org/10.1007/s00357-009-9033-0openalex-snapshot

Structural Classification Analysis of Three-Way Dissimilarity Data

inferred← citeshttps://doi.org/10.1007/s10288-004-0051-9openalex-snapshot

Combinatorial optimization and hierarchical classifications

inferred← citeshttps://doi.org/10.1007/s10479-007-0174-4openalex-snapshot

Combinatorial optimisation and hierarchical classifications

inferred← citeshttps://doi.org/10.1007/s11075-022-01461-1openalex-snapshot

The seriation problem in the presence of a double Fiedler value

inferred← citeshttps://doi.org/10.1007/s11336-002-1032-6openalex-snapshot

Optimal Least-Squares Unidimensional Scaling: Improved Branch-and-Bound Procedures and Comparison to Dynamic Programming

inferred← citeshttps://doi.org/10.1007/s11336-007-9003-6openalex-snapshot

L. Hubert, P. Arabie, & J. Meulman (2006). The structural representation of proximity matrices with MATLAB. Philadelphia: SIAM. xvi+214 pp. US$79.00. ISBN 0898716071.

inferred← citeshttps://doi.org/10.1007/s11336-007-9049-5openalex-snapshot

Heuristic Implementation of Dynamic Programming for Matrix Permutation Problems in Combinatorial Data Analysis

inferred← citeshttps://doi.org/10.1007/s11634-009-0042-yopenalex-snapshot

On Robinsonian dissimilarities, the consecutive ones property and latent variable models

inferred← citeshttps://doi.org/10.1016/j.csda.2010.03.012openalex-snapshot

Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition

inferred← citeshttps://doi.org/10.1016/j.patcog.2019.107192openalex-snapshot

Circular object arrangement using spherical embeddings

inferred← citeshttps://doi.org/10.1109/aiccsa.2009.5069325openalex-snapshot

Possibilistic ordination-based analysis of an imperfect database

inferred← citeshttps://doi.org/10.1137/21m139356xopenalex-snapshot

An Optimal Algorithm for Strict Circular Seriation

inferred← citeshttps://doi.org/10.1137/22m1494348openalex-snapshot

Modules in Robinson Spaces

inferred← citeshttps://doi.org/10.1137/22m1495342openalex-snapshot

A Simple and Optimal Algorithm for Strict Circular Seriation

inferred← citeshttps://doi.org/10.1348/000711006x107872openalex-snapshot

An algorithm for extracting maximum cardinality subsets with perfect dominance or anti‐Robinson structures

inferred← citeshttps://doi.org/10.4018/978-1-93070-825-9openalex-snapshot

Data Mining

inferred← citeshttps://doi.org/10.4018/978-1-930708-25-9.ch012openalex-snapshot

aiNet

inferred← citeshttps://doi.org/10.47749/t/unicamp.2001.206650openalex-snapshot

Engenharia imunologica

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.