Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE (www.oxfordhandbooks.com). © Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a title in Oxford Handbooks Online for personal use (for details see Privacy Policy and Legal Notice).

date: 21 October 2019

Abstract and Keywords

This chapter provides a comprehensive overview of repeated-measures dyadic data analysis. The chapter begins with an introduction of how different methodological and analytical approaches lend themselves to different theoretical questions in the study of relationships. Issues relevant to the analysis of repeated-measures dyadic data are then introduced, including the issue of distinguishability of dyad members, the nested structure of the data, and the types of variables collected. The latter half of the chapter is focused on data structure, analysis, and interpretation. I demonstrate two illustrative analyses for data that have two repeated measures, and the interest is in comparison between these repeated measures. Two sample analyses are presented using multilevel modeling: one for the analysis of indistinguishable dyads and one for the analysis of distinguishable dyads. The chapter concludes with a discussion of model elaborations and alternative analysis strategies.

Keywords: repeated measures, dyadic data analysis, data structure, analysis, interpretation, multilevel modeling, distinguishable dyads, indistinguishable dyads

Access to the complete content on Oxford Handbooks Online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can''t find the answer there, please contact us.