IDEAS home Printed from https://ideas.repec.org/a/spr/jclass/v26y2009i3p279-296.html
   My bibliography  Save this article

Seriation in the Presence of Errors: NP-Hardness of l ∞ -Fitting Robinson Structures to Dissimilarity Matrices

Author

Listed:
  • Victor Chepoi
  • Bernard Fichet
  • Morgan Seston

Abstract

No abstract is available for this item.

Suggested Citation

  • Victor Chepoi & Bernard Fichet & Morgan Seston, 2009. "Seriation in the Presence of Errors: NP-Hardness of l ∞ -Fitting Robinson Structures to Dissimilarity Matrices," Journal of Classification, Springer;The Classification Society, vol. 26(3), pages 279-296, December.
    • Handle: RePEc:spr:jclass:v:26:y:2009:i:3:p:279-296
    DOI: 10.1007/s00357-009-9041-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00357-009-9041-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00357-009-9041-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. James Lingoes, 1971. "Some boundary conditions for a monotone analysis of symmetric matrices," Psychometrika, Springer;The Psychometric Society, vol. 36(2), pages 195-203, June.
    2. Victor Chepoi & Bernard Fichet, 1997. "Recognition of Robinsonian dissimilarities," Journal of Classification, Springer;The Classification Society, vol. 14(2), pages 311-325, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Laurent, Monique & Seminaroti, Matteo, 2016. "Similarity-First Search : A New Algorithm With Application to Robinsonian Matrix Recognition," Other publications TiSEM 8468be57-ed46-400c-9c0e-7, Tilburg University, School of Economics and Management.
    2. D. Fortin, 2017. "Robinsonian Matrices: Recognition Challenges," Journal of Classification, Springer;The Classification Society, vol. 34(2), pages 191-222, July.
    3. Pascal Préa & Dominique Fortin, 2014. "An Optimal Algorithm To Recognize Robinsonian Dissimilarities," Journal of Classification, Springer;The Classification Society, vol. 31(3), pages 351-385, October.
    4. Julio Aracena & Christopher Thraves Caro, 2023. "The weighted sitting closer to friends than enemies problem in the line," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-21, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. J. Fernando Vera & Rodrigo Macías, 2021. "On the Behaviour of K-Means Clustering of a Dissimilarity Matrix by Means of Full Multidimensional Scaling," Psychometrika, Springer;The Psychometric Society, vol. 86(2), pages 489-513, June.
    2. Francis Caillez & Pascale Kuntz, 1996. "A contribution to the study of the metric and Euclidean structures of dissimilarities," Psychometrika, Springer;The Psychometric Society, vol. 61(2), pages 241-253, June.
    3. Cecilio Mar-Molinero & Carlos Serrano-Cinca, 2001. "Bank failure: a multidimensional scaling approach," The European Journal of Finance, Taylor & Francis Journals, vol. 7(2), pages 165-183.
    4. Julio Aracena & Christopher Thraves Caro, 2023. "The weighted sitting closer to friends than enemies problem in the line," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-21, January.
    5. W. J. Krzanowski, 2004. "Biplots for Multifactorial Analysis of Distance," Biometrics, The International Biometric Society, vol. 60(2), pages 517-524, June.
    6. Laurent, Monique & Seminaroti, Matteo, 2016. "Similarity-First Search : A New Algorithm With Application to Robinsonian Matrix Recognition," Other publications TiSEM 8468be57-ed46-400c-9c0e-7, Tilburg University, School of Economics and Management.
    7. Matthijs Warrens, 2009. "On Robinsonian dissimilarities, the consecutive ones property and latent variable models," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 3(2), pages 169-184, September.
    8. Eric Holman, 1972. "The relation between hierarchical and euclidean models for psychological distances," Psychometrika, Springer;The Psychometric Society, vol. 37(4), pages 417-423, December.
    9. Laurent, Monique & Seminaroti, M. & Tanigawa, Shin-ichi, 2017. "A structural characterization for certifying robinsonian matrices," Other publications TiSEM 5ecebfb8-804e-4267-8c12-b, Tilburg University, School of Economics and Management.
    10. J.-P. Barthélemy & F. Brucker & C. Osswald, 2007. "Combinatorial optimisation and hierarchical classifications," Annals of Operations Research, Springer, vol. 153(1), pages 179-214, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jclass:v:26:y:2009:i:3:p:279-296. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.