.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
DYADIC INTERACTION
DISTINCTION
STATISTICS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
