Decision bireducts and decision reducts -- a comparison

DOI10.1016/j.ijar.2017.02.007zbMath1419.68178OpenAlexW2594133594MaRDI QIDQ2406907

Sebastian Widz, Sebastian Stawicki, Andrzej Janusz, Dominik Ślęzak

Publication date: 4 October 2017

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2017.02.007

zbMATH Keywords

computational complexityheuristic algorithmsdecision reductsBoolean reasoningclassifier ensemblesdecision bireducts

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (22)

Rough sets on graphs: New dependency and accuracy measures ⋮ Locally finite complexes, modules and generalized information systems ⋮ Label distribution feature selection for multi-label classification with rough set ⋮ Class-specific information measures and attribute reducts for hierarchy and systematicness ⋮ Rough set decision algorithms for modeling with uncertainty ⋮ Categorification of a set relation geometry induced by rough operators ⋮ A random approximate reduct-based ensemble learning approach and its application in software defect prediction ⋮ Attribute reduction for hybrid data based on fuzzy rough iterative computation model ⋮ Bireducts with tolerance relations ⋮ A new algorithm for reduct computation based on gap elimination and attribute contribution ⋮ Rule acquisition in generalized multi-scale information systems with multi-scale decisions ⋮ Value reducts and bireducts: A comparative study ⋮ Decision systems in rough set theory: A set operatorial perspective ⋮ On resilient feature selection: computational foundations of \(r\)-\(\mathbb{C} \)-reducts ⋮ Min-max attribute-object bireducts: on unifying models of reducts in rough set theory ⋮ New perspectives of granular computing in relation geometry induced by pairings ⋮ Unnamed Item ⋮ Ensemble learning based on approximate reducts and bootstrap sampling ⋮ Incremental mechanism of attribute reduction based on discernible relations for dynamically increasing attribute ⋮ Class-specific attribute reducts in rough set theory ⋮ Decision reducts and bireducts in a covering approximation space and their relationship to set definability ⋮ Granular computing on basic digraphs

Uses Software

• R
• UCI-ml

Cites Work

• Rough sets and Boolean reasoning
• Partial covers, reducts and decision rules in rough sets. Theory and applications
• Three approaches to data analysis. Test theory, rough sets and logical analysis of data.
• On Generalized Decision Functions: Reducts, Networks and Ensembles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decision bireducts and decision reducts -- a comparison