CLASSIFICATION TECHNIQES IN EDUCATION DOMAIN
Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 5
Abstract
Predicting the performance of a student is a great concern to the higher education managements, where several factors affect the performance. The scope of this paper is to investigate the accuracy of data mining techniques in such an nvironment. The first step of the study is to gather student’s data on hnical, analytical, communicational and problem solving abilities. We collected records of 200 Post graduate students of computer science course, from a private Educational Institution onducting various Under Graduate and Post Graduate courses. The second step is to clean the data and choose the relevant attributes. Attributes were classified into two groups Demographic Attributes” and “Performance Attributes”. In the third step, Decision tree and Naive bayes algorithms were constructed and their performances were evaluated. The study revealed that the Decision tree algorithm is more accurate than the Naïve bayes algorithm. This work will help the institute to accurately predict the performance of the students.
Authors and Affiliations
B. Nithyasri , K. Nandhini , Dr. E. Chandra
Keywords
Related Articles
- EP ID EP85429
- DOI -
- Views 149
- Downloads 0
Drag and Drop: Influences on the Design of Reusable Software Components
The fundamental unit of large scale software construction is he component. A component is the fundamental user interface object in Java. Everything you see on the display in a java pplication is a component. The abilit...
The State of Information and Communication Technology in Iran
Abstract—The development of information and communication technologies depend on several factors like government policy that encourage investors to spend their money in building IT infrastructure and force business or pa...
Algorithm for Efficient Multilevel Association Rule Mining
over the years, a variety of algorithms for finding frequent item sets in very large transaction databases have been developed. The problems of finding frequent item sets are basic in multi level association rule mining,...
Solving Travelling Salesman Problem using Clustering Genetic Algorithm
Solving NP hard problem like Travelling Salesman Problem (TSP) is a major challenge faced by analysts even though many techniques are available. Many versions of Genetic Algorithms are introduced by researchers to improv...
An Index Based Skip Search Multiple Pattern Matching Algorithm
DNA Pattern matching, the problem of finding sub sequences within a long DNA sequence has many applications in computational biology. As the sequences can be long, matching can be an expensive operation, especially as ap...