Corpus ID: 3144126

Learning Sequences

@article{Eppstein2008LearningS,
  title={Learning Sequences},
  author={D. Eppstein},
  journal={ArXiv},
  year={2008},
  volume={abs/0803.4030}
}
  • D. Eppstein
  • Published 2008
  • Computer Science
  • ArXiv
  • We describe the algorithms used by the ALEKS computer learning system for manipulating combinatorial descriptions of human learners’ states of knowledge, generating all states that are possible according to a description of a learning space in terms of a partial order, and using Bayesian statistics to determine the most likely state of a student. As we describe, a representation of a knowledge space using learning sequences (basic words of an antimatroid) allows more general learning spaces to… CONTINUE READING
    6 Citations
    Finding the answer in space: the mental whiteboard hypothesis on serial order in working memory
    • 68
    • PDF
    Are Temporal Concepts Embodied? A Challenge for Cognitive Neuroscience
    • 52
    • Highly Influenced
    • PDF
    Behavioral Advantages of the First-Person Perspective Model for Imitation
    • 10
    • PDF
    Recognizing partial cubes in quadratic time
    • 25
    • PDF
    Survey and analysis of current mobile learning applications and technologies
    • 75
    • PDF

    References

    SHOWING 1-10 OF 23 REFERENCES
    Introduction to knowledge spaces: How to build, test, and search them
    • 108
    Applying the basis of a knowledge space for controlling the questioning of an expert
    • 42
    An algorithmic characterization of antimatroids
    • 35
    • PDF
    Upright-Quad Drawing of st-Planar Learning Spaces
    • D. Eppstein
    • Computer Science, Mathematics
    • Graph Drawing
    • 2006
    • 9
    • PDF
    Reverse Search for Enumeration
    • 725
    • PDF
    Correspondence between two Antimatroid Algorithmic Characterizations
    • 18
    • PDF
    Algorithms for Drawing Media
    • D. Eppstein
    • Computer Science, Mathematics
    • Graph Drawing
    • 2004
    • 19
    • PDF
    Lattices with unique irreducible decompositions
    • 49
    The Complexity of the Partial Order Dimension Problem
    • 415