Rough sets over the boolean algebras

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3641 LNAI, Issue , 2005, Pages 124-131

  Liu, Gui Long ^a  

^a BEIJING LANGUAGE AND CULTURE UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; BOOLEAN ALGEBRA; DATA MINING; MATHEMATICAL OPERATORS; MATRIX ALGEBRA;

APPROXIMATION OPERATOR; COLUMN VECTOR; MATRIX REPRESENTATION;

ROUGH SET THEORY;

EID: 33645995439     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11548669_13     Document Type: Conference Paper

References (10)

1. Pawlak, Z.: Rough sets, International Journal of Computer and Information Sciences 11 (1982) 341-356.
2. Pawlak, Z.: Rough sets-theoretical aspects of reasoning about data, Kluwer Academic Publishers, Boston, MA, 1991.
3. Yao, Y.Y.: Two views of the theory of rough sets in finite universes, International Journal of Approximation Reasoning, 15 (1996) 291-317.
4. Yao, Y.Y.: On generalizing pawlak approximation operators, Procedings of the First International Conference, RSCTC' 98, LNAI 1424, 1998, 298-307.
5. Yao, Y.Y.: Constructive and algebraic methods of the rough sets,Information Sciences, 109 (1998) 21-47.
6. Give'on, Y.: Lattice matrices, Information and Control,7 (1964) 477-484.
7. Baets, B.D., Meyer, H.D.: On the existence and construction of T-transitive closure, Information Sciences 152 (2003) 167-179.
8. Jarvinen, J.: On the structure of rough approximations, Fundamenta Informaticae 53 (2002) 135-153.
9. Grassmann, W.K., Tremblay, J.P.: Logic and discrete mathematics, a computer science perspective, Prentice Hall, 1996.
10. Banerjee, M., Pal, S.K.: Roughness of a fuzzy set, Information Sciences 93 (1996) 235-246.