Three-way approximate reduct based on information-theoretic measure
From MaRDI portal
Publication:2076993
DOI10.1016/J.IJAR.2021.12.008OpenAlexW4200443581MaRDI QIDQ2076993FDOQ2076993
Authors: Can Gao, Jie Zhou, Zhi-Cheng Wang 
Publication date: 22 February 2022
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2021.12.008
Cites Work
- Scikit-learn: machine learning in Python
- Statistical comparisons of classifiers over multiple data sets
- Pattern recognition and machine learning.
- Rough sets
- Variable precision rough set model
- Multi-objective attribute reduction in three-way decision-theoretic rough set model
- On an optimization representation of decision-theoretic rough set model
- Minimum cost attribute reduction in decision-theoretic rough set models
- Rough sets: probabilistic versus deterministic approach
- Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model
- Attribute reduction in decision-theoretic rough set models
- Probabilistic rough set approximations
- The superiority of three-way decisions in probabilistic rough set models
- Positive approximation: an accelerator for attribute reduction in rough set theory
- Two semantic issues in a probabilistic rough set model
- Title not available (Why is that?)
- Discernibility matrix simplification for constructing attribute reducts
- Neighborhood rough set based heterogeneous feature subset selection
- Cost-sensitive attribute reduction in decision-theoretic rough set models
- 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
- Tri-partition neighborhood covering reduction for robust classification
- A note on attribute reduction in the decision-theoretic rough set model
- Cost-sensitive approximate attribute reduction with three-way decisions
- A unified framework of dynamic three-way probabilistic rough sets
- Three-way decision and granular computing
- Ensemble learning based on approximate reducts and bootstrap sampling
- Three-way granular computing, rough sets, and formal concept analysis
- Granular maximum decision entropy-based monotonic uncertainty measure for attribute reduction
- Fuzzy neighborhood covering for three-way classification
- Attribute reduction for sequential three-way decisions under dynamic granulation
- Non-monotonic attribute reduction in decision-theoretic rough sets
- Incremental fuzzy probability decision-theoretic approaches to dynamic three-way approximations
- Title not available (Why is that?)
- Heuristic method to attribute reduction for decision region distribution preservation
Cited In (7)
- Theory and application of 3‐D LSKUM based on entropy variables
- Robust weighted fuzzy margin-based feature selection with three-way decision
- Three-Way Weighted Entropies and Three-Way Attribute Reduction
- A novel attribute reduction algorithm based on granular sequential three-way decision
- An improved decision tree algorithm based on variable precision neighborhood similarity
- Attribute reduction with personalized information granularity of nearest mutual neighbors
- Selective label enhancement for multi-label classification based on three-way decisions
Uses Software
This page was built for publication: Three-way approximate reduct based on information-theoretic measure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2076993)
