Positive macroscopic approximation for fast attribute reduction
Summary: Attribute reduction is one of the challenging problems facing the effective application of computational intelligence technology for artificial intelligence. Its task is to eliminate dispensable attributes and search for a feature subset that possesses the same classification capacity as that of the original attribute set. To accomplish efficient attribute reduction, many heuristic search algorithms have been developed. Most of them are based on the model that the approximation of all the target concepts associated with a decision system is dividable into that of a single target concept represented by a pair of definable concepts known as lower and upper approximations. This paper proposes a novel model called macroscopic approximation, considering all the target concepts as an indivisible whole to be approximated by rough set boundary region derived from inconsistent tolerance blocks, as well as an efficient approximation framework called positive macroscopic approximation (PMA), addressing macroscopic approximations with respect to a series of attribute subsets. Based on PMA, a fast heuristic search algorithm for attribute reduction in incomplete decision systems is designed and achieves obviously better computational efficiency than other available algorithms, which is also demonstrated by the experimental results.
- Positive approximation: an accelerator for attribute reduction in rough set theory
- Efficient attribute reduction from the viewpoint of discernibility
- A fast attribute reduction method for large formal decision contexts
- Improved general attribute reduction algorithms
- Attribute reduction using extension of covering approximation space
- Fast attribute reduction via inconsistent equivalence classes for large-scale data
- scientific article; zbMATH DE number 5584436
- A fast approach to attribute reduction in incomplete decision systems with tolerance relation-based rough sets
- An efficient accelerator for attribute reduction from incomplete data in rough set framework
- COMBINATION ENTROPY AND COMBINATION GRANULATION IN ROUGH SET THEORY
- Consistency measure, inclusion degree and fuzzy measure in decision tables
- Consistency-based search in feature selection
- Exploring the boundary region of tolerance rough sets for feature selection
- scientific article; zbMATH DE number 3831938 (Why is no real title available?)
- scientific article; zbMATH DE number 35428 (Why is no real title available?)
- scientific article; zbMATH DE number 5033854 (Why is no real title available?)
- Hybrid approaches to attribute reduction based on indiscernibility and discernibility relation
- Maximal consistent block technique for rule acquisition in incomplete information systems.
- Mining classification rules using rough sets and neural networks
- Positive approximation: an accelerator for attribute reduction in rough set theory
- Reduction of neighborhood-based generalized rough sets
- Reducts within the variable precision rough sets model: A further investigation
- Rough computational methods for information systems
- Using rough sets with heuristics for feature selection
This page was built for publication: Positive macroscopic approximation for fast attribute reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2375684)
