A correct response model in knowledge structure theory
From MaRDI portal
Publication:2244625
DOI10.1016/j.jmp.2021.102519zbMath1475.91270OpenAlexW3134602172MaRDI QIDQ2244625
Publication date: 12 November 2021
Published in: Journal of Mathematical Psychology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmp.2021.102519
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- How many parameters can a model have and still be testable?
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- Optimum turn-restricted paths, nested compatibility, and optimum convex polygons
- Primary facets of order polytopes
- Triangulations. Structures for algorithms and applications
- Recovering a probabilistic knowledge structure by constraining its parameter space
- Weighted graphs defining facets: A connection between stable set and linear ordering polytopes
- Note on two necessary and sufficient axioms for a well-graded knowledge space
- Two poset polytopes
- A Markovian procedure for assessing the state of a system
- A representation theorem for finite random scale systems
- A short proof of a theorem of Falmagne.
- Detecting and explaining BLIM's unidentifiability: forward and backward parameter transformation groups
- Extended formulations for order polytopes through network flows
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- How to assess a model's testability and identifiability
- BLIM's identifiability and parameter invariance under backward and forward transformations
- Identifiability in probabilistic knowledge structures
- Considerations about the identification of forward- and backward-graded knowledge structures
- Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
- Estimation of careless error and lucky guess probabilities for dichotomous test items: a psychometric application of a biometric latent class model with random effects
- Learning Spaces
- Knowledge Spaces
- New Handbook of Mathematical Psychology
- Matroids and the greedy algorithm
- A class of stochastic procedures for the assessment of knowledge
- Extended formulations in combinatorial optimization
This page was built for publication: A correct response model in knowledge structure theory
