An Optimal Algorithm To Recognize Robinsonian Dissimilarities

Pascal Préa () and Dominique Fortin

Journal of Classification, 2014, vol. 31, issue 3, 385 pages

Abstract: 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 seriation 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. Copyright Springer Science+Business Media New York 2014

Keywords: Robinsonian dissimilarities; Classification; Seriation; Interval graphs; PQ-Trees; Consecutive One’s Property; Partition refinement (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://hdl.handle.net/10.1007/s00357-014-9150-2 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jclass:v:31:y:2014:i:3:p:351-385

Ordering information: This journal article can be ordered from
http://www.springer. ... hods/journal/357/PS2

DOI: 10.1007/s00357-014-9150-2

Access Statistics for this article

Journal of Classification is currently edited by Douglas Steinley

More articles in Journal of Classification from Springer, The Classification Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().