首页> 外文会议>ACM/IEEE-CS joint conference on Digital libraries >Locating question difficulty through explorations in question space
【24h】

Locating question difficulty through explorations in question space

机译:通过对问题空间的探索来定位问题难度

获取原文

摘要

Three different search effectiveness measures were used to classify 50 question narratives as easy or hard. Each measure was then encoded onto a spatial representation of interquestion similarity. Discriminant analysis based on the resulting map was able to predict question difficulty with approximately 80% accuracy, robust across multiple measures. Implications for the design of digital document collections are discussed.

机译:

使用三种不同的搜索效果量度将50个问题叙述分为容易或很难。然后将每个量度编码到问询相似性的空间表示上。基于结果图的判别分析能够以大约80%的准确度预测问题难度,并且在多个度量之间均具有稳健性。讨论了数字文档收藏设计的意义。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号