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.
Papers archive 2025-07-28
2 shown of 2, newest first. Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code; it is per sample and not a correctness claim.
-
Temporally-Weighted Hierarchical Clustering for Unsupervised Action Segmentation 20 Mar 2021 · 1 repository · arXiv:2103.11264Syntology ran 5 of 7 samples · 2 unverified · 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