The relationship between attribute reducts in rough sets and minimal vertex covers of graphs
From MaRDI portal
Publication:1750334
DOI10.1016/j.ins.2015.07.008zbMath1390.68636OpenAlexW837908851MaRDI QIDQ1750334
Yao-Jin Lin, Jinkun Chen, Guoping Lin, Zhouming Ma, Jin Jin Li
Publication date: 18 May 2018
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2015.07.008
Reasoning under uncertainty in the context of artificial intelligence (68T37) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
An efficient feature selection algorithm based on the description vector and hypergraph ⋮ A graph approach for fuzzy-rough feature selection ⋮ A set-cover-based approach for the test-cost-sensitive attribute reduction problem ⋮ An efficient local search framework for the minimum weighted vertex cover problem ⋮ Class-specific attribute reducts in rough set theory ⋮ Four operators of rough sets generalized to matroids and a matroidal method for attribute reduction
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pessimistic rough set based decisions: a multigranulation fusion strategy
- Quick attribute reduction in inconsistent decision tables
- A novel method for attribute reduction of covering decision systems
- Reduction target structure-based hierarchical attribute reduction for two-category decision-theoretic rough sets
- Decision region distribution preservation reduction in decision-theoretic rough set model
- Decision-theoretic rough fuzzy set model and application
- Soft sets and soft rough sets
- Convergence theorem for the common solution for a finite family of \(\phi\)-strongly accretive operator equations
- Quantitative information architecture, granular computing and rough set models in the double-quantitative approximation space of precision and grade
- Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model
- Fuzzy preference based rough sets
- Positive approximation: an accelerator for attribute reduction in rough set theory
- Hybrid attribute reduction based on a novel fuzzy-rough model and information granulation
- Discernibility matrix simplification for constructing attribute reducts
- Efficient bounds for the stable set, vertex cover and set packing problems
- Rough computational methods for information systems
- Monotonic uncertainty measures for attribute reduction in probabilistic rough set model
- A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
- Experimental analysis of approximation algorithms for the vertex cover and set covering problems
- Knowledge reduction in random information systems via Dempster-Shafer theory of evidence
- Resynchronization for multiprocessor DSP systems
- Modeling and Solving the Crew Rostering Problem
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- COMBINATION ENTROPY AND COMBINATION GRANULATION IN ROUGH SET THEORY
- A Greedy Heuristic for the Set-Covering Problem
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- Rough sets
- Vertex packings: Structural properties and algorithms
- Rough set methods in feature selection and recognition
- THE INFORMATION ENTROPY, ROUGH ENTROPY AND KNOWLEDGE GRANULATION IN ROUGH SET THEORY
- THE ALGORITHM ON KNOWLEDGE REDUCTION IN INCOMPLETE INFORMATION SYSTEMS
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Reducibility among Combinatorial Problems
- Reduction algorithms based on discernibility matrix: The ordered attributes method
This page was built for publication: The relationship between attribute reducts in rough sets and minimal vertex covers of graphs
