The M-Relative Reduct Problem

DOI10.1007/11795131_25zbMATH Open1196.68232OpenAlexW2167573351MaRDI QIDQ5757980FDOQ5757980

Authors: Fan Min, Qihe Liu, Hao Tan, Leiting Chen 

Publication date: 7 September 2007

Published in: Rough Sets and Knowledge Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11795131_25

Recommendations

• scientific article; zbMATH DE number 2247111
• Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model
• scientific article; zbMATH DE number 2157024
• A Further Investigation to Relative Reducts of Decision Information Systems
• scientific article; zbMATH DE number 23766

zbMATH Keywords

Rough Sets\(M\)-discernibility matrix and function\(M\)-relative reduct and core

Mathematics Subject Classification ID

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

Cited In (7)

• Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model
• Rough sets approach to symbolic value partition
• Title not available (Why is that?)
• Some NP-complete problems for attribute reduction in consistent decision tables
• \(m\)-reducibility with upper and lower bounds for reducing functions
• Title not available (Why is that?)
• Research on Rough Set Theory and Applications in China

This page was built for publication: The M-Relative Reduct Problem

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