Paper Info
Title
Poset approaches to covering-based rough sets
Abstract
Rough set theory is a useful and effective tool to cope with granularity and vagueness in information system and has been used in many fields. However, it is hard to get the reduct of a covering in rough sets. This paper attempts to get the reduct of a covering at a high speed in theory. It defines upset and downset based on a poset in a covering, studies the relationship between reducible element and downset, and obtains some good results such as sufficient and necessary condition about the reducible element in a covering.
Year
DOI
Venue
2010
10.1007/978-3-642-16248-0_9
RSKT
Keywords
Field
DocType
rough set theory,reducible element,information system,rough set,effective tool,necessary condition,high speed,covering-based rough set,paper attempt,good result
Information system,Reduct,Computer science,Theoretical computer science,Upset,Artificial intelligence,Granularity,Dominance-based rough set approach,Discrete mathematics,Vagueness,Rough set,Machine learning,Partially ordered set
Conference
Volume
ISSN
ISBN
6401
0302-9743
3-642-16247-9
Citations 
PageRank 
References 
3
0.42
10
Authors
3
Name
Order
Citations
PageRank
Shiping Wang1975.94
William Zhu210110.05
Peiyong Zhu3598.68