Seriation by constrained correspondence analysis: A simulation study
One of the many areas in which correspondence analysis (CA) is an effective method, concerns seriation problems. For example, CA is a well-known technique for the seriation of archaeological assemblages. A problem with the CA seriation solution, however, is that only a relative ordering of the assemblages is obtained. To improve the usual CA solution, a constrained CA approach that incorporates additional information in the form of equality and inequality constraints concerning the time points of the assemblages may be considered. Using such constraints, explicit dates can be assigned to the seriation solution. The set of constraints that can be used in CA by introducing interval constraints is extended. That is, constraints that put the CA solution within a specific time frame. Moreover, the quality of the constrained CA solution is studied in a simulation study. In particular, by means of the simulation study we are able to assess how well ordinary, and constrained CA can recover the true time order. Furthermore, for the constrained approach, it is shown that the true dates are retrieved satisfactory. 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). It is found that the dating of the assemblages on the basis of constraints appears to work quite well.
|Keywords||correspondence analysis, simulation models|
|Persistent URL||dx.doi.org/10.1016/j.csda.2008.08.020, hdl.handle.net/1765/15218|
|Journal||Computational Statistics & Data Analysis|
van de Velden, M, Groenen, P.J.F, & Poblome, J. (2009). Seriation by constrained correspondence analysis: A simulation study. Computational Statistics & Data Analysis, 53(8), 3129–3138. doi:10.1016/j.csda.2008.08.020