Algorithm for computing all the shortest reducts based on a new pruning strategy

DOI10.1016/j.ins.2021.11.037OpenAlexW3215876959MaRDI QIDQ6149507

Manuel S. Lazo-Cortés, Jesús Ariel Carrasco-Ochoa, José Francisco Martínez-Trinidad, Yanir González-Díaz

Publication date: 5 February 2024

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2021.11.037

zbMATH Keywords

rough setsfast algorithmdecision systemsshortest reducts

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Reasoning under uncertainty in the context of artificial intelligence (68T37) Complexity of computation (including implicit computational complexity) (03D15) Rough analysis (60L99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the relation between rough set reducts and typical testors
• Discernibility matrix simplification for constructing attribute reducts
• EARC: evidential association rule-based classification
• Rough sets
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• Rough Sets and Current Trends in Computing

This page was built for publication: Algorithm for computing all the shortest reducts based on a new pruning strategy