Comparative study on classification power of the attributes and reducts
Journal Title: Indian Journal of Computer Science and Engineering - Year 2015, Vol 6, Issue 2
Abstract
In rough set theory, reduct are those attributes which are important and are able to represent the whole range of attributes. They show up the important features of database. In the present study of educational data mining, we have used the reduct of the rough set theory to find out the important features of a particular course work. The features of course work are the subjects taught in that course work. We conclude in this paper that if all the subjects are taken, the classificatory power remains same as in case where only the reduct is taken.
Authors and Affiliations
Nilesh Mahajan , Jyoti Namdeo
Keywords
Related Articles
- EP ID EP111356
- DOI -
- Views 160
- Downloads 0
Software Architecture modeling framework using UML
The software architecture’s are built using some specific languages while developing a project. Architecture design languages are used in research and industrial projects that are used represented using Unified Modeling...
Artificial Intelligence – Making an Intelligent personal assistant
A bot in computing is an autonomous program on a network (especially the Internet) which can interact with systems or users.[ Simpson, J., and Weiner, E. (1989)] This document gives the description of how memory of an Ar...
STUDY OF THE WEB CACHING ALGORITHMS FOR PERFORMANCE IMPROVEMENT OF THE RESPONSE SPEED
The increasing demand for World Wide Web (WWW) services has made document caching a necessity to decrease download times and reduce Internet traffic. To make efficient use of caching, an instructive conclusion has to be...
QOS PARAMETER ANALYSIS ON AODV AND DSDV PROTOCOLS IN A WIRELESS NETWORK
Wireless networks are characterized by a lack of infrastructure, and by a random and quickly changing network topology; thus the need for a robust dynamic routing protocol that can accommodate such an environment. To imp...
COMPARISON OF NORMAL SELFISH OVERLAY NETWORK AND SELFISH OVERLAY NETWORK WITH DEPLOYMENT OF OVERLAY NODES USING FUZZY LOGIC
Selfish overlay routing is the technique whereby the sender of the packet can specify the route that the packet should take through the network. Selfish overlay routing allow end users to select routes in an egocentic fa...