knowledge_assessment:q-matrix
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
knowledge_assessment:q-matrix [2012/07/05 13:02] jpetrovic |
knowledge_assessment:q-matrix [2012/07/05 13:09] jpetrovic |
||
|---|---|---|---|
| Line 15: | Line 15: | ||
| Factor analysis: | Factor analysis: | ||
| How to automatically determine concepts? Using covariance matrix. Number of concepts should be smaller than number of questions. Still, this methos has proven to be less fault tollerant. | How to automatically determine concepts? Using covariance matrix. Number of concepts should be smaller than number of questions. Still, this methos has proven to be less fault tollerant. | ||
| + | |||
| + | ==== Q-matrix method ==== | ||
| + | |||
| + | The q-matrix method is a simple hill-climbing algorithm that creates a matrix | ||
| + | representing relationships between concepts and questions directly. The algorithm varies | ||
| + | c, the number of concepts, and the values in the q-matrix, minimizing the total error for | ||
| + | all students for a given set of n questions. To avoid of local minima, each hill-climbing | ||
| + | search is seeded with different random Q-matrices and the best of these is kept. | ||
| + | |||
knowledge_assessment/q-matrix.txt ยท Last modified: 2023/06/19 18:03 (external edit)
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
