The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Approximations in Rough Sets vs Granular Computing for Coverings
Abstract
Rough set theory is an important technique in knowledge discovery in databases. Classical rough set theory proposed by Pawlak is based on equivalence relations, but many interesting and meaningful extensions have been made based on binary relations and coverings, respectively. This paper makes a comparison between covering rough sets and rough sets based on binary relations. This paper also focuses on the authors’ study of the condition under which the covering rough set can be generated by a binary relation and the binary relation based rough set can be generated by a covering.
Related Content
|
Hemalatha J. J., Bala Subramanian Chokkalingam, Vivek V., Sekar Mohan.
© 2023.
14 pages.
|
|
R. Muthuselvi, G. Nirmala.
© 2023.
12 pages.
|
|
Jerritta Selvaraj, Arun Sahayadhas.
© 2023.
16 pages.
|
|
Vidhya R., Sandhia G. K., Jansi K. R., Nagadevi S., Jeya R..
© 2023.
8 pages.
|
|
Shanthalakshmi Revathy J., Uma Maheswari N., Sasikala S..
© 2023.
13 pages.
|
|
Uma N. Dulhare, Shaik Rasool.
© 2023.
29 pages.
|
|
R. Nareshkumar, G. Suseela, K. Nimala, G. Niranjana.
© 2023.
22 pages.
|
|
|