Reduction of Neighborhood-Based Generalized Rough Sets | Zendy

Zhaohao Wang | Zendy; Lan Shu | Zendy; Xiuyong Ding | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Reduction of Neighborhood-Based Generalized Rough Sets

Author(s) -

Zhaohao Wang,

Lan Shu,

Xiuyong Ding

Publication year - 2011

Publication title -

journal of applied mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.307

H-Index - 43

eISSN - 1687-0042

pISSN - 1110-757X

DOI - 10.1155/2011/409181

Subject(s) - rough set , granularity , mathematics , reduction (mathematics) , set (abstract data type) , data mining , computer science , geometry , programming language , operating system

Rough set theory is a powerful tool for dealing with uncertainty, granularity, and incompleteness of knowledge in information systems. This paper discusses five types of existing neighborhood-based generalized rough sets. The concepts of minimal neighborhood description and maximal neighborhood description of an element are defined, and by means of the two concepts, the properties and structures of the third and the fourth types of neighborhood-based rough sets are deeply explored. Furthermore, we systematically study the covering reduction of the third and the fourth types ofneighborhood-based rough sets in terms of the two concepts. Finally, two open problems proposed by Yun et al. (2011) are solved

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research