Case Based Modeling of Answer Points to Expedite Semi-Automated Evaluation of Subjective Papers

Chhanda Roy, C. Chaudhuri
{"title":"Case Based Modeling of Answer Points to Expedite Semi-Automated Evaluation of Subjective Papers","authors":"Chhanda Roy, C. Chaudhuri","doi":"10.1109/IADCC.2018.8692133","DOIUrl":null,"url":null,"abstract":"Researches have been carried out in the past and recent years for the automation of examination systems. But most of them target on-line examinations with either choice-based or very short descriptive answers at best. The primary goal of this paper is to propose a framework, where textual papers set for subjective questions, are supplemented with model answer points to facilitate the evaluation procedure in a semi-automated manner. The proposed framework also accommodates provisions for reward and penalty schemes. In the reward scheme, additional valid points provided by the examinees would earn them bonus marks as rewards. By incremental up-gradation of the question case-base with these extra answer-points, the examiner can incorporate an automatic fairness in the checking procedure. In the penalty scheme, unfair means adopted amongst neighboring examinees can be detected by maintaining seat plans in the form of a neighborhood graph. The degree of penalization can then be impartially ascertained by computing the degree of similarity amongst adjoining answer scripts. The main question-bank as well as the model answer points are all maintained using Case Based Reasoning strategies.","PeriodicalId":365713,"journal":{"name":"2018 IEEE 8th International Advance Computing Conference (IACC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 8th International Advance Computing Conference (IACC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IADCC.2018.8692133","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Researches have been carried out in the past and recent years for the automation of examination systems. But most of them target on-line examinations with either choice-based or very short descriptive answers at best. The primary goal of this paper is to propose a framework, where textual papers set for subjective questions, are supplemented with model answer points to facilitate the evaluation procedure in a semi-automated manner. The proposed framework also accommodates provisions for reward and penalty schemes. In the reward scheme, additional valid points provided by the examinees would earn them bonus marks as rewards. By incremental up-gradation of the question case-base with these extra answer-points, the examiner can incorporate an automatic fairness in the checking procedure. In the penalty scheme, unfair means adopted amongst neighboring examinees can be detected by maintaining seat plans in the form of a neighborhood graph. The degree of penalization can then be impartially ascertained by computing the degree of similarity amongst adjoining answer scripts. The main question-bank as well as the model answer points are all maintained using Case Based Reasoning strategies.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于案例的答案点建模,以加快主观试卷的半自动评估
在过去和最近几年,人们对考试系统的自动化进行了研究。但他们中的大多数针对的是在线考试,要么是基于选择的,要么是非常简短的描述性答案。本文的主要目标是提出一个框架,其中为主观问题设置的文本论文补充了模型答案点,以半自动化的方式促进评估过程。拟议的框架还包括奖励和惩罚计划的规定。在奖励计划中,考生提供的额外有效分数将获得额外分数作为奖励。通过使用这些额外的答案点逐步升级问题案例库,审查员可以在检查过程中纳入自动公平性。在惩罚方案中,可以通过邻域图的形式保持考生的座次计划来检测邻近考生之间采取的不公平手段。然后可以通过计算相邻答案脚本之间的相似度来公正地确定惩罚程度。主题库和模型答案点都使用基于案例的推理策略进行维护。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Discovering Motifs in DNA Sequences: A Suffix Tree Based Approach Prediction Model for Automated Leaf Disease Detection & Analysis Blind navigation using ambient crowd analysis HUPM: Efficient High Utility Pattern Mining Algorithm for E-Business Algorithm to Quantify the Low and High Resolution HLA Matching in Renal Transplantation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1