LiU Electronic Press
Full-text not available in DiVA
Author:
Vitoria, Aida (Linköping University, Department of Science and Technology, Visual Information Technology and Applications (VITA)) (Linköping University, The Institute of Technology)
Szalas, Andrzej (Linköping University, The Institute of Technology) (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab)
Maluszynski, Jan (Linköping University, The Institute of Technology) (Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory)
Title:
Four-valued Extension of Rough Sets
Department:
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab
Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory
Linköping University, The Institute of Technology
Linköping University, Department of Science and Technology, Visual Information Technology and Applications (VITA)
Publication type:
Conference paper (Refereed)
Language:
English
In:
Proceedings of the 3rd International Conference Rough Sets and Knowledge Technology (RSKT)
Publisher: Springer
Series:
Lecture Notes in Computer Science, ISSN 0302-9743; 5009
Pages:
106-114
Year of publ.:
2008
URI:
urn:nbn:se:liu:diva-43561
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-43561
ISBN:
978-3-540-79720-3
Local ID:
74200
Subject category:
Engineering and Technology
SVEP category:
TECHNOLOGY
Abstract(en) :

Rough set approximations of Pawlak [15] are sometimes generalized by using similarities between objects rather than elementary sets. In practical applications, both knowledge about properties of objects and knowledge of similarity between objects can be incomplete and inconsistent. The aim of this paper is to define set approximations when all sets, and their approximations, as well as similarity relations are four-valued. A set is four-valued in the sense that its membership function can have one of the four logical values: unknown (u), false (f), inconsistent (i), or true (t). To this end, a new implication operator and set-theoretical operations on four-valued sets, such as set containment, are introduced. Several properties of lower and upper approximations of four-valued sets are also presented.

Available from:
2009-10-10
Created:
2009-10-10
Last updated:
2011-03-04
Statistics:
86 hits