Ensembles of classifiers based on approximate reducts

MaRDI QIDQ2775872zbMATH OpenFDO

Authors Jakub Wróblewski

Publication date 2 February 2003

Published in Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

expert systemsrough set

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• A rough set approach to multiple classifier systems
• scientific article; zbMATH DE number 1440081
• scientific article; zbMATH DE number 1983098
• scientific article; zbMATH DE number 1983102
• Dynamic ensemble of rough set reducts for data classification

Cited in

(12)

• Minimal approximate hitting sets and rule templates
• Using a neural network to approximate an ensemble of classifiers
• Ensemble learning based on approximate reducts and bootstrap sampling
• The problem of finding the simplest classifier ensemble is NP-hard -- a rough-set-inspired formulation based on decision bireducts
• On resilient feature selection: computational foundations of \(r\)-\(\mathbb{C} \)-reducts
• On the approximability of the largest sphere rule ensemble classification problem
• Three-way attribute reducts
• Dynamic ensemble of rough set reducts for data classification
• The strength of coalition in a dispersed decision support system with negotiations
• On Partial Covers, Reducts and Decision Rules
• Rough Ensemble Classifier: A Comparative Study
• A rough set approach to multiple classifier systems

Describes a project that uses

Uses Software

• ROSETTA
• DistAl

This page was built for publication: Ensembles of classifiers based on approximate reducts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2775872)