Characteristic sets and generalized maximal consistent blocks in mining incomplete data

DOI10.1016/j.ins.2018.04.025zbMath1440.68204OpenAlexW2796165046MaRDI QIDQ2195384

Teresa Mroczek, Jerzy W. Grzymala-Busse, Cheng Gao, Patrick G. Clark

Publication date: 8 September 2020

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

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

zbMATH Keywords

rough set theorycharacteristic setsprobabilistic approximationsincomplete data miningmaximal consistent blocks

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (3)

Mining incomplete data using global and saturated probabilistic approximations based on characteristic sets and maximal consistent blocks ⋮ Extending characteristic relations on an incomplete data set by the three-way decision theory ⋮ Distributed approach for computing rough set approximations of big incomplete information systems

Cites Work

• Unnamed Item
• Unnamed Item
• Rough sets: some extensions
• Probabilistic rough set approximations
• Probabilistic approach to rough sets
• Variable precision rough set model
• Maximal consistent block technique for rule acquisition in incomplete information systems.
• The investigation of the Bayesian rough set model
• Knowledge acquisition in incomplete information systems: a rough set approach
• Rough sets: probabilistic versus deterministic approach
• Local and Global Approximations for Incomplete Data
• Local and Global Approximations for Incomplete Data

This page was built for publication: Characteristic sets and generalized maximal consistent blocks in mining incomplete data