摘要
假设0-1矩阵Q的行表示属性,对矩阵Q采用行逐对比较方法导出表示属性层级关系的Hasse图.然而,这个Hasse图和由可达矩阵R导出的Hasse图可能不一致.证明了包含R的Q阵的行逐对比较的方法与R导出的Hasse图是一致的,由此得出由偏序关系的可达矩阵导出Hasse图的一个有效算法,并讨论其在认知诊断中的应用.
Suppose that the rows of a 0-1 matrix Q represent the attributes, the attribute hierarchy from the matrix, Q, could be derived through comparing pair of the rows of the Q matrix. But the hierarchy derived from Q matrix may not be coincidental with that derived from the reachibility matrix R. When the matrix R is included in Q ma- trix, the coincidence of the two hierarchies derived from Q and R must be kept. Application of the method to the reachibility matrix corresponding to the partial order relation, an efficient algorithm of deriving the Hasse diagram is proposed, and its application to cognitive diagnosis is discussed.
出处
《江西师范大学学报（自然科学版）》
CAS
北大核心
2013年第5期441-444,共4页
Journal of Jiangxi Normal University(Natural Science Edition)
基金
国家自然科学基金(30860084
31160203
31100756
31360237
31300876)
国家社会科学基金(12BYY055)
江西省教育厅科技计划(GJJ13207
GJJ13226
GJJ13227
GJJ13208
GJJ13209)资助项目
关键词
偏序关系
可达阵
Hasse图
认知诊断
partial order relation
reachibility matrix
Hasse diagram
cognitive diagnosis
