Clustering data by reordering them

Axel Descamps, Sélène Forget, Aliénor Lahlou, Claire Lavergne, Camille Berthelot +3 more
3/24/2025
cs.CVq-bio.BM

No confident code implementation found for this paper.

Abstract

Grouping elements into families to analyse them separately is a standard analysis procedure in many areas of sciences. We propose herein a new algorithm based on the simple idea that members from a family look like each other, and don't resemble elements foreign to the family. After reordering the data according to the distance between elements, the analysis is automatically performed with easily-understandable parameters. Noise is explicitly taken into account to deal with the variety of problems of a data-driven world. We applied the algorithm to sort biomolecules conformations, gene sequences, cells, images, and experimental conditions.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{descamps2025clustering,
  title  = {Clustering data by reordering them},
  author = {Axel Descamps and Sélène Forget and Aliénor Lahlou and Claire Lavergne and Camille Berthelot and Guillaume Stirnemann and Rodolphe Vuilleumier and Nicolas Chéron},
  year   = {2025},
  eprint = {2503.19067},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2503.19067v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2503.19067.svg)](https://codeofpaper.com/paper/2503.19067)

Discussion