SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 1904.02749 · 2019

Learning to Cluster Faces on an Affinity Graph

arXiv · PDF · Open in the Atlas

Code that ran

2 of 3 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, 1 violated it and 0 have no contract verdict; 1 failure of our instrument; 1 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/1904.02749.json · badge: /api/ran/1904.02749.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
copy not recorded community
not in the paper's declared repositories
2 ran · 1 no recorded run
FunctionStatusWhere it lives
l2norm Ran
ran, violated the contract we drafted
this paper's copy was not recorded; identical code first harvested from xiaoxiong74/face-cluster-by-infomap
pointer only; the stored copy get_code serves, from xiaoxiong74/face-cluster-by-infomap, is pointer only (licence: NONE) · get_code("9e5b9ebb30a1dab5")
How it ran

The body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

read_meta Ran
ran; our contract draft was wrong, not the code
this paper's copy was not recorded; identical code first harvested from xiaoxiong74/face-cluster-by-infomap
pointer only; the stored copy get_code serves, from xiaoxiong74/face-cluster-by-infomap, is pointer only (licence: NONE) · get_code("b91ea1291400178a")
How it ran

The body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

intdict2ndarray Not yet run
unverified (harvested, no recorded run)
this paper's copy was not recorded; identical code first harvested from xiaoxiong74/face-cluster-by-infomap
pointer only; the stored copy get_code serves, from xiaoxiong74/face-cluster-by-infomap, is pointer only (licence: NONE) · get_code("7fd66383242447ba")
How it ran

The body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

Also present in other papers' code

Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 3 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 3 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
intdict2ndarray 3 other papers
3 later
2004.00445 (2020-04)
Learning to Cluster Faces via Confidence and Connectivity Estimation
2103.11568 (2021-03)
Cluster Contrast for Unsupervised Person Re-Identification
2404.08995 (2024-04)
Beyond Known Clusters: Probe New Prototypes for Efficient Generalized Class Discovery
l2norm 3 other papers
3 later
2004.00445 (2020-04)
Learning to Cluster Faces via Confidence and Connectivity Estimation
2103.11568 (2021-03)
Cluster Contrast for Unsupervised Person Re-Identification
2404.08995 (2024-04)
Beyond Known Clusters: Probe New Prototypes for Efficient Generalized Class Discovery
read_meta 3 other papers
3 later
2004.00445 (2020-04)
Learning to Cluster Faces via Confidence and Connectivity Estimation
2103.11568 (2021-03)
Cluster Contrast for Unsupervised Person Re-Identification
2404.08995 (2024-04)
Beyond Known Clusters: Probe New Prototypes for Efficient Generalized Class Discovery

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

Face recognition sees remarkable progress in recent years, and its performance has reached a very high level. Taking it to a next level requires substantially larger data, which would involve prohibitive annotation cost. Hence, exploiting unlabeled data becomes an appealing alternative. Recent works have shown that clustering unlabeled faces is a promising approach, often leading to notable performance gains. Yet, how to effectively cluster, especially on a large-scale (i.e. million-level or above) dataset, remains an open question. A key challenge lies in the complex variations of cluster patterns, which make it difficult for conventional clustering methods to meet the needed accuracy. This work explores a novel approach, namely, learning to cluster instead of relying on hand-crafted criteria. Specifically, we propose a framework based on graph convolutional network, which combines a detection and a segmentation module to pinpoint face clusters. Experiments show that our method yields significantly more accurate face clusters, which, as a result, also lead to further performance gain in face recognition.

For agents

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

get_harvested_code_for_paper("1904.02749")
get_code_for_paper("1904.02749")
have("1904.02749")

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

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

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

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

Connect an agent — have() is free.