.png){kind=icon}
.png){kind=icon}
Return
An efficient classifier design integrating rough set and set oriented database operations
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2010.08.008.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Feature subset selection and dimensionality reduction of data are fundamental and most explored area of research in machine learning and data mining domains. Rough set theory (RST) constitutes a sound basis for data mining, can be used at different phases of knowledge discovery process. In the paper, by integrating the concept of RST and relational algebra operations, a new attribute reduction algorithm has been presented to select the minimum set of attributes, called reducts, required for classification of data. Firstly, the conditional attributes are partitioned into different groups according to their score, calculated using projection (Pi) and division (divided by) operations of relational algebra. The groups based on their scores are sorted in ascending order while the first group contains maximum information is uniquely used for generating the reducts. The non-reduct attributes are combined with the elements of the next group and the modified group is considered for computing the reducts. The process continues until all groups are exhausted and thus a final set of reducts is obtained. Then applying decision tree algorithm on each reduct, decision rule sets are generated, which are later pruned by removing the extraneous components. Finally, by involving the concept of probability theory and graph theory minimum number of rules is obtained used for building an efficient classifier. (C) 2010 Elsevier B.V. All rights reserved.
Keywords:
Data mining
Classification
Rough set theory
Decision tree
Graph theory
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W