基于决策树的例程生成(DRG)算法:一种基于数据挖掘的开放性学分制例程生成算法

A. Rahman, S. Giasuddin, R. Rahman
{"title":"基于决策树的例程生成(DRG)算法:一种基于数据挖掘的开放性学分制例程生成算法","authors":"A. Rahman, S. Giasuddin, R. Rahman","doi":"10.1109/ICCITECHN.2008.4803011","DOIUrl":null,"url":null,"abstract":"Mining data from a database using classification algorithm is not an innovative technique. This paper presents a technique namely decision tree based routine generation (DRG) algorithm to create an academic routine. The concept of open credit course registration system (after completion of pre-requisite courses any student may choose any course in any semester) makes the research more challenging and complex to accomplish. This is an NP-hard problem and hence unsolvable to satisfy all students and teachers at the same time. A level of tolerance has to be added to make the evaluation efficient and effective to achieve the goal, a conflict free routine. OLAP representation helps to classify the courses along with the proposed algorithm to eliminate some constraints. Day-based pattern, minimum Manhattan distance between courses of same teacher, minimum conflicted course distribution has been stage-managed to classify the courses. To alleviate the algorithm, decision tree based models and sequential search methods are espoused with computational results.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Decision Tree based Routine Generation (DRG) algorithm: A data mining advancement to generate academic routine for open credit system\",\"authors\":\"A. Rahman, S. Giasuddin, R. Rahman\",\"doi\":\"10.1109/ICCITECHN.2008.4803011\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mining data from a database using classification algorithm is not an innovative technique. This paper presents a technique namely decision tree based routine generation (DRG) algorithm to create an academic routine. The concept of open credit course registration system (after completion of pre-requisite courses any student may choose any course in any semester) makes the research more challenging and complex to accomplish. This is an NP-hard problem and hence unsolvable to satisfy all students and teachers at the same time. A level of tolerance has to be added to make the evaluation efficient and effective to achieve the goal, a conflict free routine. OLAP representation helps to classify the courses along with the proposed algorithm to eliminate some constraints. Day-based pattern, minimum Manhattan distance between courses of same teacher, minimum conflicted course distribution has been stage-managed to classify the courses. To alleviate the algorithm, decision tree based models and sequential search methods are espoused with computational results.\",\"PeriodicalId\":335795,\"journal\":{\"name\":\"2008 11th International Conference on Computer and Information Technology\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 11th International Conference on Computer and Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCITECHN.2008.4803011\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 11th International Conference on Computer and Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCITECHN.2008.4803011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

使用分类算法从数据库中挖掘数据并不是一项创新技术。本文提出了一种基于决策树的例程生成(DRG)算法来生成学术例程。开放学分课程注册制的概念(学生在修完预修课程后,可以在任何学期选择任何课程)使得研究更具挑战性和复杂性。这是一个NP-hard问题,因此不可能同时满足所有学生和教师。必须增加一定程度的容忍度,以使评估高效和有效地实现目标,这是一个无冲突的例行程序。OLAP表示有助于对课程进行分类,并使用提出的算法消除一些约束。以日为基础,同一老师的课程之间的曼哈顿距离最小,冲突最小的课程分布进行了阶段性管理,对课程进行了分类。为了简化算法,采用了基于决策树的模型和顺序搜索方法,并给出了计算结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Decision Tree based Routine Generation (DRG) algorithm: A data mining advancement to generate academic routine for open credit system
Mining data from a database using classification algorithm is not an innovative technique. This paper presents a technique namely decision tree based routine generation (DRG) algorithm to create an academic routine. The concept of open credit course registration system (after completion of pre-requisite courses any student may choose any course in any semester) makes the research more challenging and complex to accomplish. This is an NP-hard problem and hence unsolvable to satisfy all students and teachers at the same time. A level of tolerance has to be added to make the evaluation efficient and effective to achieve the goal, a conflict free routine. OLAP representation helps to classify the courses along with the proposed algorithm to eliminate some constraints. Day-based pattern, minimum Manhattan distance between courses of same teacher, minimum conflicted course distribution has been stage-managed to classify the courses. To alleviate the algorithm, decision tree based models and sequential search methods are espoused with computational results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信