Decision-Theoretic Rough Set Models
By Yiyu Yao. Rough Sets and Knowledge Technology, 2007
459 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Systems
View Paper: https://www.semanticscholar.org/paper/6cef63321eda6256de72f23e64ade797c11c8121
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Computational Theory and Mathematics
In Information Systems
Citations in the corpus
- An Outline of a Theory of Three-Way Decisions (2012, background): “It can be shown [50, 55] that under the following conditions,”
- Three-Way Decision: An Interpretation of Rules in Rough Set Theory (2009, methodology): “Under the two assumptions, we have the simplified rules [16]:”
- Attribute reduction in decision-theoretic rough set models (2008, methodology): “In the Pawlak model, one can have two types of rules, positive rules and boundary rules [45].”
- Computational Intelligence and Feature Selection - Rough and Fuzzy Approaches (2008, background): “In classical rough set theory, the negative region is always empty for partitions [402].”
- Three-way decisions with probabilistic rough sets (2010, methodology): “The following simplified rules are obtained after tie-breaking [36]: The parameter γ is no longer needed.”