Attribute reduction based on consistent covering rough set and its application

DOI10.1155/2017/8986917MaRDI QIDQ1688128zbMATH OpenOpenAlexFDO

Authors Jianchuan Bai, Kewen Xia, Yongliang Lin, Pan-Pan Wu

Publication date 5 January 2018

Published in Complexity (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2017/8986917

zbMATH Keywords

attribute reductiondata redundancyLeast Squares Support Vector Machine (LS-SVM)Relevance Vector Machine (RVM)rough set theory

Mathematics Subject Classification ID

Review text

Summary: As an important processing step for rough set theory, attribute reduction aims at eliminating data redundancy and drawing useful information. Covering rough set, as a generalization of classical rough set theory, has attracted wide attention on both theory and application. By using the covering rough set, the process of continuous attribute discretization can be avoided. Firstly, this paper focuses on consistent covering rough set and reviews some basic concepts in consistent covering rough set theory. Then, we establish the model of attribute reduction and elaborate the steps of attribute reduction based on consistent covering rough set. Finally, we apply the studied method to actual lagging data. It can be proved that our method is feasible and the reduction results are recognized by Least Squares Support Vector Machine (LS-SVM) and Relevance Vector Machine (RVM). Furthermore, the recognition results are consistent with the actual test results of a gas well, which verifies the effectiveness and efficiency of the presented method.

Recommendations

• A novel method for attribute reduction of covering decision systems
• A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
• A novel method for attribute reduction based on covering rough sets
• Attribute reduction based on conditional information entropy over consistent covering decision system
• Reduction about approximation spaces of covering generalized rough sets

Cites work

• A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
• A novel method for attribute reduction of covering decision systems
• Covering based rough set approximations
• Extensions and intensions in the rough set theory
• Generalized approximations defined by non-equivalence relations
• scientific article; zbMATH DE number 4046636 (Why is no real title available?)
• scientific article; zbMATH DE number 4110174 (Why is no real title available?)
• scientific article; zbMATH DE number 1754538 (Why is no real title available?)
• Model selection for the LS-SVM. Application to handwriting recognition
• Rough sets
• Topological approaches to covering rough sets

Cited in

(4)

• A Pythagorean fuzzy multigranulation probabilistic model for mine ventilator fault diagnosis
• Ensemble-based neighborhood attribute reduction: a multigranularity view
• Some NP-complete problems for attribute reduction in consistent decision tables
• Innovative rough set approaches using novel initial-neighborhood systems: applications in medical diagnosis of COVID-19 variants

This page was built for publication: Attribute reduction based on consistent covering rough set and its application

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