Salīdzināt metodes
Apskatiet izvēlētās metodes blakus; rindas, kas atšķiras, ir izceltas.
| Formālā konceptu analīze (FCA)× | Zināšanu izsekošana× | |
|---|---|---|
| Nozare≠ | Mīkstā skaitļošana | Izglītības analītika |
| Saime | Machine learning | Machine learning |
| Izcelsmes gads≠ | 1982 | 1994 |
| Autors≠ | Rudolf Wille & Bernhard Ganter | Albert Corbett & John Anderson |
| Tips≠ | Lattice-based knowledge representation / concept mining | Probabilistic student modeling |
| Pirmavots≠ | 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 ↗ |
| Citi nosaukumi | FCA, concept lattice analysis, Galois lattice, biçimsel kavram analizi | BKT, Bayesian Knowledge Tracing, Deep Knowledge Tracing, Bilgi İzleme |
| Saistītās | 3 | 3 |
| Kopsavilkums≠ | 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. |
| ScholarGateDatu kopa ↗ |
|
|