A set covering based approach to find the reduct of variable precision rough set
From MaRDI portal
Publication:726549
DOI10.1016/j.ins.2014.02.023zbMath1341.68261OpenAlexW2095324437MaRDI QIDQ726549
James N. K. Liu, Yan-Xing Hu, Yu-Lin He
Publication date: 11 July 2016
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2014.02.023
Related Items (7)
Boundary region-based variable precision covering rough set models ⋮ Rough and rough fuzzy sets on two universes via covering approach ⋮ Matrix Approaches for Variable Precision Rough Approximations ⋮ A set-cover-based approach for the test-cost-sensitive attribute reduction problem ⋮ An expanded double-quantitative model regarding probabilities and grades and its hierarchical double-quantitative attribute reduction ⋮ The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory ⋮ Class-specific attribute reducts in rough set theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparative study of variable precision rough set model and graded rough set model
- Rough set approach to incomplete numerical data
- Variable-precision-dominance-based rough set approach to interval-valued information systems
- Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems
- On covering problems of codes
- Covering based rough set approximations
- Rough set theory applied to lattice theory
- Rough sets: some extensions
- Neighborhood rough set based heterogeneous feature subset selection
- Variable-precision dominance-based rough set approach and attribute reduction
- Positive approximation: an accelerator for attribute reduction in rough set theory
- Analysis on attribute reduction strategies of rough set
- Variable precision rough set model
- Rough set approach to knowledge-based decision support
- Approaches to knowledge reduction based on variable precision rough set model.
- Linear upper-bound unavailability set covering models for locating ambulances: application to Tehran rural roads
- A rough set approach for the discovery of classification rules in interval-valued information systems
- Two basic double-quantitative rough set models of precision and grade and their investigation using granular computing
- A threshold of ln n for approximating set cover
- A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
- A Greedy Heuristic for the Set-Covering Problem
- Some NP-hard polygon decomposition problems
- Rough sets
- ATTRIBUTE REDUCTION IN VARIABLE PRECISION ROUGH SET MODEL
- Algorithms for the set covering problem
- Reducts within the variable precision rough sets model: A further investigation
This page was built for publication: A set covering based approach to find the reduct of variable precision rough set
