On the public citation graph

Algorithm 30 L1 cluster analysis

https://doi.org/10.1007/bf02252086
0 signed · 13 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/bf02252907openalex-snapshot
Clustering of one-dimensional ordered data
inferredcites →https://doi.org/10.1016/0025-5564(76)90077-8openalex-snapshot
Cluster-Analyse-Algorithmen zur Objektklassifizierung und Datenreduktion
inferredcites →https://doi.org/10.2307/2346321openalex-snapshot
Algorithm AS 58: Euclidean Cluster Analysis

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-37826-4_5openalex-snapshot
Heuristic Clustering Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-76512-4_5openalex-snapshot
Heuristic Clustering Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-0348-5997-4_15openalex-snapshot
Klassenweise Diskrete Approximation
inferred← citeshttps://doi.org/10.1007/978-3-319-09259-1_3openalex-snapshot
Linear, Deterministic, and Order-Invariant Initialization Methods for the K-Means Clustering Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-57991-2_29openalex-snapshot
Clustering Algorithms and Cluster Validation
inferred← citeshttps://doi.org/10.1007/bf01719499openalex-snapshot
Clusteranalyse — Überblick und neuere Entwicklungen
inferred← citeshttps://doi.org/10.1007/bf01720100openalex-snapshot
The minisum location problem for the Jaccard metric
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00208-4openalex-snapshot
Minimization subproblems and heuristics for an applied clustering problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(77)81005-9openalex-snapshot
Computational experiences with the exchange method
inferred← citeshttps://doi.org/10.2478/amcs-2014-0012openalex-snapshot
Center-based l1–clustering method
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.