An Attribute Reduction P System Based on Rough Set Theory

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Attribute reduction is an important issue in rough set theory. Many heuristic algorithms have been proposed to compute the minimal attribute reduction since it is a NP hard problem, while most of them have the drawback to fall into local optimal solution. The other way to solve this problem is based on parallel computing. Membrane computing model is a distributed, maximal parallel and non-deterministic computing model inspired from cell. In this paper, we attempt to solve the attribute reduction problem by membrane computing, and propose a cell-like P system to compute all exact minimal attribute reductions with time complexity.

Cite

CITATION STYLE

APA

Guo, P., & Xiang, J. (2018). An Attribute Reduction P System Based on Rough Set Theory. In Communications in Computer and Information Science (Vol. 951, pp. 198–212). Springer Verlag. https://doi.org/10.1007/978-981-13-2826-8_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free