Seriation mit bedingter Korrespondenzanalye: Simulationsexperimente

  • Michel Velden, van de (Author)
  • Patrick J. F. Groenen (Author)
  • Jeroen Poblome (Author)

Identifiers (Article)

Identifiers (Files)

Abstract

Correspondence analysis (CA) is a well-known technique for the seriation of archaeological assemblages. One problem with the CA seriation Solution isthat only a relative ordering of the assemblages is obtained. However, GROENEN & POBLOME (2003) and POBLOME & GROENEN (2003) proposed a constrained CA approach that incorporates additional information, in the form of equality and inequality constraints concerning the time points of the assemblages, in order to improve the usual CA Solution. Using such constraints, explicit dates can be assigned to the seriation Solution. In this paper, we study the quality of the constrained CA Solution more closely using a Simulation study. To be more precise, we study how well ordinary and constrained CA are able to recover the time order and the explicit dates. Moreover, by varying the amount and type (equality, inequality) of constraints, we investigate how much extra information is required to obtain a satisfactory reproduction of the true time frame. The Simulation study is set up in such a way that it mimics the data of a series of ceramic assemblages consisting of the locally produced tableware from Sagalassos (SW Turkey).

Statistics

loading

Comments on this article

Published
2014-03-06
Language
de
Keywords
correspondence analysis, Simulation, AG CAA