Biased confidence classification algorithm for faculty subject allocation in education domain

A. Agrawal, A. Gupta, M. Venkatesan
{"title":"Biased confidence classification algorithm for faculty subject allocation in education domain","authors":"A. Agrawal, A. Gupta, M. Venkatesan","doi":"10.1109/IMAC4S.2013.6526471","DOIUrl":null,"url":null,"abstract":"There are certain selection and allocation processes in the real world that are performed based on previous knowledge. We can find many applications related to these processes, for example, Candidate selection for promotion, Candidate to department allotment, faculty to subject allotment, etc. In the small scale, the process is not very tedious. But, when it comes to large scale selections and allotments, the process can be very time consuming and prune to human error. So automation in this process is the need of the hour. This process requires an ample amount of decision making, and so data-mining techniques can prove to be effective methods to deal with such problems. There are many multi-class classification methods that can be used as the solution to these problems. But, decisions based only on trained classifiers with historical data-patterns, won't be sufficient in the real time allotment. There might be certain parameters that should be given more priority for the current allocation. In this paper we combine both the historical trends and biased parameters to perform the classification satisfying real time demands. We then compare and contrast its performance against various existing classification algorithms. Our experiment with faculty-course allotment dataset shows that this method is more suitable than other methods for such practical applications.","PeriodicalId":403064,"journal":{"name":"2013 International Mutli-Conference on Automation, Computing, Communication, Control and Compressed Sensing (iMac4s)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Mutli-Conference on Automation, Computing, Communication, Control and Compressed Sensing (iMac4s)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMAC4S.2013.6526471","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

There are certain selection and allocation processes in the real world that are performed based on previous knowledge. We can find many applications related to these processes, for example, Candidate selection for promotion, Candidate to department allotment, faculty to subject allotment, etc. In the small scale, the process is not very tedious. But, when it comes to large scale selections and allotments, the process can be very time consuming and prune to human error. So automation in this process is the need of the hour. This process requires an ample amount of decision making, and so data-mining techniques can prove to be effective methods to deal with such problems. There are many multi-class classification methods that can be used as the solution to these problems. But, decisions based only on trained classifiers with historical data-patterns, won't be sufficient in the real time allotment. There might be certain parameters that should be given more priority for the current allocation. In this paper we combine both the historical trends and biased parameters to perform the classification satisfying real time demands. We then compare and contrast its performance against various existing classification algorithms. Our experiment with faculty-course allotment dataset shows that this method is more suitable than other methods for such practical applications.
教育领域教师学科分配的偏置信度分类算法
在现实世界中,某些选择和分配过程是基于先前的知识进行的。我们可以找到许多与这些过程相关的应用程序,例如,候选人选择晋升,候选人到部门分配,教师到学科分配等。在小范围内,这个过程不是很繁琐。但是,当涉及到大规模的选择和分配时,这个过程可能非常耗时,而且容易出现人为错误。所以自动化在这个过程中是需要的。这个过程需要大量的决策,因此数据挖掘技术可以证明是处理此类问题的有效方法。有许多多类分类方法可以用来解决这些问题。但是,仅基于具有历史数据模式的训练过的分类器的决策在实时分配中是不够的。对于当前的分配,可能应该给某些参数更高的优先级。在本文中,我们将历史趋势和偏差参数结合起来进行分类,以满足实时需求。然后,我们将其与各种现有分类算法的性能进行比较和对比。我们对教师课程分配数据集的实验表明,该方法比其他方法更适合此类实际应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信