At the present time, the amount of data stored in educational database is increasing rapidly. These databases contain hidden information for improvement of student’s performance. Decision tree is the most useful classification algorithm in educational data mining because of its ease of execution and easier to understand compared to other algorithms. We can get more accurate and valuable results with the help of decision tree algorithm which can be useful for instructors to improve the student learning outcomes. The ID3, C4.5 and CART decision tree algorithms has been applied on the data of students to predict their performance. But all these 3 algorithms are used only for small database. For large database, we are using a new algorithm i.e. SPRINT which removes all the memory restriction and accuracy problem comes in other algorithms. It is fast and scalable than others because it can be implemented in both serial and parallel fashion for good data placement and load balancing. In this work, SPRINT decision tree algorithm is used to solve the problem of classification in education system.
"synopsis" may belong to another edition of this title.
Assistant Professor in the Department of Computer Science at DSMNRU. He has been associated with the IT Industry, research and academics for the last twelve years. He has rich and diverse experience in academia and has been Visiting Professor at various Universities and Colleges.
"About this title" may belong to another edition of this title.
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -At the present time, the amount of data stored in educational database is increasing rapidly. These databases contain hidden information for improvement of student's performance. Decision tree is the most useful classification algorithm in educational data mining because of its ease of execution and easier to understand compared to other algorithms. We can get more accurate and valuable results with the help of decision tree algorithm which can be useful for instructors to improve the student learning outcomes. The ID3, C4.5 and CART decision tree algorithms has been applied on the data of students to predict their performance. But all these 3 algorithms are used only for small database. For large database, we are using a new algorithm i.e. SPRINT which removes all the memory restriction and accuracy problem comes in other algorithms. It is fast and scalable than others because it can be implemented in both serial and parallel fashion for good data placement and load balancing. In this work, SPRINT decision tree algorithm is used to solve the problem of classification in education system. 60 pp. Englisch. Seller Inventory # 9783330350410
Quantity: 2 available
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - At the present time, the amount of data stored in educational database is increasing rapidly. These databases contain hidden information for improvement of student's performance. Decision tree is the most useful classification algorithm in educational data mining because of its ease of execution and easier to understand compared to other algorithms. We can get more accurate and valuable results with the help of decision tree algorithm which can be useful for instructors to improve the student learning outcomes. The ID3, C4.5 and CART decision tree algorithms has been applied on the data of students to predict their performance. But all these 3 algorithms are used only for small database. For large database, we are using a new algorithm i.e. SPRINT which removes all the memory restriction and accuracy problem comes in other algorithms. It is fast and scalable than others because it can be implemented in both serial and parallel fashion for good data placement and load balancing. In this work, SPRINT decision tree algorithm is used to solve the problem of classification in education system. Seller Inventory # 9783330350410
Quantity: 1 available
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Katiyar DeveshAssistant Professor in the Department of Computer Science at DSMNRU. He has been associated with the IT Industry, research and academics for the last twelve years. He has rich and diverse experience in academia and has . Seller Inventory # 158799535
Quantity: Over 20 available
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 60 pages. 8.66x5.91x0.14 inches. In Stock. Seller Inventory # __3330350415
Quantity: 1 available
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -At the present time, the amount of data stored in educational database is increasing rapidly. These databases contain hidden information for improvement of student's performance. Decision tree is the most useful classification algorithm in educational data mining because of its ease of execution and easier to understand compared to other algorithms. We can get more accurate and valuable results with the help of decision tree algorithm which can be useful for instructors to improve the student learning outcomes. The ID3, C4.5 and CART decision tree algorithms has been applied on the data of students to predict their performance. But all these 3 algorithms are used only for small database. For large database, we are using a new algorithm i.e. SPRINT which removes all the memory restriction and accuracy problem comes in other algorithms. It is fast and scalable than others because it can be implemented in both serial and parallel fashion for good data placement and load balancing. In this work, SPRINT decision tree algorithm is used to solve the problem of classification in education system.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 60 pp. Englisch. Seller Inventory # 9783330350410
Quantity: 1 available