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