SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 1902.11266 · 2019

Efficient Parameter-free Clustering Using First Neighbor Relations

arXiv · PDF · Open in the Atlas

Code that ran

2 of 2 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 2 failures of our instrument; 0 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/1902.11266.json · badge: /api/ran/1902.11266.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
ssarfraz/FINCH-CLustering canonical (classifier label)
classifier basis: classifier_2025
2 ran · 0 no recorded run
FunctionStatusWhere it lives
cool_mean Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
ssarfraz/FINCH-CLustering/finch/finch.py
code served (permissive licence) · get_code("c34d92475d1ffdbc")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned ndarray, ndim 2, dtype family float, shape (3, 4) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import numpy as np
import scipy.sparse as sp

# Set random seed for reproducibility
np.random.seed(0)

# Create sample data
# data: (n, f) matrix with n data points of f features each
n = 6  # number of data points
f = 4  # number of features
data = np.random.randn(n, f).astype('float32')

# Create partition u: (n,) array with k different integer values
# Using 3 different partition classes (0, 1, 2)
u = np.array([0, 1, 2, 0, 1, 2], dtype=int)

ARGS = {
    'data': data,
    'u': u,
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1
Imports
numpy, scipy — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type ndarray, ndim 2, dtype family float, shape (3, 4) — shape (3, 4) as a later run recorded it
dtype family
int means an integer dtype; float means any other dtype the instrument saw, bool and complex included (fixture_check.py records only these two families)
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
get_clust Ran
ran; our contract draft was wrong, not the code
ssarfraz/FINCH-CLustering/finch/finch.py
code served (permissive licence) · get_code("a13645c6a637da8d")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned tuple. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import numpy as np
import scipy.sparse as sp

# Create a small sparse matrix for 'a' parameter
# The function calls a.toarray() and uses it with sp.csgraph.connected_components
# Create a 4x4 sparse adjacency matrix
a = sp.csr_matrix(np.array([
    [0, 1, 0, 0],
    [1, 0, 1, 0],
    [0, 1, 0, 1],
    [0, 0, 1, 0]
], dtype=float))

# Create orig_dist - a sparse matrix of same shape as 'a'
# Used in: orig_dist * a.toarray() when min_sim is not None
orig_dist = sp.csr_matrix(np.array([
    [0.0, 0.5, 0.0, 0.0],
    [0.5, 0.0, 0.7, 0.0],
    [0.0, 0.7, 0.0, 0.9],
    [0.0, 0.0, 0.9, 0.0]
], dtype=float))

# min_sim parameter - can be None or a float value
min_sim = 0.6

ARGS = {
    'a': a,
    'orig_dist': orig_dist,
    'min_sim': min_sim
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1
Imports
numpy, scipy — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type tuple — a tuple output has no array shape of its own; none is stated
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block

Also present in other papers' code

Of 2 samples lifted from this paper's linked repositories, 2 carry a function identity and 0 do not. Of the 2 distinct functions with an identity, 2 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 2 later) and 0 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

FunctionAlso present inEarliest-datedOthers named
get_clust 2 other papers
2 later
2103.11264 (2021-03)
Temporally-Weighted Hierarchical Clustering for Unsupervised Action Segmentation
2506.22427 (2025-06)
CLoVE: Personalized Federated Learning through Clustering of Loss Vector Embeddings
cool_mean 1 other paper
1 later
2506.22427 (2025-06)
CLoVE: Personalized Federated Learning through Clustering of Loss Vector Embeddings

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

We present a new clustering method in the form of a single clustering equation that is able to directly discover groupings in the data. The main proposition is that the first neighbor of each sample is all one needs to discover large chains and finding the groups in the data. In contrast to most existing clustering algorithms our method does not require any hyper-parameters, distance thresholds and/or the need to specify the number of clusters. The proposed algorithm belongs to the family of hierarchical agglomerative methods. The technique has a very low computational overhead, is easily scalable and applicable to large practical problems. Evaluation on well known datasets from different domains ranging between 1077 and 8.1 million samples shows substantial performance gains when compared to the existing clustering techniques.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("1902.11266")
get_code_for_paper("1902.11266")
have("1902.11266")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/1902.11266.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/1902.11266.svg)](https://syntology.ai/paper/1902.11266)

Connect an agent — have() is free.