Claims

Unsupervised hierarchical clustering of knowledge vectors recovers expert bundle structure without bundle labels

Claim · All claims
Evidence · 1 study (2 entries) · design r2 · q2
Currency · newest study 2026 · not yet checked against its sources · not reviewed by a person · recheck by 2029: tool and model accuracy changes quickly

Subclaims

Reading the evidence codes

q is the design tier, i the impact, n the sample, and the kind with its r the rigour judged within that kind: what each code means.

This claim: no standardized effect is recorded in observations/ for it yet, so no benchmark reading is possible.

q2 i? Agglomerative clustering reached a best bundle-level ARI of 0.605 with V-measure 0.933, and 76.4% of nearest-neighbor matches were same-bundle. → Muntasir Hoq 2026 q2 i? Most nearest-neighbor matches fell in the same expert bundle, with mismatches often reflecting broadly used patterns spanning topic boundaries. → Muntasir Hoq 2026 (2)

Evidence

Muntasir Hoq 2026

Muntasir Hoq, Griffin Pitts, Zhangqi Duan, Arun Balajiee Lekshmi Narayanan, Mohammad Hassany, Andrew Lan, Peter Brusilovsky and Bita Akram. (2026). Automated Recommendation of Programming Learning Content Using Pattern-based Knowledge Components. CSEDM'26: 10th Educational Data Mining in Computer Science Education Workshop. https://arxiv.org/abs/2607.05409 doi:10.48550/arxiv.2607.05409

q2 · i? · design · r2

Agglomerative hierarchical clustering with cosine distance and complete linkage on the PCEX knowledge vectors; the dendrogram preserved pairwise geometry with cophenetic correlation r = 0.819. ARI and V-measure were computed post hoc across distance-cut thresholds.

"At thebundlelevel, the best ARI was 0.605 at 0.6 threshold with63clusters, indicating substantial agreement beyond chance."

Muntasir Hoq 2026 (2)

Muntasir Hoq, Griffin Pitts, Zhangqi Duan, Arun Balajiee Lekshmi Narayanan, Mohammad Hassany, Andrew Lan, Peter Brusilovsky and Bita Akram. (2026). Automated Recommendation of Programming Learning Content Using Pattern-based Knowledge Components. CSEDM'26: 10th Educational Data Mining in Computer Science Education Workshop. https://arxiv.org/abs/2607.05409

q2 · i? · design · r2

Local neighborhood analysis identifying, for every program, its single nearest neighbor excluding self-matches and categorizing the match type. The authors note mismatches often reflect common control-flow patterns in Loops, Nested Loops, and Strings that span topics.

"The distribution of nearest-neighbor types was: 76.4% same bundle, 11.9% same topic/different bundle, and 11.7% different topic."

Discussion

Page metadata
Field Value
type claim
id clustering-recovers-expert-bundles
title Unsupervised hierarchical clustering of knowledge vectors recovers expert bundle structure without bundle labels
description Unsupervised hierarchical clustering of knowledge vectors recovers expert bundle structure without bundle labels
status review
evidence_strength moderate
newest_evidence 2026
recheck_by 2029
generated by process:wiki-ingest on 2026-10-11
trust unverified — no one has confirmed this page's content
sources 2 — muntasir-hoq-2026, muntasir-hoq-2026-2

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