Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Teoria Spațiilor de Cunoaștere× | Analiza formală a conceptelor (FCA)× | Urmărirea Cunoștințelor× | |
|---|---|---|---|
| Domeniu≠ | Analitică educațională | Soft computing | Analitică educațională |
| Familie | Machine learning | Machine learning | Machine learning |
| Anul apariției≠ | 1985 | 1982 | 1994 |
| Autorul original≠ | Jean-Paul Doignon & Jean-Claude Falmagne | Rudolf Wille & Bernhard Ganter | Albert Corbett & John Anderson |
| Tip≠ | Combinatorial knowledge assessment framework | Lattice-based knowledge representation / concept mining | Probabilistic student modeling |
| Sursa seminală≠ | Doignon, J.-P., & Falmagne, J.-C. (1985). Spaces for the assessment of knowledge. International Journal of Man-Machine Studies, 23(2), 175–196. DOI ↗ | Wille, R. (1982). Restructuring lattice theory: an approach based on hierarchies of concepts. In I. Rival (Ed.), Ordered Sets (pp. 445–470). Reidel. DOI ↗ | Corbett, A. T., & Anderson, J. R. (1994). Knowledge tracing: Modeling the acquisition of procedural knowledge. User Modeling and User-Adapted Interaction, 4(4), 253–278. DOI ↗ |
| Denumiri alternative | KST, Knowledge Structures, Competence-Based Knowledge Space Theory, Bilgi Uzayı Teorisi | FCA, concept lattice analysis, Galois lattice, biçimsel kavram analizi | BKT, Bayesian Knowledge Tracing, Deep Knowledge Tracing, Bilgi İzleme |
| Înrudite | 3 | 3 | 3 |
| Rezumat≠ | Knowledge Space Theory (KST) is a combinatorial, set-theoretic framework for modeling and assessing human knowledge, introduced by Jean-Paul Doignon and Jean-Claude Falmagne in 1985. It represents a learner's competence as a subset of a problem domain, organizes all feasible competence subsets into a lattice called a knowledge space, and uses probabilistic inference to locate a learner within that space. The approach underlies adaptive testing and intelligent tutoring systems, offering a mathematically rigorous alternative to classical test theory. | Formal concept analysis derives a hierarchy of concepts from a simple table of which objects have which attributes. Founded by Rudolf Wille in 1982 on lattice theory, it pairs each set of objects with the attributes they all share to form 'formal concepts', then organizes these into a concept lattice — a mathematically grounded, interpretable hierarchy used for knowledge discovery, ontology building, and explainable analysis of categorical data. | Knowledge Tracing (KT) is a student-modeling technique that estimates, at each moment in time, the probability that a learner has mastered a target knowledge component. Introduced by Corbett and Anderson in 1994, the classical Bayesian Knowledge Tracing (BKT) model treats skill acquisition as a two-state Hidden Markov Model driven by four interpretable parameters: prior knowledge, learning rate, slip, and guess. Deep variants (DKT, DKVMN, AKT) later replaced HMMs with recurrent and transformer architectures. |
| ScholarGateSet de date ↗ |
|
|
|