Skip to content

Epistemic network analysis (ENA)

Research Method · All research methods
Evidence · 8 claims (8 for) · 3 studies (1 causal, 1 design, 1 theoretical), q2–q3 · 1 of 3 report an effect size · 8 claims rest on one study

Description

Epistemic network analysis (ENA) is a non-parametric analytic method developed for epistemic game data; the article focuses on its social-network based variant. Chat utterances are automatically scored into binary indicators of SKIVE element use, aggregated into adjacency and cumulative adjacency matrices across evidentiary segments. The weighted density (WD) statistic summarizes, for each learner, "the total number of unique pair-wise associations / connections between SKIVE elements", and the article evaluates its utility via a simulation study in Land Science.

Accounts

  • Epistemic network analysis and its weighted density statistic for analyzing SKIVE element co-occurrence in epistemic games: Epistemic network analysis (ENA) is a non-parametric analytic method developed for epistemic game data; the article focuses on its social-network based variant. Chat utterances are automatically scored into binary indicators of SKIVE element use, aggregated into adjacency and cumulative adjacency matrices across evidentiary segments. The weighted density (WD) statistic summarizes, for each learner, "the total number of unique pair-wise associations / connections between SKIVE elements", and the article evaluates its utility via a simulation study in Land Science. (Sweet et al. (2012))
  • ENA network model of problem posing with eleven category and quality codes: This element is the article’s ENA modeling setup for analyzing students’ cognitive structures during problem posing. Because ENA focuses on associations among semantic units rather than frequency, "only 11 codes from question category (IQ, SC, SL, SR, OD, and CQ) and question quality (R, P , A, E, and C) were retained as network nodes". Lines between nodes represent co-occurrence relationships and line thickness indicates connection strength. Mean networks were constructed for phases and groups, with subtracted networks used to compare conditions, using the online tool epistemicnetwork.org. (Dai et al. (2026))
  • Epistemic Network Analysis reveals temporally ordered patterns in sequentially produced coded data: The article describes ENA as an extension of bag-of-words text-mining that adds a sliding time "window" so co-occurrences are counted over meaningful parts of text, called "stanzas". Coded data form the nodes of a transition graph with co-occurrences as edges, allowing graph features and network visualization. The article states that "ENA allows the researcher to reveal temporally ordered patterns in sequentially produced data" and that it enabled nuanced condition differences and a better understanding of Simple questions' roles in talk. (Peter Reimann (2021))

Claims

-

Key Sources

  • Sweet, S. J., & Rupp, A. A. (2012). Using the ECD Framework to Support Evidentiary Reasoning in the Context of a Simulation Study for Detecting Learner Differences in Epistemic Games. Journal of Educational Data Mining, Special Issue, Article 5, Volume 4. https://jedm.educationaldatamining.org/index.php/JEDM. doi:10.5281/zenodo.3554649
Page metadata
Field Value
type research-method
id epistemic-network-analysis-ena
title Epistemic network analysis (ENA)
description Epistemic network analysis (ENA) is a non-parametric analytic method developed for epistemic game data; the article focuses on its social-network based variant.
status review
moved_from element/epistemic-network-analysis-weighted-density
generated by process:sweep-kinds on 2026-10-10
trust unverified — no one has confirmed this page's content
sources 1 — sweet-2012

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