Name
Abstract | ||
|---|---|---|
Concept lattices have proved useful in many fields such as machine learning, knowledge discovery, in which building concept lattices is extensively studied. A modification of the Godin's algorithms is proposed. Considering attribute hierarchies, an algorithm are presented for computerized adaptive testing (CAT) with cognitive diagnosis (CD). Both of algorithms are studied experimentally, and the algorithm for CD-CAT is studied theoretically. Algorithmic complexity of the algorithms for CD-CAT is studied theoretically (time complexity is studied in the best case and the worst case). With eight attributes, the test results are generated for both algorithms. With 10 attributes, quadratic regression is given for CPU time for the algorithm of CD-CAT. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.knosys.2008.03.056 | Knowl.-Based Syst. |
Keywords | Field | DocType |
computerized adaptive testing,algorithmic complexity,best case,cpu time,cd–cat,worst case,concept lattice,ea -matrix,concept lattices,cognitive diagnosis,attribute hierarchy,building concept lattice,time complexity,machine learning | Lattice (order),Computer science,Polynomial regression,Theoretical computer science,Artificial intelligence,Time complexity,Algorithmic complexity,CPU time,Cognitive diagnosis,Algorithm,Knowledge extraction,Computerized adaptive testing,Machine learning | Journal |
Volume | Issue | ISSN |
21 | 8 | Knowledge-Based Systems |
Citations | PageRank | References |
9 | 0.65 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shuqun Yang | 1 | 18 | 3.03 |
| Shuliang Ding | 2 | 12 | 3.59 |
| Shengzhen Cai | 3 | 10 | 1.68 |
| Qiulin Ding | 4 | 26 | 8.10 |