DocumentCode
3471690
Title
Concept lattices in rough set theory
Author
Yao, Y.Y.
Author_Institution
Dept. of Comput. Sci., Regina Univ., Sask., Canada
Volume
2
fYear
2004
fDate
27-30 June 2004
Firstpage
796
Abstract
An alternative formulation of rough set theory can be developed based on a binary relation between two universes, one is a finite set of objects and the other is a finite set of properties. Rough set approximation operators are defined with respect to the binary relation. Three concept lattices are constructed based on approximation operators. They are different from, but related to, the concept lattice built in formal concept analysis. Through the study of the introduced concept lattices, one can obtain an in-depth understanding of data analysis using rough set theory.
Keywords
data analysis; rough set theory; binary relation; concept lattices; data analysis; rough set approximation operators; Computer science; Data analysis; Lattices; Logic; Rough sets; Set theory; Uniform resource locators;
fLanguage
English
Publisher
ieee
Conference_Titel
Fuzzy Information, 2004. Processing NAFIPS '04. IEEE Annual Meeting of the
Print_ISBN
0-7803-8376-1
Type
conf
DOI
10.1109/NAFIPS.2004.1337404
Filename
1337404
Link To Document