An algorithm of constructing concept lattices for CAT with cognitive diagnosis

Authors:
Shuqun Yang;Shuliang Ding;Shengzhen Cai;Qiulin Ding
Affiliations:
College of Information Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China and Faculty of Software, Fujian Normal University, Fuzhou 350007, China;Computer Information Engineering Institute, Jiangxi Normal University, Nanchang 330027, China;Faculty of Software, Fujian Normal University, Fuzhou 350007, China;College of Information Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China
Venue:
Knowledge-Based Systems
Year:
2008

Citing 3
Cited 5

Machine Learning on the Basis of Formal Concept Analysis

Automation and Remote Control
Fuzzy clustering algorithm for latent class model

Statistics and Computing
The Design and Realization of CAT with Cognitive Diagnosis based on Formal Concept Analysis

ICNC '07 Proceedings of the Third International Conference on Natural Computation - Volume 02

Approaches to attribute reduction in concept lattices induced by axialities

Knowledge-Based Systems
Mining minimal non-redundant association rules using frequent itemsets lattice

International Journal of Intelligent Systems Technologies and Applications
Knowledge reduction in decision formal contexts

Knowledge-Based Systems
Improving the scalability of ILP-based multi-relational concept discovery system through parallelization

Knowledge-Based Systems
A new case-based classification using incremental concept lattice knowledge

Data & Knowledge Engineering

Quantified Score

Hi-index	0.00

Visualization

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.