{"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.