NLP Cluster Analysis of Common Core State Standards and NAEP Item Specifications

• URL: http://arxiv.org/abs/2412.04482v2
• Date: Fri, 13 Dec 2024 16:56:21 GMT
• Title: NLP Cluster Analysis of Common Core State Standards and NAEP Item Specifications
• Authors: Gregory Camilli, Larry Suter,
• Abstract summary: Camilli (2024) proposed a methodology using natural language processing (NLP) to map the relationship of a set of content standards to item specifications.<n>This study provided evidence that NLP can be used to improve the mapping process.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Camilli (2024) proposed a methodology using natural language processing (NLP) to map the relationship of a set of content standards to item specifications. This study provided evidence that NLP can be used to improve the mapping process. As part of this investigation, the nominal classifications of standards and items specifications were used to examine construct equivalence. In the current paper, we determine the strength of empirical support for the semantic distinctiveness of these classifications, which are known as "domains" for Common Core standards, and "strands" for National Assessment of Educational Progress (NAEP) item specifications. This is accomplished by separate k-means clustering for standards and specifications of their corresponding embedding vectors. We then briefly illustrate an application of these findings.

Related papers

• Position: Restructuring of Categories and Implementation of Guidelines Essential for VLM Adoption in Healthcare [5.9372801317341155]
  Vision language model (VLM) development requires clear and standardized reporting protocols.<n>Traditional machine learning reporting standards and evaluation guidelines must be restructured to accommodate multiphase VLM studies.<n>We propose a categorization framework for VLM studies and outline corresponding reporting standards.
  arXiv  Detail & Related papers  (2025-05-12T18:39:54Z)
• StaICC: Standardized Evaluation for Classification Task in In-context Learning [3.0531121420837226]
  This paper proposes a standardized and easy-to-use evaluation toolkit (StaICC) for in-context classification. For the normal classification task, we provide StaICC-Normal, selecting 10 widely used datasets, and generating prompts with a fixed form. We also provide a sub-benchmark StaICC-Diag for diagnosing ICL from several aspects, aiming for a more robust inference processing.
  arXiv  Detail & Related papers  (2025-01-27T00:05:12Z)
• Splitting criteria for ordinal decision trees: an experimental study [6.575723870852787]
  Ordinal Classification (OC) is a machine learning field that addresses classification tasks where the labels exhibit a natural order. OC takes the ordinal relationship into account, producing more accurate and relevant results. This work conducts an experimental study of tree-based methodologies designed to capture ordinal relationships.
  arXiv  Detail & Related papers  (2024-12-18T10:41:44Z)
• ECBD: Evidence-Centered Benchmark Design for NLP [95.50252564938417]
  We propose Evidence-Centered Benchmark Design (ECBD), a framework which formalizes the benchmark design process into five modules. Each module requires benchmark designers to describe, justify, and support benchmark design choices. Our analysis reveals common trends in benchmark design and documentation that could threaten the validity of benchmarks' measurements.
  arXiv  Detail & Related papers  (2024-06-13T00:59:55Z)
• An NLP Crosswalk Between the Common Core State Standards and NAEP Item Specifications [0.0]
  I describe an NLP-based procedure that can be used to support subject matter experts in establishing a crosswalk between item specifications and content standards. The procedure is used to evaluate the match of the Common Core State Standards for mathematics at grade 4 to the corresponding item specifications for the 2026 National Assessment of Educational Progress.
  arXiv  Detail & Related papers  (2024-05-27T15:47:46Z)
• Exploring Ordinality in Text Classification: A Comparative Study of Explicit and Implicit Techniques [3.197435100145382]
  Ordinal Classification (OC) is a widely encountered challenge in Natural Language Processing (NLP) Previous approaches to tackle OC have primarily focused on modifying existing or creating novel loss functions that textbfexplicitly account for the ordinal nature of labels. With the advent of Pretrained Language Models (PLMs), it became possible to tackle ordinality through the textbfimplicit semantics of the labels as well.
  arXiv  Detail & Related papers  (2024-05-20T04:31:04Z)
• Entity Disambiguation with Entity Definitions [50.01142092276296]
  Local models have recently attained astounding performances in Entity Disambiguation (ED) Previous works limited their studies to using, as the textual representation of each candidate, only its Wikipedia title. In this paper, we address this limitation and investigate to what extent more expressive textual representations can mitigate it. We report a new state of the art on 2 out of 6 benchmarks we consider and strongly improve the generalization capability over unseen patterns.
  arXiv  Detail & Related papers  (2022-10-11T17:46:28Z)
• State-of-the-art generalisation research in NLP: A taxonomy and review [87.1541712509283]
  We present a taxonomy for characterising and understanding generalisation research in NLP. Our taxonomy is based on an extensive literature review of generalisation research. We use our taxonomy to classify over 400 papers that test generalisation.
  arXiv  Detail & Related papers  (2022-10-06T16:53:33Z)
• Unsupervised Attention-based Sentence-Level Meta-Embeddings from Contextualised Language Models [15.900069711477542]
  We propose a sentence-level meta-embedding learning method that takes independently trained contextualised word embedding models. Our proposed method is unsupervised and is not tied to a particular downstream task. Experimental results show that our proposed unsupervised sentence-level meta-embedding method outperforms previously proposed sentence-level meta-embedding methods.
  arXiv  Detail & Related papers  (2022-04-16T08:20:24Z)
• CUGE: A Chinese Language Understanding and Generation Evaluation Benchmark [144.05723617401674]
  General-purpose language intelligence evaluation has been a longstanding goal for natural language processing. We argue that for general-purpose language intelligence evaluation, the benchmark itself needs to be comprehensive and systematic. We propose CUGE, a Chinese Language Understanding and Generation Evaluation benchmark with the following features.
  arXiv  Detail & Related papers  (2021-12-27T11:08:58Z)
• CoPHE: A Count-Preserving Hierarchical Evaluation Metric in Large-Scale Multi-Label Text Classification [70.554573538777]
  We argue for hierarchical evaluation of the predictions of neural LMTC models. We describe a structural issue in the representation of the structured label space in prior art. We propose a set of metrics for hierarchical evaluation using the depth-based representation.
  arXiv  Detail & Related papers  (2021-09-10T13:09:12Z)
• Rule-Based Classification of Hyperspectral Imaging Data [0.0]
  We present a general classification approach based on the shape of spectral signatures. In contrast to classical classification approaches (e.g. SVM, KNN), not only reflectance values are considered, but also parameters such as curvature points, curvature values, and the curvature behavior of spectral signatures are used. The flexibility and efficiency of the methodology is demonstrated using datasets from two different application fields.
  arXiv  Detail & Related papers  (2021-07-21T10:11:41Z)
• Towards Uncovering the Intrinsic Data Structures for Unsupervised Domain Adaptation using Structurally Regularized Deep Clustering [119.88565565454378]
  Unsupervised domain adaptation (UDA) is to learn classification models that make predictions for unlabeled data on a target domain. We propose a hybrid model of Structurally Regularized Deep Clustering, which integrates the regularized discriminative clustering of target data with a generative one. Our proposed H-SRDC outperforms all the existing methods under both the inductive and transductive settings.
  arXiv  Detail & Related papers  (2020-12-08T08:52:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.