Attribute Reduction from Closure Operators and Matroids in Rough Set Theory

In this paper, we present a new closure operator defined on the set of attributes of an information system that satisfies the conditions for defining a matroid. We establish some basic relationships between equivalence classes and approximation operators where different sets of attributes are used....

Descripción completa

Detalles Bibliográficos
Autores principales: Restrepo, Mauricio, Cornelis, Chris
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2020
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7338161/
http://dx.doi.org/10.1007/978-3-030-52705-1_13
_version_ 1783554622759108608
author Restrepo, Mauricio
Cornelis, Chris
author_facet Restrepo, Mauricio
Cornelis, Chris
author_sort Restrepo, Mauricio
collection PubMed
description In this paper, we present a new closure operator defined on the set of attributes of an information system that satisfies the conditions for defining a matroid. We establish some basic relationships between equivalence classes and approximation operators where different sets of attributes are used. It is shown that the reducts of an information system can be obtained from dependent sets of a matroid. Finally, we show that the closure operator can be defined at least in three different ways.
format Online
Article
Text
id pubmed-7338161
institution National Center for Biotechnology Information
language English
publishDate 2020
record_format MEDLINE/PubMed
spelling pubmed-73381612020-07-07 Attribute Reduction from Closure Operators and Matroids in Rough Set Theory Restrepo, Mauricio Cornelis, Chris Rough Sets Article In this paper, we present a new closure operator defined on the set of attributes of an information system that satisfies the conditions for defining a matroid. We establish some basic relationships between equivalence classes and approximation operators where different sets of attributes are used. It is shown that the reducts of an information system can be obtained from dependent sets of a matroid. Finally, we show that the closure operator can be defined at least in three different ways. 2020-06-10 /pmc/articles/PMC7338161/ http://dx.doi.org/10.1007/978-3-030-52705-1_13 Text en © Springer Nature Switzerland AG 2020 This article is made available via the PMC Open Access Subset for unrestricted research re-use and secondary analysis in any form or by any means with acknowledgement of the original source. These permissions are granted for the duration of the World Health Organization (WHO) declaration of COVID-19 as a global pandemic.
spellingShingle Article
Restrepo, Mauricio
Cornelis, Chris
Attribute Reduction from Closure Operators and Matroids in Rough Set Theory
title Attribute Reduction from Closure Operators and Matroids in Rough Set Theory
title_full Attribute Reduction from Closure Operators and Matroids in Rough Set Theory
title_fullStr Attribute Reduction from Closure Operators and Matroids in Rough Set Theory
title_full_unstemmed Attribute Reduction from Closure Operators and Matroids in Rough Set Theory
title_short Attribute Reduction from Closure Operators and Matroids in Rough Set Theory
title_sort attribute reduction from closure operators and matroids in rough set theory
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7338161/
http://dx.doi.org/10.1007/978-3-030-52705-1_13
work_keys_str_mv AT restrepomauricio attributereductionfromclosureoperatorsandmatroidsinroughsettheory
AT cornelischris attributereductionfromclosureoperatorsandmatroidsinroughsettheory

Ejemplares similares