An Optimal Algorithm To Recognize Robinsonian Dissimilarities - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Classification Année : 2014

An Optimal Algorithm To Recognize Robinsonian Dissimilarities

Résumé

A dissimilarity D on a finite set S is said to be Robinsonian if S can be totally ordered in such a way that, for every $i < j < k, D(i, j) ≤ D(i, k)$ and $D(j, k) ≤ D(i, k)$. Intuitively, D is Robinsonian if S can be represented by points on a line. Recognizing Robinsonian dissimilarities has many applications in se-riation and classification. In this paper, we present an optimal $O(n 2)$ algorithm to recognize Robinsonian dissimilarities, where n is the cardinal of S. Our result improves the already known algorithms.
Fichier principal
Vignette du fichier
Robinson_Opt.pdf (1.27 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02435793 , version 1 (11-01-2020)

Identifiants

  • HAL Id : hal-02435793 , version 1

Citer

Pascal Préa, Dominique Fortin. An Optimal Algorithm To Recognize Robinsonian Dissimilarities. Journal of Classification, 2014. ⟨hal-02435793⟩
70 Consultations
119 Téléchargements

Partager

Gmail Facebook X LinkedIn More