.png){kind=icon}
Return
LOG-LINEAR APPROACHES TO LAG-SEQUENTIAL ANALYSIS WHEN CONSECUTIVE CODES MAY AND CANNOT REPEAT
.png){kind=icon}
PRE
AI
DOI：10.1037/0033-2909.118.2.272.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
G. P. Sackett's (1979) lag-sequential analysis is recast in log-linear terms. Differing from articles by P. D. Allison and J. K. Liker (1982) and by D. lacobucci and S. Wasserman (1988), sequences that, for logical reasons, do not allow consecutive events to be assigned the same code are considered. In addition, overlapped sampling, which the sequential analysis literature usually assumes, is contrasted with nonoverlapped sampling of sequences, which is also used and may seem more faithful to some statistical models. Several advantages of a log-linear approach to sequential problems are noted, including its ability to deal routinely with the structural zeros created when consecutive codes cannot repeat and its integration of sequential methods into an established and well supported statistical tradition.
Keywords:
DYADIC INTERACTION
DISTINCTION
STATISTICS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
19.8
Papers:
2.2K
Citations:
6.0W
Organization
No organization information available
Cited Papers
No cited papers available