journal article·2025-03Open access

Dating archaeological sites by seriation

Elisa Crabu, Caterina Fenu, Giuseppe Rodriguez, Giuseppa Tanda

Abstract

• Finding a relative chronological order of sites is a common problem in archaeology. • Artifacts contained in sites characterize them and often help in their dating. • Seriation aims at ordering a set of units on the basis of types that correlate them. • Algorithms for seriation can treat large datasets, but produce approximate solutions. • An iterative refinement method may lead to improve the solution by a small effort. Seriation is an ordering problem which consists of determining the best ordering of a set of correlated units, whose relationship is defined by a bipartite graph. It has several applications in different fields, like genetics, anthropology, archaeology and psychology. Our application deals with the relative dating of archaeological sites based on the characteristics of parietal engravings found in them. Our interest lies mainly in the Domus the Janas , Neolithic burial sites typical of Sardinia, Italy. Two matrices, derived from the available data, give information about the similarity among the units. A well known seriation method is applied to them. Due to its formulation, the seriation algorithm employed produces in some cases a solution which does not appear to be completely satisfying. So we propose an approach to improve the quality of the solution, based on a quality indicator.
Source: openalex_inverted_index · Quality: baseline

Research context

OpenAlex topics: Language and cultural evolution

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

References (21)

Show source-provided references
1. Clustering, seriation, and subset extraction of confusion data10.1037/1082-989X.11.3.271 ↗
2. Cluster analysis and display of genome-wide expression patterns10.1073/pnas.95.25.14863 ↗
3. Hodson · 1971
4. Graphs and Genes
5. Il problema della seriazione in archeologia
6. Tanda · 2015
7. A spectral algorithm for seriation and the consecutive ones problem10.1137/S0097539795285771 ↗
8. PQser: a Matlab package for spectral seriation10.1007/s11075-018-0510-6 ↗
9. Old and new results on algebraic connectivity of graphs10.1016/j.laa.2006.08.017 ↗
10. Algebraic connectivity of graphs10.21136/CMJ.1973.101168 ↗
11. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory10.21136/CMJ.1975.101357 ↗
12. Laplacian of graphs and algebraic connectivity10.4064/-25-1-57-70 ↗
13. The seriation problem in the presence of a double Fiedler value10.1007/s11075-022-01461-1 ↗
14. The place of chronological ordering in archaeological analysis10.2307/276979 ↗
15. A method for chronologically ordering archaeological deposits10.2307/276978 ↗
16. A spectral algorithm for envelope reduction of sparse matrices10.1002/nla.1680020402 ↗
17. Physical mapping by STS hybridization: algorithmic strategies and the challenge of software evaluation10.1089/cmb.1995.2.219 ↗
18. Spectral clustering and its use in bioinformatics10.1016/j.cam.2006.04.026 ↗
19. Optimal linear labelings and eigenvalues of graphs10.1016/0166-218X(92)90229-4 ↗
20. Estrada · 2012
21. Estrada · 2015