Strategies

Recommended procedure for applying L* to sequences of affective states

Strategy · All strategies
Evidence · no claims cited

Description

The article outlines a step-by-step procedure (Algorithm 1) for computing L* on full affect sequences with transitions to A excluded. The algorithm explicitly handles special cases that would produce undefined values or division-by-zero errors, such as sequences consisting solely of transitions of the form Aprev→Bnext, where "L∗ is undefined." After computing L* per student, the authors recommend "a two-tailed t-test can then be used on the entire sample of L∗ values" and a Benjamini-Yekutieli post hoc correction with an α value of 0.05 to control false positives under arbitrary dependence.

Design Implications

Context

Requirements

Constraints

Target Learners

Target Learning Goals

Examples

-

Key Sources

Page metadata
Field Value
type strategy
id procedure-for-applying-l-star
title Recommended procedure for applying L* to sequences of affective states
description The article outlines a step-by-step procedure (Algorithm 1) for computing L* on full affect sequences with transitions to A excluded.
status review
generated by process:wiki-ingest on 2026-10-08
trust unverified — no one has confirmed this page's content
sources 1 — jeffrey-matayoshi-and-shamya-karumbaiah-2020

Frontmatter is the page's machine-readable record — see the Schema & Guide.