PQser: a Matlab package for spectral seriation
- 56 Downloads
Seriation is an important ordering problem which consists of finding the best ordering of a set of units whose interrelationship is defined by a bipartite graph. It has important applications in, e.g., archaeology, anthropology, psychology, and biology. This paper presents a Matlab implementation of an algorithm for spectral seriation by Atkins et al., based on the use of the Fiedler vector of the Laplacian matrix associated to the problem, which encodes the set of admissible solutions into a PQ-tree. We introduce some numerical technicalities in the original algorithm to improve its performance, and point out that the presence of a multiple Fiedler value may have a substantial influence on the computation of an approximated solution, in the presence of inconsistent data sets. Practical examples and numerical experiments show how to use the toolbox to process data sets deriving from real-world applications.
KeywordsSeriation Fiedler value Bipartite graphs PQ-trees Bandwidth reduction
Mathematics Subject Classification (2010)65F15 65F50 05C82 91D30
Unable to display preview. Download preview PDF.
We would like to thank Matteo Sommacal for pointing our attention to the problem of seriation and to its application in archaeology. The paper , which he coauthored, was our principal source of information when the research which led to this paper started. We are indebted to the reviewers for their comments and suggestions, which contributed to improve both the form and the content of the paper.
The authors are members of the INdAM Research group GNCS, which partially supported the research. Anna Concas gratefully acknowledges Sardinia Regional Government for the financial support of her Ph.D. scholarship (P.O.R. Sardegna F.S.E. Operational Programme of the Autonomous Region of Sardinia, European Social Fund 2014-2020 - Axis III Education and Formation, Objective 10.5, Line of Activity 10.5.12).
- 9.Christof, T., Oswald, M., Reinelt, G.: Consecutive ones and a betweenness problem in computational biology. In: International Conference on Integer Programming and Combinatorial Optimization. Springer, pp. 213–228 (1998)Google Scholar
- 12.Eisen, M.B., Spellman, P.T., Brown, P.O., Botstein, D.: Cluster analysis and display of genome-wide expression patterns. Proc. Natl. Acad. Sci. USA 868(14), 863–14 (1998)Google Scholar
- 19.Fogel, F., d’Aspremont, A., Vojnovic, M.: Serialrank: Spectral ranking using seriation. In: Advances in Neural Information Processing Systems, vol. 27, pp. 900–908 (2014)Google Scholar
- 34.O’Brien, M.J., Lyman, R.L.: Seriation Stratigraphy and Index Fossils: The Backbone of Archaeological Dating. Kluwer, Norwell (2002)Google Scholar
- 36.Petrie, W.M.F.: Sequences in prehistoric remains. J. R. Anthropol. Inst. 29, 295–301 (1899)Google Scholar
- 37.Piana Agostinetti, P., Sommacal, M.: Il problema della seriazione in archeologia. Rivista di Scienze Preistoriche LV, pp. 29–69 (2005)Google Scholar
- 40.Seminaroti, M.: Combinatorial Algorithms for the Seriation Problem. Ph.D. thesis, CentER, Tilburg University (2016)Google Scholar
- 41.Seston, M.: Dissimilarités de Robinson: Algorithmes de reconnaissance et d’approximation. Ph.D. thesis, Aix Marseille 2 (2008)Google Scholar