Probabilistic rough set approximations
By Yiyu Yao. International Journal of Approximate Reasoning, 2008
581 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Systems
View Paper: https://www.semanticscholar.org/paper/80a9b1cb7a4afe2d85e57e379bfb8e477268957a
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
- Three-Way Decision: An Interpretation of Rules in Rough Set Theory (2009, methodology): “A detailed derivations of existing probabilistic models are given in other papers [16,17].”
- Rough Sets: Selected Methods and Applications in Management and Engineering (2012, methodology): “While this chapter only describes the rough k-means algorithm, a number of other alternatives based on Kohonen self-organizing maps [18], evolutionary partitive approach [11], and evolutionary k-medoids [19] are also available.”
- An Outline of a Theory of Three-Way Decisions (2012, background): “A main advantage of a DTRS model is its solid foundation based on Bayesian decision theory.”
- Decision-Theoretic Rough Set Models (2007, background): “Ever since the introduction of rough set theory by Pawlak in 1982 [10,11,13], many proposals have been made to incorporate probabilistic approaches into the theory [14,29,30,31].”
- Three-way decisions with probabilistic rough sets (2010, methodology): “From equation (9), it following that given (c0), the following conditions are both necessary and sufficient for the classical rough set model [37]:”