Two simple but efficient algorithms to recognize Robinson dissimilarities - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Two simple but efficient algorithms to recognize Robinson dissimilarities

Résumé

A dissimilarity d on a set S of size n is said to be Robinson if its matrix can be symmetrically permuted so that its elements do not decrease when moving away from the main diagonal along any row or column. Equivalently, S admits a total order < such that i < j < k implies that d(i, j) ≤ d(i, k) and d(j, k) ≤ d(i, k). Intuitively, d is Robinson if S can be represented by points on a line. Recognizing Robinson dissimilarities has numerous applications in seriation and classification. Robinson dissimilarities also play an important role in the recognition of tractable cases for TSP. In this paper, we present two simple algorithms (inspired by Quicksort) to recognize Robinson dissimilarities. One of these algorithms runs in O(n 2 log n), the other one runs in O(n 3) in worst case and in O(n 2) on average.
Fichier principal
Vignette du fichier
two_simple_algorithms.pdf (471.77 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04158896 , version 1 (11-07-2023)

Identifiants

Citer

M. Carmona, V. Chepoi, G. Naves, Pascal Préa. Two simple but efficient algorithms to recognize Robinson dissimilarities. 17th conference of the International Federation of Classification Societies ( IFCS 2022 ), Paula Brito, Jul 2022, Porto, Portugal. ⟨10.1007/s00357-023-09446-y⟩. ⟨hal-04158896⟩
5 Consultations
45 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More