On strong Pawlak algebras

The rough top equality between subsets of a finite set was introduced by Novotny and Pawlak. Liu extended Pawlak rough set algebra to lattice form, called Pawlak algebra. In this paper, Strong Pawlak algebra which is more similar to Pawlak rough set algebra is introduced. Furthermore, Characterizati...

Full description

Saved in:
Bibliographic Details
Published in2009 International Conference on Machine Learning and Cybernetics Vol. 3; pp. 1399 - 1404
Main Authors Mingfen Wu, Xiangyun Xie, Cungen Cao
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.07.2009
Subjects
Algebra
Cybernetics
Machine learning
Pawlak algebra
Pawlak rough set algebra
Rough set
strong Pawlak algebra
top equality
Online AccessGet full text

Cover

More Information
Summary:The rough top equality between subsets of a finite set was introduced by Novotny and Pawlak. Liu extended Pawlak rough set algebra to lattice form, called Pawlak algebra. In this paper, Strong Pawlak algebra which is more similar to Pawlak rough set algebra is introduced. Furthermore, Characterizations of strong Pawlak algebra by a complete subalgebra of a fuzzy lattice are obtained. The top equality on a fuzzy lattice L is also characterized, which is a generalization of the top equality on Pawlak rough set algebra.
ISBN:9781424437023
1424437024
ISSN:2160-133X
DOI:10.1109/ICMLC.2009.5212261