Methods › General › Clustering › FINCH Clustering
First Integer Neighbor Clustering Hierarchy (FINCH))
FINCH Clustering
Introduced by Saquib Sarfraz et al. in Efficient Parameter-Free Clustering Using First Neighbor Relations
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
FINCH is a parameter-free fast and scalable clustering algorithm. it stands out for its speed and clustering quality.
In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.
Near matches the lookup lists, each a different name: FINCH; FINCH-ZK; Jigsaw Clustering; Agentic Clustering; interval clustering; clustering strategy; Transport Clustering; Likelihood Clustering.
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
Papers archive 2025-07-28
archive papers tagged: 2 · with a code link: 2 · where Syntology ran a sample: 1 (0 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (1 of 2 tagged: 0 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 2 of 2, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
Temporally-Weighted Hierarchical Clustering for Unsupervised Action Segmentation 20 Mar 2021 · 1 repository · arXiv:2103.11264Syntology official (archive's flag): 5 ran · 5 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified (of 7 harvested samples) · 1 pointer-only (licence)
-
Efficient Parameter-Free Clustering Using First Neighbor Relations 1 Jun 2019 · 1 repository
Tasks archive 2025-07-28
5 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
| Task | Papers |
|---|---|
| Clustering | 2 |
| Action Segmentation | 1 |
| Segmentation | 1 |
| Unsupervised Action Segmentation | 1 |
| Video Understanding | 1 |
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections