Loading…
Mushroom plant analysis through Reduct Technique
The issues of Real World are Very large data sets, Mixed types of data (continuous valued, symbolic data), Uncertainty (noisy data), Incompleteness (missing, incomplete data), Data change, Use of background knowledge etc. Lot of knowledge related to the application can be generated through these lar...
Saved in:
Published in: | International journal of computer applications 2010-02, Vol.1 (5), p.68-73 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | The issues of Real World are Very large data sets, Mixed types of data (continuous valued, symbolic data), Uncertainty (noisy data), Incompleteness (missing, incomplete data), Data change, Use of background knowledge etc. Lot of knowledge related to the application can be generated through these large data sets. Rough set is the methodology which can be used to deduce rules from these data sets. The main goal of the rough set analysis is induction of approximations of concepts [4]. Rough sets constitute a sound basis for KDD. It offers mathematical tools to discover patterns hidden in data [4] and hence used in the field of data mining. Rough Sets does not require any preliminary information as Fuzzy sets require membership values or probability is required in statistics. Hence this is its specialty. Two novel algorithms to find optimal Reducts of condition attributes based on the relative attribute dependency, out of which the first algorithms gives simple Reduct whereas the second one gives the Reduct with minimum attributes, This project highlights on the case study of mushroom which consists of twenty two attributes depending on which the decision is taken whether the mushroom plant is edible or poisonous. The technique of Reduct is very useful as when tested, through the algorithms, the twenty one attributes, excluding the decision attribute gets reduced to two to three attributes. |
---|---|
ISSN: | 0975-8887 0975-8887 |
DOI: | 10.5120/123-239 |