Attribute reduction from closure operators and matroids in rough set theory
- Author
- Mauricio Restrepo and Chris Cornelis (UGent)
- Organization
- Abstract
- 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.
- Keywords
- Attribute reduction, Closure operators, Matroids, Rough sets, Approximation operators
Downloads
-
(...).pdf
- full text (Published version)
- |
- UGent only
- |
- |
- 276.35 KB
Citation
Please use this url to cite or link to this publication: http://hdl.handle.net/1854/LU-8770857
- MLA
- Restrepo, Mauricio, and Chris Cornelis. “Attribute Reduction from Closure Operators and Matroids in Rough Set Theory.” ROUGH SETS, IJCRS 2020, vol. 12179, Springer, 2020, pp. 183–92, doi:10.1007/978-3-030-52705-1_13.
- APA
- Restrepo, M., & Cornelis, C. (2020). Attribute reduction from closure operators and matroids in rough set theory. ROUGH SETS, IJCRS 2020, 12179, 183–192. https://doi.org/10.1007/978-3-030-52705-1_13
- Chicago author-date
- Restrepo, Mauricio, and Chris Cornelis. 2020. “Attribute Reduction from Closure Operators and Matroids in Rough Set Theory.” In ROUGH SETS, IJCRS 2020, 12179:183–92. Cham, Switzerland: Springer. https://doi.org/10.1007/978-3-030-52705-1_13.
- Chicago author-date (all authors)
- Restrepo, Mauricio, and Chris Cornelis. 2020. “Attribute Reduction from Closure Operators and Matroids in Rough Set Theory.” In ROUGH SETS, IJCRS 2020, 12179:183–192. Cham, Switzerland: Springer. doi:10.1007/978-3-030-52705-1_13.
- Vancouver
- 1.Restrepo M, Cornelis C. Attribute reduction from closure operators and matroids in rough set theory. In: ROUGH SETS, IJCRS 2020. Cham, Switzerland: Springer; 2020. p. 183–92.
- IEEE
- [1]M. Restrepo and C. Cornelis, “Attribute reduction from closure operators and matroids in rough set theory,” in ROUGH SETS, IJCRS 2020, Havana, Cuba, 2020, vol. 12179, pp. 183–192.
@inproceedings{8770857,
abstract = {{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.}},
author = {{Restrepo, Mauricio and Cornelis, Chris}},
booktitle = {{ROUGH SETS, IJCRS 2020}},
isbn = {{9783030527044}},
issn = {{0302-9743}},
keywords = {{Attribute reduction,Closure operators,Matroids,Rough sets,Approximation operators}},
language = {{eng}},
location = {{Havana, Cuba}},
pages = {{183--192}},
publisher = {{Springer}},
title = {{Attribute reduction from closure operators and matroids in rough set theory}},
url = {{http://doi.org/10.1007/978-3-030-52705-1_13}},
volume = {{12179}},
year = {{2020}},
}
- Altmetric
- View in Altmetric
- Web of Science
- Times cited: