Skip to main content

Uncovering Latent Knowledge: A Comparison of Two Algorithms

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8538))

Abstract

At the beginning of every course, it can be expected that several students have some syllabus knowledge. For efficiency in learning systems, and to combat student frustration and boredom, it is important to quickly uncover this latent knowledge. This enables students to begin new learning immediately. In this paper we compare two algorithms used to achieve this goal, both based on the theory of Knowledge Spaces. Simulated students were created with appropriate answering patterns based on predefined latent knowledge from a subsection of a real course. For each student, both algorithms were applied to compare their efficiency and their accuracy. We examine the trade-off between both sets of outcomes, and conclude with the merits and constraints of each algorithm.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Desmarais, M.C., de Baker, R.S.J.: A Review of Recent Advances in Learner and Skill Modeling in Intelligent Learning Environments. UMUAI 22, 9–38 (2012)

    Google Scholar 

  2. Falmagne, J.C., Cosyn, E., Doignon, J.P., Thiéry, N.: The Assessment of Knowledge, in Theory and in Practice. In: Missaoui, R., Schmidt, J. (eds.) Formal Concept Analysis. LNCS (LNAI), vol. 3874, pp. 61–79. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Falmagne, J.C., Doignon, J.P.: Learning Spaces. Springer, Berlin (2011)

    Book  MATH  Google Scholar 

  4. Abdullah, S.C., Cooley, R.E.: Using Simulated Students to Evaluate an Adaptive Testing System. In: ICCE, pp. 614–618. IEEE Computer Society (2002)

    Google Scholar 

  5. Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The Maximum Clique Problem. In: Handbook of Combinatorial Optimization, pp. 1–74. Springer (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Lynch, D.J., Howlin, C.P. (2014). Uncovering Latent Knowledge: A Comparison of Two Algorithms. In: Dimitrova, V., Kuflik, T., Chin, D., Ricci, F., Dolog, P., Houben, GJ. (eds) User Modeling, Adaptation, and Personalization. UMAP 2014. Lecture Notes in Computer Science, vol 8538. Springer, Cham. https://doi.org/10.1007/978-3-319-08786-3_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08786-3_32

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08785-6

  • Online ISBN: 978-3-319-08786-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics