A Heuristic Optimal Reduct Algorithm
نویسندگان
چکیده
Reduct finding, especially optimal reduct finding, similar to feature selection problem, is a crucial task in rough set applications to data mining, In this paper, we propose a heuristic reduct finding algorithm, which is based on frequencies of attributes appeared in discernibility matrix. Our method does not guarantee to find optimal reduct, but experiment shows that in most situations it does; and it is very fast.
منابع مشابه
Feature ranking in rough sets
We propose a novel feature ranking technique using discernibility matrix. Discernibility matrix is used in rough set theory for reduct computation. By making use of attribute frequency information in discernibility matrix, we develop a fast feature ranking mechanism. Based on the mechanism, two heuristic reduct computation algorithms are proposed. One is for optimal reduct and the other for app...
متن کاملKnowledge Reduction in Inconsistent Decision Tables
In this paper, we introduce a new type of reducts called the λ-Fuzzy-Reduct, where the fuzzy similarity relation is constructed by means of cosine-distances of decision vectors and the parameter λ is used to tune the similarity precision level. The λ-Fuzzy-Reduct can eliminate harsh requirements of the distribution reduct, and it is more flexible than the maximum distribution reduct, the tradit...
متن کاملHeuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملAttribute Reduction in Variable Precision Rough Set Model
The differences of attribute reduction and attribute core between Pawlak’s rough set model (RSM) and variable precision rough set model (VPRSM) are analyzed in detail. According to the interval properties of precision parameter b with respect to the quality of classification, the definition of attribute reduction is extended from a specific b value to a specific b interval in order to overcome ...
متن کاملOptimal Bidding Strategies of GENCOs in Day-Ahead Energy and Spinning Reserve Markets Based on Hybrid GA-Heuristic Optimization Algorithm
In an electricity market, every generation company (GENCO) attempts to maximize profit according to other participants bidding behaviors and power systems operating conditions. The goal of this study is to examine the optimal bidding strategy problem for GENCOs in energy and spinning reserve markets based on a hybrid GA-heuristic optimization algorithm. The heuristic optimization algorithm used...
متن کامل