On the irredundant generation of knowledge spaces
From MaRDI portal
Publication:2366043
DOI10.1006/jmps.1993.1003zbMath0772.92018OpenAlexW2043825121MaRDI QIDQ2366043
Publication date: 29 June 1993
Published in: Journal of Mathematical Psychology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmps.1993.1003
algorithmic efficiencycomputer aided assessment of students' knowledgegeneration of knowledge spacesirredundant algorithm
Knowledge representation (68T30) Mathematical psychology (91E99) Measurement and performance in psychology (91E45)
Related Items (13)
Parsimonious set representations of orders, a generalization of the interval order concept, and knowledge spaces. ⋮ Attribute-incremental construction of the canonical implication basis ⋮ An approval-voting polytope for linear orders ⋮ A representation of antimatroids by Horn rules and its application to educational systems ⋮ Compressed representation of learning spaces ⋮ A dimension-related metric on the lattice of knowledge spaces ⋮ Curriculum spaces and mathematical models for curriculum design ⋮ Knowledge spaces with graded knowledge states ⋮ Reducing one class of machine learning algorithms to logical operations of plausible reasoning ⋮ Comparing performance of algorithms for generating concept lattices ⋮ Knowledge structures delineated by fuzzy skill maps ⋮ Rough set approaches in knowledge structures ⋮ Handling high dimensionality contexts in formal concept analysis via binary decision diagrams
This page was built for publication: On the irredundant generation of knowledge spaces