A New Family of Combinatorial Algorithms in Seriation

  • Chapter
  • First Online:
Seriation in Combinatorial and Statistical Data Analysis

Part of the book series: Advanced Information and Knowledge Processing ((AI&KP))

  • 180 Accesses

Abstract

In Sect. 3.6 of Chap. 3 the general idea of a new family of combinatorial algorithms was given. In this chapter we shall develop and illustrate the respective methods of this family.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 179.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info
Hardcover Book
USD 179.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. M. Hahsler, K. Hornik, C. Buchta, Getting things in order: an introduction to the R package seriation. J. Stat. Softw. 25(3), 1–34 (2008)

    Google Scholar 

  2. H. Leredde, La méthode des poles d’attraction, La méthode des poles d’agrégation. Ph.D. thesis, Université de Paris 6, Oct. 1979

    Google Scholar 

  3. I.C. Lerman, Foundations and Methods in Combinatorial and Statistical Data Analysis and Clustering (Springer, 2016)

    Google Scholar 

  4. B. Effros, I. Moreira, The Oxford Handbook of the Merovingian World, ed. by B. Effros, I. Moreira (Oxford University Press, 2020)

    Google Scholar 

  5. P. Perin, La datation des tombes mérovingiennes. historiques, méthodes, applications. Paris, DROZ (1980)

    Google Scholar 

  6. H.G. Semanville, Les plaques-boucles mérovingiennes ornées d’une croix encadrée par deux griffons: à propos d’une découverte faite à Fleurey-sur-Ouche. Revue Archeologique de l’Est 59(2), 585–602 (2010)

    Google Scholar 

  7. H. Leredde, P. Perin, Les plaques boucles mérovingiennes. Dossiers de l’Archéologie 42, 83–87, Mars-Avril 1980

    Google Scholar 

  8. I.C. Lerman, Classification et analyse ordinale des données. Dunod and http://www.brclasssoc.org.uk/books/index.html (1981)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Israël César Lerman .

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Lerman, I.C., Leredde, H. (2022). A New Family of Combinatorial Algorithms in Seriation. In: Seriation in Combinatorial and Statistical Data Analysis. Advanced Information and Knowledge Processing. Springer, Cham. https://doi.org/10.1007/978-3-030-92694-6_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-92694-6_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-92693-9

  • Online ISBN: 978-3-030-92694-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Navigation